./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix031_pso.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/mix031_pso.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 340d44e6d272edde8a4a60d91a9d70b9dcde31ef ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 01:22:18,259 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 01:22:18,261 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 01:22:18,277 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 01:22:18,277 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 01:22:18,278 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 01:22:18,280 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 01:22:18,282 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 01:22:18,284 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 01:22:18,285 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 01:22:18,286 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 01:22:18,286 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 01:22:18,287 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 01:22:18,288 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 01:22:18,290 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 01:22:18,291 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 01:22:18,292 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 01:22:18,294 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 01:22:18,296 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 01:22:18,298 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 01:22:18,299 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 01:22:18,301 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 01:22:18,304 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 01:22:18,304 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 01:22:18,304 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 01:22:18,306 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 01:22:18,307 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 01:22:18,308 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 01:22:18,309 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 01:22:18,310 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 01:22:18,310 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 01:22:18,311 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 01:22:18,311 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 01:22:18,312 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 01:22:18,313 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 01:22:18,314 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 01:22:18,314 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 01:22:18,345 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 01:22:18,346 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 01:22:18,348 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 01:22:18,349 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 01:22:18,349 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 01:22:18,349 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 01:22:18,349 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 01:22:18,349 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 01:22:18,351 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 01:22:18,351 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 01:22:18,351 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 01:22:18,351 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 01:22:18,351 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 01:22:18,352 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 01:22:18,352 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 01:22:18,352 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 01:22:18,352 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 01:22:18,352 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 01:22:18,352 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 01:22:18,353 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 01:22:18,353 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 01:22:18,353 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 01:22:18,353 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 01:22:18,353 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 01:22:18,354 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 01:22:18,355 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 01:22:18,355 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 01:22:18,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 01:22:18,355 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 -> 340d44e6d272edde8a4a60d91a9d70b9dcde31ef [2019-01-13 01:22:18,400 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 01:22:18,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 01:22:18,417 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 01:22:18,419 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 01:22:18,419 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 01:22:18,420 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix031_pso.opt_false-unreach-call.i [2019-01-13 01:22:18,478 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d26751415/aeca0eceec184b5b8874cecdb8a1b75c/FLAG8c563033b [2019-01-13 01:22:19,002 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 01:22:19,003 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix031_pso.opt_false-unreach-call.i [2019-01-13 01:22:19,021 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d26751415/aeca0eceec184b5b8874cecdb8a1b75c/FLAG8c563033b [2019-01-13 01:22:19,280 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d26751415/aeca0eceec184b5b8874cecdb8a1b75c [2019-01-13 01:22:19,284 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 01:22:19,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 01:22:19,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 01:22:19,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 01:22:19,290 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 01:22:19,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 01:22:19" (1/1) ... [2019-01-13 01:22:19,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72a0c3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:19, skipping insertion in model container [2019-01-13 01:22:19,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 01:22:19" (1/1) ... [2019-01-13 01:22:19,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 01:22:19,364 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 01:22:19,896 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 01:22:19,911 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 01:22:20,099 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 01:22:20,180 INFO L195 MainTranslator]: Completed translation [2019-01-13 01:22:20,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:20 WrapperNode [2019-01-13 01:22:20,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 01:22:20,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 01:22:20,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 01:22:20,183 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 01:22:20,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:20" (1/1) ... [2019-01-13 01:22:20,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:20" (1/1) ... [2019-01-13 01:22:20,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 01:22:20,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 01:22:20,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 01:22:20,277 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 01:22:20,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:20" (1/1) ... [2019-01-13 01:22:20,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:20" (1/1) ... [2019-01-13 01:22:20,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:20" (1/1) ... [2019-01-13 01:22:20,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:20" (1/1) ... [2019-01-13 01:22:20,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:20" (1/1) ... [2019-01-13 01:22:20,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:20" (1/1) ... [2019-01-13 01:22:20,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:20" (1/1) ... [2019-01-13 01:22:20,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 01:22:20,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 01:22:20,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 01:22:20,317 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 01:22:20,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 01:22:20,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 01:22:20,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 01:22:20,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 01:22:20,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 01:22:20,374 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 01:22:20,374 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 01:22:20,374 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 01:22:20,374 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 01:22:20,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 01:22:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 01:22:20,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 01:22:20,377 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 01:22:21,417 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 01:22:21,418 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 01:22:21,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 01:22:21 BoogieIcfgContainer [2019-01-13 01:22:21,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 01:22:21,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 01:22:21,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 01:22:21,425 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 01:22:21,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 01:22:19" (1/3) ... [2019-01-13 01:22:21,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f7ca00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 01:22:21, skipping insertion in model container [2019-01-13 01:22:21,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:20" (2/3) ... [2019-01-13 01:22:21,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f7ca00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 01:22:21, skipping insertion in model container [2019-01-13 01:22:21,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 01:22:21" (3/3) ... [2019-01-13 01:22:21,431 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031_pso.opt_false-unreach-call.i [2019-01-13 01:22:21,476 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,476 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,476 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,476 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,477 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,477 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,477 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,477 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,478 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,478 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,478 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,478 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,479 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,481 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,481 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,482 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,482 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,482 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,482 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,483 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,483 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,483 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,483 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,483 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,485 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,485 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,485 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,486 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,487 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,487 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,487 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,487 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,487 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,488 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,488 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,488 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,488 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,488 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,490 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,491 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,491 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,491 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,491 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,491 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,492 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,493 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,493 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,493 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,494 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,494 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,495 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,495 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,495 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,496 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,496 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,496 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,496 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,496 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,497 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,498 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,498 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,499 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,499 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,499 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,499 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,499 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,500 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,501 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,501 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,502 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,502 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,502 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,502 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,503 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,504 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,504 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,504 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,504 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,505 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,505 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,505 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,505 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,506 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,507 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,507 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,508 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,508 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,509 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,509 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,509 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,509 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,509 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,510 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,510 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,510 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,510 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,510 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,510 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,513 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,514 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,514 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,514 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,514 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,514 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,515 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,515 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,515 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,515 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,516 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,517 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,517 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,518 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,518 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,518 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,518 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,519 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,520 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,520 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,520 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,520 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,521 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,521 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,521 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,521 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,522 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,523 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,523 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,524 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,524 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,525 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,525 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,525 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,525 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,525 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,525 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,527 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:21,542 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 01:22:21,543 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 01:22:21,552 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 01:22:21,568 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 01:22:21,595 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 01:22:21,596 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 01:22:21,596 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 01:22:21,596 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 01:22:21,597 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 01:22:21,597 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 01:22:21,597 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 01:22:21,597 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 01:22:21,597 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 01:22:21,613 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 134places, 166 transitions [2019-01-13 01:22:23,382 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27858 states. [2019-01-13 01:22:23,384 INFO L276 IsEmpty]: Start isEmpty. Operand 27858 states. [2019-01-13 01:22:23,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-13 01:22:23,393 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:23,394 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] [2019-01-13 01:22:23,397 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:23,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:23,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1858856236, now seen corresponding path program 1 times [2019-01-13 01:22:23,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:23,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:23,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:23,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:23,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:23,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:22:23,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:23,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:22:23,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:22:23,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:22:23,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:22:23,787 INFO L87 Difference]: Start difference. First operand 27858 states. Second operand 4 states. [2019-01-13 01:22:25,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:25,046 INFO L93 Difference]: Finished difference Result 47770 states and 183121 transitions. [2019-01-13 01:22:25,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 01:22:25,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-01-13 01:22:25,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:25,437 INFO L225 Difference]: With dead ends: 47770 [2019-01-13 01:22:25,437 INFO L226 Difference]: Without dead ends: 34610 [2019-01-13 01:22:25,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:22:26,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34610 states. [2019-01-13 01:22:26,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34610 to 21758. [2019-01-13 01:22:26,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21758 states. [2019-01-13 01:22:27,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21758 states to 21758 states and 83443 transitions. [2019-01-13 01:22:27,052 INFO L78 Accepts]: Start accepts. Automaton has 21758 states and 83443 transitions. Word has length 41 [2019-01-13 01:22:27,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:27,053 INFO L480 AbstractCegarLoop]: Abstraction has 21758 states and 83443 transitions. [2019-01-13 01:22:27,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:22:27,053 INFO L276 IsEmpty]: Start isEmpty. Operand 21758 states and 83443 transitions. [2019-01-13 01:22:27,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-13 01:22:27,069 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:27,069 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] [2019-01-13 01:22:27,069 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:27,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:27,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1910881222, now seen corresponding path program 1 times [2019-01-13 01:22:27,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:27,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:27,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:27,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:27,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:27,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:22:27,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:27,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:22:27,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:22:27,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:22:27,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:22:27,304 INFO L87 Difference]: Start difference. First operand 21758 states and 83443 transitions. Second operand 4 states. [2019-01-13 01:22:27,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:27,722 INFO L93 Difference]: Finished difference Result 7172 states and 23628 transitions. [2019-01-13 01:22:27,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 01:22:27,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-01-13 01:22:27,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:27,755 INFO L225 Difference]: With dead ends: 7172 [2019-01-13 01:22:27,755 INFO L226 Difference]: Without dead ends: 6326 [2019-01-13 01:22:27,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:22:27,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6326 states. [2019-01-13 01:22:27,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6326 to 6326. [2019-01-13 01:22:27,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6326 states. [2019-01-13 01:22:27,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6326 states to 6326 states and 20700 transitions. [2019-01-13 01:22:27,985 INFO L78 Accepts]: Start accepts. Automaton has 6326 states and 20700 transitions. Word has length 49 [2019-01-13 01:22:27,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:27,987 INFO L480 AbstractCegarLoop]: Abstraction has 6326 states and 20700 transitions. [2019-01-13 01:22:27,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:22:27,987 INFO L276 IsEmpty]: Start isEmpty. Operand 6326 states and 20700 transitions. [2019-01-13 01:22:27,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-13 01:22:27,992 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:27,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:22:27,993 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:27,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:27,994 INFO L82 PathProgramCache]: Analyzing trace with hash 844464111, now seen corresponding path program 1 times [2019-01-13 01:22:27,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:27,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:28,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:28,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:28,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:28,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:22:28,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:28,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:22:28,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:22:28,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:22:28,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:22:28,240 INFO L87 Difference]: Start difference. First operand 6326 states and 20700 transitions. Second operand 5 states. [2019-01-13 01:22:29,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:29,598 INFO L93 Difference]: Finished difference Result 12022 states and 38786 transitions. [2019-01-13 01:22:29,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:22:29,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-01-13 01:22:29,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:29,645 INFO L225 Difference]: With dead ends: 12022 [2019-01-13 01:22:29,646 INFO L226 Difference]: Without dead ends: 11947 [2019-01-13 01:22:29,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:22:29,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11947 states. [2019-01-13 01:22:29,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11947 to 8291. [2019-01-13 01:22:29,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8291 states. [2019-01-13 01:22:29,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8291 states to 8291 states and 26553 transitions. [2019-01-13 01:22:29,929 INFO L78 Accepts]: Start accepts. Automaton has 8291 states and 26553 transitions. Word has length 50 [2019-01-13 01:22:29,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:29,930 INFO L480 AbstractCegarLoop]: Abstraction has 8291 states and 26553 transitions. [2019-01-13 01:22:29,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:22:29,935 INFO L276 IsEmpty]: Start isEmpty. Operand 8291 states and 26553 transitions. [2019-01-13 01:22:29,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-13 01:22:29,938 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:29,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:22:29,940 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:29,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:29,940 INFO L82 PathProgramCache]: Analyzing trace with hash 663764693, now seen corresponding path program 1 times [2019-01-13 01:22:29,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:29,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:29,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:29,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:29,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:30,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:22:30,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:30,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 01:22:30,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 01:22:30,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 01:22:30,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 01:22:30,038 INFO L87 Difference]: Start difference. First operand 8291 states and 26553 transitions. Second operand 3 states. [2019-01-13 01:22:30,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:30,312 INFO L93 Difference]: Finished difference Result 10987 states and 34708 transitions. [2019-01-13 01:22:30,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 01:22:30,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-01-13 01:22:30,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:30,355 INFO L225 Difference]: With dead ends: 10987 [2019-01-13 01:22:30,355 INFO L226 Difference]: Without dead ends: 10983 [2019-01-13 01:22:30,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 01:22:30,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10983 states. [2019-01-13 01:22:30,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10983 to 8509. [2019-01-13 01:22:30,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8509 states. [2019-01-13 01:22:30,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8509 states to 8509 states and 26989 transitions. [2019-01-13 01:22:30,617 INFO L78 Accepts]: Start accepts. Automaton has 8509 states and 26989 transitions. Word has length 52 [2019-01-13 01:22:30,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:30,618 INFO L480 AbstractCegarLoop]: Abstraction has 8509 states and 26989 transitions. [2019-01-13 01:22:30,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 01:22:30,618 INFO L276 IsEmpty]: Start isEmpty. Operand 8509 states and 26989 transitions. [2019-01-13 01:22:30,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 01:22:30,622 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:30,622 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] [2019-01-13 01:22:30,622 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:30,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:30,623 INFO L82 PathProgramCache]: Analyzing trace with hash -324933472, now seen corresponding path program 1 times [2019-01-13 01:22:30,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:30,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:30,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:30,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:30,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:30,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:22:30,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:30,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:22:30,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:22:30,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:22:30,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:22:30,821 INFO L87 Difference]: Start difference. First operand 8509 states and 26989 transitions. Second operand 6 states. [2019-01-13 01:22:31,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:31,486 INFO L93 Difference]: Finished difference Result 11925 states and 37200 transitions. [2019-01-13 01:22:31,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 01:22:31,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-01-13 01:22:31,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:31,522 INFO L225 Difference]: With dead ends: 11925 [2019-01-13 01:22:31,522 INFO L226 Difference]: Without dead ends: 11828 [2019-01-13 01:22:31,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-13 01:22:31,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11828 states. [2019-01-13 01:22:31,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11828 to 9283. [2019-01-13 01:22:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9283 states. [2019-01-13 01:22:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9283 states to 9283 states and 29433 transitions. [2019-01-13 01:22:32,063 INFO L78 Accepts]: Start accepts. Automaton has 9283 states and 29433 transitions. Word has length 56 [2019-01-13 01:22:32,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:32,063 INFO L480 AbstractCegarLoop]: Abstraction has 9283 states and 29433 transitions. [2019-01-13 01:22:32,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:22:32,063 INFO L276 IsEmpty]: Start isEmpty. Operand 9283 states and 29433 transitions. [2019-01-13 01:22:32,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 01:22:32,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:32,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:22:32,083 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:32,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:32,083 INFO L82 PathProgramCache]: Analyzing trace with hash 841395753, now seen corresponding path program 1 times [2019-01-13 01:22:32,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:32,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:32,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:32,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:32,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:32,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:22:32,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:32,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:22:32,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:22:32,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:22:32,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:22:32,239 INFO L87 Difference]: Start difference. First operand 9283 states and 29433 transitions. Second operand 4 states. [2019-01-13 01:22:32,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:32,689 INFO L93 Difference]: Finished difference Result 10902 states and 34384 transitions. [2019-01-13 01:22:32,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 01:22:32,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-01-13 01:22:32,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:32,714 INFO L225 Difference]: With dead ends: 10902 [2019-01-13 01:22:32,714 INFO L226 Difference]: Without dead ends: 10902 [2019-01-13 01:22:32,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:22:32,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10902 states. [2019-01-13 01:22:32,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10902 to 9934. [2019-01-13 01:22:32,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9934 states. [2019-01-13 01:22:33,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9934 states to 9934 states and 31410 transitions. [2019-01-13 01:22:33,004 INFO L78 Accepts]: Start accepts. Automaton has 9934 states and 31410 transitions. Word has length 66 [2019-01-13 01:22:33,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:33,005 INFO L480 AbstractCegarLoop]: Abstraction has 9934 states and 31410 transitions. [2019-01-13 01:22:33,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:22:33,005 INFO L276 IsEmpty]: Start isEmpty. Operand 9934 states and 31410 transitions. [2019-01-13 01:22:33,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 01:22:33,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:33,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:22:33,024 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:33,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:33,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1710761208, now seen corresponding path program 1 times [2019-01-13 01:22:33,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:33,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:33,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:33,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:33,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:33,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:22:33,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:33,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:22:33,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:22:33,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:22:33,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:22:33,311 INFO L87 Difference]: Start difference. First operand 9934 states and 31410 transitions. Second operand 5 states. [2019-01-13 01:22:33,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:33,457 INFO L93 Difference]: Finished difference Result 2986 states and 7671 transitions. [2019-01-13 01:22:33,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 01:22:33,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-01-13 01:22:33,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:33,461 INFO L225 Difference]: With dead ends: 2986 [2019-01-13 01:22:33,461 INFO L226 Difference]: Without dead ends: 2434 [2019-01-13 01:22:33,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:22:33,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2019-01-13 01:22:33,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2316. [2019-01-13 01:22:33,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2316 states. [2019-01-13 01:22:33,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 5797 transitions. [2019-01-13 01:22:33,493 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 5797 transitions. Word has length 66 [2019-01-13 01:22:33,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:33,494 INFO L480 AbstractCegarLoop]: Abstraction has 2316 states and 5797 transitions. [2019-01-13 01:22:33,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:22:33,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 5797 transitions. [2019-01-13 01:22:33,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 01:22:33,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:33,500 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] [2019-01-13 01:22:33,500 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:33,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:33,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1256633268, now seen corresponding path program 1 times [2019-01-13 01:22:33,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:33,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:33,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:33,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:33,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:22:33,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:33,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:22:33,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:22:33,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:22:33,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:22:33,805 INFO L87 Difference]: Start difference. First operand 2316 states and 5797 transitions. Second operand 4 states. [2019-01-13 01:22:34,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:34,222 INFO L93 Difference]: Finished difference Result 3237 states and 7911 transitions. [2019-01-13 01:22:34,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 01:22:34,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-01-13 01:22:34,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:34,228 INFO L225 Difference]: With dead ends: 3237 [2019-01-13 01:22:34,228 INFO L226 Difference]: Without dead ends: 3237 [2019-01-13 01:22:34,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:22:34,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3237 states. [2019-01-13 01:22:34,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3237 to 2818. [2019-01-13 01:22:34,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2818 states. [2019-01-13 01:22:34,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 6932 transitions. [2019-01-13 01:22:34,276 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 6932 transitions. Word has length 85 [2019-01-13 01:22:34,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:34,276 INFO L480 AbstractCegarLoop]: Abstraction has 2818 states and 6932 transitions. [2019-01-13 01:22:34,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:22:34,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 6932 transitions. [2019-01-13 01:22:34,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 01:22:34,283 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:34,283 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] [2019-01-13 01:22:34,283 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:34,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:34,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1586399029, now seen corresponding path program 1 times [2019-01-13 01:22:34,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:34,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:34,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:34,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:34,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:34,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:22:34,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:34,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:22:34,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:22:34,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:22:34,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:22:34,621 INFO L87 Difference]: Start difference. First operand 2818 states and 6932 transitions. Second operand 6 states. [2019-01-13 01:22:35,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:35,452 INFO L93 Difference]: Finished difference Result 3720 states and 9029 transitions. [2019-01-13 01:22:35,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:22:35,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-01-13 01:22:35,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:35,459 INFO L225 Difference]: With dead ends: 3720 [2019-01-13 01:22:35,459 INFO L226 Difference]: Without dead ends: 3633 [2019-01-13 01:22:35,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-13 01:22:35,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3633 states. [2019-01-13 01:22:35,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3633 to 3450. [2019-01-13 01:22:35,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3450 states. [2019-01-13 01:22:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 3450 states and 8445 transitions. [2019-01-13 01:22:35,513 INFO L78 Accepts]: Start accepts. Automaton has 3450 states and 8445 transitions. Word has length 85 [2019-01-13 01:22:35,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:35,513 INFO L480 AbstractCegarLoop]: Abstraction has 3450 states and 8445 transitions. [2019-01-13 01:22:35,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:22:35,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3450 states and 8445 transitions. [2019-01-13 01:22:35,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 01:22:35,521 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:35,521 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] [2019-01-13 01:22:35,522 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:35,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:35,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1575198924, now seen corresponding path program 2 times [2019-01-13 01:22:35,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:35,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:35,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:35,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:35,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:22:35,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:35,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 01:22:35,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 01:22:35,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 01:22:35,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:22:35,767 INFO L87 Difference]: Start difference. First operand 3450 states and 8445 transitions. Second operand 7 states. [2019-01-13 01:22:36,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:36,464 INFO L93 Difference]: Finished difference Result 4419 states and 10851 transitions. [2019-01-13 01:22:36,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:22:36,466 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-01-13 01:22:36,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:36,473 INFO L225 Difference]: With dead ends: 4419 [2019-01-13 01:22:36,473 INFO L226 Difference]: Without dead ends: 4419 [2019-01-13 01:22:36,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:22:36,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4419 states. [2019-01-13 01:22:36,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4419 to 3616. [2019-01-13 01:22:36,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3616 states. [2019-01-13 01:22:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3616 states to 3616 states and 8928 transitions. [2019-01-13 01:22:36,519 INFO L78 Accepts]: Start accepts. Automaton has 3616 states and 8928 transitions. Word has length 85 [2019-01-13 01:22:36,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:36,519 INFO L480 AbstractCegarLoop]: Abstraction has 3616 states and 8928 transitions. [2019-01-13 01:22:36,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 01:22:36,520 INFO L276 IsEmpty]: Start isEmpty. Operand 3616 states and 8928 transitions. [2019-01-13 01:22:36,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 01:22:36,527 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:36,528 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] [2019-01-13 01:22:36,528 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:36,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:36,528 INFO L82 PathProgramCache]: Analyzing trace with hash 663715446, now seen corresponding path program 1 times [2019-01-13 01:22:36,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:36,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:36,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:36,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:22:36,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:36,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:22:36,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:36,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:22:36,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:22:36,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:22:36,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:22:36,705 INFO L87 Difference]: Start difference. First operand 3616 states and 8928 transitions. Second operand 6 states. [2019-01-13 01:22:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:37,166 INFO L93 Difference]: Finished difference Result 4458 states and 10391 transitions. [2019-01-13 01:22:37,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 01:22:37,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-01-13 01:22:37,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:37,174 INFO L225 Difference]: With dead ends: 4458 [2019-01-13 01:22:37,174 INFO L226 Difference]: Without dead ends: 4458 [2019-01-13 01:22:37,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 01:22:37,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4458 states. [2019-01-13 01:22:37,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4458 to 3776. [2019-01-13 01:22:37,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3776 states. [2019-01-13 01:22:37,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3776 states to 3776 states and 8901 transitions. [2019-01-13 01:22:37,235 INFO L78 Accepts]: Start accepts. Automaton has 3776 states and 8901 transitions. Word has length 85 [2019-01-13 01:22:37,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:37,235 INFO L480 AbstractCegarLoop]: Abstraction has 3776 states and 8901 transitions. [2019-01-13 01:22:37,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:22:37,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3776 states and 8901 transitions. [2019-01-13 01:22:37,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 01:22:37,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:37,244 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] [2019-01-13 01:22:37,245 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:37,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:37,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1905770953, now seen corresponding path program 1 times [2019-01-13 01:22:37,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:37,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:37,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:37,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:37,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:22:37,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:37,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:22:37,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:22:37,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:22:37,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:22:37,596 INFO L87 Difference]: Start difference. First operand 3776 states and 8901 transitions. Second operand 5 states. [2019-01-13 01:22:38,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:38,333 INFO L93 Difference]: Finished difference Result 4707 states and 10963 transitions. [2019-01-13 01:22:38,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 01:22:38,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-01-13 01:22:38,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:38,340 INFO L225 Difference]: With dead ends: 4707 [2019-01-13 01:22:38,341 INFO L226 Difference]: Without dead ends: 4683 [2019-01-13 01:22:38,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:22:38,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4683 states. [2019-01-13 01:22:38,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4683 to 3895. [2019-01-13 01:22:38,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3895 states. [2019-01-13 01:22:38,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3895 states to 3895 states and 9135 transitions. [2019-01-13 01:22:38,576 INFO L78 Accepts]: Start accepts. Automaton has 3895 states and 9135 transitions. Word has length 85 [2019-01-13 01:22:38,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:38,577 INFO L480 AbstractCegarLoop]: Abstraction has 3895 states and 9135 transitions. [2019-01-13 01:22:38,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:22:38,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3895 states and 9135 transitions. [2019-01-13 01:22:38,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 01:22:38,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:38,583 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] [2019-01-13 01:22:38,583 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:38,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:38,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1585809449, now seen corresponding path program 2 times [2019-01-13 01:22:38,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:38,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:38,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:38,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:38,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:22:38,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:38,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:22:38,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:22:38,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:22:38,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:22:38,757 INFO L87 Difference]: Start difference. First operand 3895 states and 9135 transitions. Second operand 4 states. [2019-01-13 01:22:38,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:38,896 INFO L93 Difference]: Finished difference Result 4103 states and 9671 transitions. [2019-01-13 01:22:38,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 01:22:38,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-01-13 01:22:38,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:38,903 INFO L225 Difference]: With dead ends: 4103 [2019-01-13 01:22:38,903 INFO L226 Difference]: Without dead ends: 4103 [2019-01-13 01:22:38,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:22:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2019-01-13 01:22:38,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 3959. [2019-01-13 01:22:38,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3959 states. [2019-01-13 01:22:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3959 states to 3959 states and 9311 transitions. [2019-01-13 01:22:38,953 INFO L78 Accepts]: Start accepts. Automaton has 3959 states and 9311 transitions. Word has length 85 [2019-01-13 01:22:38,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:38,953 INFO L480 AbstractCegarLoop]: Abstraction has 3959 states and 9311 transitions. [2019-01-13 01:22:38,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:22:38,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3959 states and 9311 transitions. [2019-01-13 01:22:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-13 01:22:38,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:38,960 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] [2019-01-13 01:22:38,960 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:38,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:38,961 INFO L82 PathProgramCache]: Analyzing trace with hash -221645014, now seen corresponding path program 1 times [2019-01-13 01:22:38,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:38,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:38,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:38,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:22:38,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:39,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:22:39,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:39,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:22:39,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:22:39,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:22:39,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:22:39,322 INFO L87 Difference]: Start difference. First operand 3959 states and 9311 transitions. Second operand 6 states. [2019-01-13 01:22:39,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:39,479 INFO L93 Difference]: Finished difference Result 3911 states and 9063 transitions. [2019-01-13 01:22:39,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 01:22:39,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-01-13 01:22:39,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:39,485 INFO L225 Difference]: With dead ends: 3911 [2019-01-13 01:22:39,486 INFO L226 Difference]: Without dead ends: 3911 [2019-01-13 01:22:39,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:22:39,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3911 states. [2019-01-13 01:22:39,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3911 to 3289. [2019-01-13 01:22:39,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3289 states. [2019-01-13 01:22:39,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 3289 states and 7670 transitions. [2019-01-13 01:22:39,524 INFO L78 Accepts]: Start accepts. Automaton has 3289 states and 7670 transitions. Word has length 85 [2019-01-13 01:22:39,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:39,524 INFO L480 AbstractCegarLoop]: Abstraction has 3289 states and 7670 transitions. [2019-01-13 01:22:39,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:22:39,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3289 states and 7670 transitions. [2019-01-13 01:22:39,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-13 01:22:39,530 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:39,530 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] [2019-01-13 01:22:39,530 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:39,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:39,531 INFO L82 PathProgramCache]: Analyzing trace with hash 358607745, now seen corresponding path program 1 times [2019-01-13 01:22:39,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:39,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:39,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:39,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:39,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:39,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:22:39,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:39,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 01:22:39,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 01:22:39,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 01:22:39,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-13 01:22:39,802 INFO L87 Difference]: Start difference. First operand 3289 states and 7670 transitions. Second operand 10 states. [2019-01-13 01:22:41,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:41,392 INFO L93 Difference]: Finished difference Result 6298 states and 14804 transitions. [2019-01-13 01:22:41,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 01:22:41,393 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-01-13 01:22:41,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:41,398 INFO L225 Difference]: With dead ends: 6298 [2019-01-13 01:22:41,398 INFO L226 Difference]: Without dead ends: 2478 [2019-01-13 01:22:41,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-01-13 01:22:41,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2019-01-13 01:22:41,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2478. [2019-01-13 01:22:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2478 states. [2019-01-13 01:22:41,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 5845 transitions. [2019-01-13 01:22:41,423 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 5845 transitions. Word has length 87 [2019-01-13 01:22:41,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:41,424 INFO L480 AbstractCegarLoop]: Abstraction has 2478 states and 5845 transitions. [2019-01-13 01:22:41,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 01:22:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 5845 transitions. [2019-01-13 01:22:41,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-13 01:22:41,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:41,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 01:22:41,428 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:41,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:41,429 INFO L82 PathProgramCache]: Analyzing trace with hash 792045687, now seen corresponding path program 2 times [2019-01-13 01:22:41,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:41,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:41,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:41,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:41,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:41,709 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 01:22:41,890 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-13 01:22:42,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:22:42,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:42,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 01:22:42,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 01:22:42,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 01:22:42,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-13 01:22:42,188 INFO L87 Difference]: Start difference. First operand 2478 states and 5845 transitions. Second operand 11 states. [2019-01-13 01:22:43,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:43,265 INFO L93 Difference]: Finished difference Result 4068 states and 9576 transitions. [2019-01-13 01:22:43,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 01:22:43,266 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2019-01-13 01:22:43,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:43,271 INFO L225 Difference]: With dead ends: 4068 [2019-01-13 01:22:43,271 INFO L226 Difference]: Without dead ends: 2719 [2019-01-13 01:22:43,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-01-13 01:22:43,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2019-01-13 01:22:43,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 2513. [2019-01-13 01:22:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2019-01-13 01:22:43,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 5872 transitions. [2019-01-13 01:22:43,304 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 5872 transitions. Word has length 87 [2019-01-13 01:22:43,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:43,304 INFO L480 AbstractCegarLoop]: Abstraction has 2513 states and 5872 transitions. [2019-01-13 01:22:43,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 01:22:43,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 5872 transitions. [2019-01-13 01:22:43,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-13 01:22:43,309 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:43,310 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] [2019-01-13 01:22:43,310 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:43,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:43,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1869156796, now seen corresponding path program 1 times [2019-01-13 01:22:43,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:43,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:43,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:43,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:22:43,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:43,745 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-13 01:22:43,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:22:43,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:43,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:22:43,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:22:43,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:22:43,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:22:43,920 INFO L87 Difference]: Start difference. First operand 2513 states and 5872 transitions. Second operand 6 states. [2019-01-13 01:22:44,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:44,155 INFO L93 Difference]: Finished difference Result 2692 states and 6176 transitions. [2019-01-13 01:22:44,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:22:44,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-01-13 01:22:44,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:44,161 INFO L225 Difference]: With dead ends: 2692 [2019-01-13 01:22:44,161 INFO L226 Difference]: Without dead ends: 2634 [2019-01-13 01:22:44,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:22:44,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2019-01-13 01:22:44,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2280. [2019-01-13 01:22:44,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2019-01-13 01:22:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 5231 transitions. [2019-01-13 01:22:44,188 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 5231 transitions. Word has length 87 [2019-01-13 01:22:44,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:22:44,188 INFO L480 AbstractCegarLoop]: Abstraction has 2280 states and 5231 transitions. [2019-01-13 01:22:44,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:22:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 5231 transitions. [2019-01-13 01:22:44,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-13 01:22:44,193 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:44,193 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] [2019-01-13 01:22:44,193 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:44,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:44,193 INFO L82 PathProgramCache]: Analyzing trace with hash -208052547, now seen corresponding path program 3 times [2019-01-13 01:22:44,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:44,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:44,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:44,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:44,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 01:22:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 01:22:44,314 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 01:22:44,509 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 01:22:44,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 01:22:44 BasicIcfg [2019-01-13 01:22:44,515 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 01:22:44,515 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 01:22:44,516 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 01:22:44,516 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 01:22:44,517 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 01:22:21" (3/4) ... [2019-01-13 01:22:44,520 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 01:22:44,701 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 01:22:44,701 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 01:22:44,702 INFO L168 Benchmark]: Toolchain (without parser) took 25417.23 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 725.6 MB). Free memory was 951.4 MB in the beginning and 803.8 MB in the end (delta: 147.6 MB). Peak memory consumption was 873.2 MB. Max. memory is 11.5 GB. [2019-01-13 01:22:44,702 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 01:22:44,706 INFO L168 Benchmark]: CACSL2BoogieTranslator took 894.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2019-01-13 01:22:44,707 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-13 01:22:44,708 INFO L168 Benchmark]: Boogie Preprocessor took 38.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 01:22:44,708 INFO L168 Benchmark]: RCFGBuilder took 1103.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 11.5 GB. [2019-01-13 01:22:44,708 INFO L168 Benchmark]: TraceAbstraction took 23093.67 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 584.1 MB). Free memory was 1.1 GB in the beginning and 834.1 MB in the end (delta: 230.5 MB). Peak memory consumption was 814.6 MB. Max. memory is 11.5 GB. [2019-01-13 01:22:44,708 INFO L168 Benchmark]: Witness Printer took 185.36 ms. Allocated memory is still 1.8 GB. Free memory was 834.1 MB in the beginning and 803.8 MB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2019-01-13 01:22:44,716 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 894.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1103.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23093.67 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 584.1 MB). Free memory was 1.1 GB in the beginning and 834.1 MB in the end (delta: 230.5 MB). Peak memory consumption was 814.6 MB. Max. memory is 11.5 GB. * Witness Printer took 185.36 ms. Allocated memory is still 1.8 GB. Free memory was 834.1 MB in the beginning and 803.8 MB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 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] [L682] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L683] -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, a=0, main$tmp_guard0=0] [L684] -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, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L686] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L688] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L689] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L690] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L691] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L692] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L693] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L694] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L695] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L696] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L697] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L698] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L699] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L700] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L701] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L702] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L704] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L705] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L706] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] -1 pthread_t t841; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L787] FCALL, FORK -1 pthread_create(&t841, ((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, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] -1 pthread_t t842; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK -1 pthread_create(&t842, ((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, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 0 y$w_buff1 = y$w_buff0 [L745] 0 y$w_buff0 = 1 [L746] 0 y$w_buff1_used = y$w_buff0_used [L747] 0 y$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, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L749] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L750] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L751] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L752] 0 y$r_buff0_thd2 = (_Bool)1 [L755] 0 z = 1 [L758] 0 __unbuffered_p1_EAX = z [L761] 0 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 a = 1 [L713] 1 x = 1 [L716] 1 __unbuffered_p0_EAX = x [L719] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L720] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L721] 1 y$flush_delayed = weak$$choice2 [L722] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L724] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L724] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L725] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L726] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L727] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$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, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L727] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L728] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L728] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L729] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$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, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L730] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L731] 1 y = y$flush_delayed ? y$mem_tmp : y [L732] 1 y$flush_delayed = (_Bool)0 [L737] 1 __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, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 0 __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, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -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, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L796] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L796] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L802] -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, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 202 locations, 3 error locations. UNSAFE Result, 22.9s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 11.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3995 SDtfs, 4465 SDslu, 9371 SDs, 0 SdLazy, 3502 SolverSat, 194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 39 SyntacticMatches, 11 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27858occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 26814 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1323 NumberOfCodeBlocks, 1323 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1219 ConstructedInterpolants, 0 QuantifiedInterpolants, 231127 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...