./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix012_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix012_power.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aac2a7ad1130f4cb0499bd7cde65df0a82a8d241 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 23:29:35,294 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 23:29:35,296 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 23:29:35,320 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 23:29:35,321 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 23:29:35,323 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 23:29:35,324 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 23:29:35,326 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 23:29:35,328 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 23:29:35,329 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 23:29:35,330 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 23:29:35,330 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 23:29:35,331 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 23:29:35,332 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 23:29:35,333 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 23:29:35,334 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 23:29:35,335 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 23:29:35,337 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 23:29:35,339 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 23:29:35,341 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 23:29:35,342 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 23:29:35,344 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 23:29:35,346 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 23:29:35,347 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 23:29:35,348 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 23:29:35,349 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 23:29:35,350 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 23:29:35,353 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 23:29:35,354 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 23:29:35,357 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 23:29:35,357 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 23:29:35,358 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 23:29:35,358 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 23:29:35,358 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 23:29:35,359 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 23:29:35,361 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 23:29:35,361 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 23:29:35,391 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 23:29:35,391 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 23:29:35,393 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 23:29:35,393 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 23:29:35,393 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 23:29:35,393 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 23:29:35,394 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 23:29:35,394 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 23:29:35,394 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 23:29:35,395 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 23:29:35,395 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 23:29:35,395 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 23:29:35,395 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 23:29:35,395 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 23:29:35,395 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 23:29:35,396 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 23:29:35,396 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 23:29:35,396 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 23:29:35,396 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 23:29:35,396 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 23:29:35,397 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 23:29:35,398 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 23:29:35,398 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 23:29:35,398 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 23:29:35,399 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 23:29:35,399 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 23:29:35,399 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 23:29:35,399 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 23:29:35,399 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 -> aac2a7ad1130f4cb0499bd7cde65df0a82a8d241 [2019-01-12 23:29:35,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 23:29:35,471 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 23:29:35,476 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 23:29:35,478 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 23:29:35,478 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 23:29:35,479 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix012_power.opt_false-unreach-call.i [2019-01-12 23:29:35,546 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6baf23ee9/688d860893a54ab49a212430f8eafd29/FLAG2f6deceee [2019-01-12 23:29:36,059 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 23:29:36,060 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix012_power.opt_false-unreach-call.i [2019-01-12 23:29:36,081 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6baf23ee9/688d860893a54ab49a212430f8eafd29/FLAG2f6deceee [2019-01-12 23:29:36,334 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6baf23ee9/688d860893a54ab49a212430f8eafd29 [2019-01-12 23:29:36,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 23:29:36,341 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 23:29:36,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 23:29:36,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 23:29:36,348 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 23:29:36,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:29:36" (1/1) ... [2019-01-12 23:29:36,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5329403d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:36, skipping insertion in model container [2019-01-12 23:29:36,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:29:36" (1/1) ... [2019-01-12 23:29:36,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 23:29:36,411 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 23:29:36,859 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 23:29:36,876 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 23:29:37,050 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 23:29:37,147 INFO L195 MainTranslator]: Completed translation [2019-01-12 23:29:37,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:37 WrapperNode [2019-01-12 23:29:37,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 23:29:37,149 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 23:29:37,149 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 23:29:37,149 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 23:29:37,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:37" (1/1) ... [2019-01-12 23:29:37,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:37" (1/1) ... [2019-01-12 23:29:37,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 23:29:37,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 23:29:37,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 23:29:37,217 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 23:29:37,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:37" (1/1) ... [2019-01-12 23:29:37,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:37" (1/1) ... [2019-01-12 23:29:37,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:37" (1/1) ... [2019-01-12 23:29:37,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:37" (1/1) ... [2019-01-12 23:29:37,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:37" (1/1) ... [2019-01-12 23:29:37,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:37" (1/1) ... [2019-01-12 23:29:37,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:37" (1/1) ... [2019-01-12 23:29:37,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 23:29:37,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 23:29:37,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 23:29:37,261 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 23:29:37,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 23:29:37,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 23:29:37,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-12 23:29:37,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 23:29:37,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 23:29:37,332 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-12 23:29:37,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-12 23:29:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-12 23:29:37,333 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-12 23:29:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-12 23:29:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 23:29:37,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 23:29:37,336 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-12 23:29:38,410 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 23:29:38,410 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-12 23:29:38,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:29:38 BoogieIcfgContainer [2019-01-12 23:29:38,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 23:29:38,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 23:29:38,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 23:29:38,420 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 23:29:38,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:29:36" (1/3) ... [2019-01-12 23:29:38,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569bde0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:29:38, skipping insertion in model container [2019-01-12 23:29:38,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:29:37" (2/3) ... [2019-01-12 23:29:38,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569bde0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:29:38, skipping insertion in model container [2019-01-12 23:29:38,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:29:38" (3/3) ... [2019-01-12 23:29:38,425 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_power.opt_false-unreach-call.i [2019-01-12 23:29:38,473 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,473 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,473 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,474 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,474 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,474 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,475 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,476 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,477 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,477 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,478 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,478 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,478 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,479 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,479 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,479 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,479 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,480 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,480 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,480 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,480 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,481 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,481 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,481 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,481 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,482 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,482 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,482 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,482 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,483 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,483 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,483 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,483 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,484 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,484 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,484 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,484 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,484 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,485 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,492 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,492 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,492 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,493 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,494 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,495 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,495 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,495 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,495 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,496 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,499 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,499 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,499 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,499 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,499 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,502 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,502 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,502 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,502 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,503 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,503 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,503 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,503 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,503 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,509 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,510 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,510 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,510 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,510 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,511 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,511 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,511 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,511 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,511 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,512 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,517 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,517 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,517 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,518 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,518 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,518 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,518 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,518 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,519 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,519 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,519 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,519 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,519 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,520 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,520 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,520 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,520 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,521 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,521 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,522 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,522 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,522 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,522 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,522 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,523 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,523 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,523 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,523 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,523 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,524 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,524 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,524 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,524 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,524 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,525 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,525 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,525 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,525 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,525 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,526 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,527 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,527 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,527 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,528 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,528 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,528 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,528 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,528 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,529 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,529 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,529 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,529 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:29:38,557 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-12 23:29:38,557 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 23:29:38,566 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 23:29:38,579 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 23:29:38,603 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 23:29:38,604 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 23:29:38,604 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 23:29:38,604 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 23:29:38,604 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 23:29:38,604 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 23:29:38,604 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 23:29:38,605 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 23:29:38,605 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 23:29:38,620 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2019-01-12 23:29:41,137 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2019-01-12 23:29:41,140 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2019-01-12 23:29:41,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 23:29:41,147 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:29:41,148 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] [2019-01-12 23:29:41,151 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:29:41,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:29:41,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1782476305, now seen corresponding path program 1 times [2019-01-12 23:29:41,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:29:41,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:29:41,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:29:41,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:29:41,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:29:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:29:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:29:41,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:29:41,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:29:41,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:29:41,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:29:41,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:29:41,605 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2019-01-12 23:29:43,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:29:43,238 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2019-01-12 23:29:43,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:29:43,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-01-12 23:29:43,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:29:43,603 INFO L225 Difference]: With dead ends: 60791 [2019-01-12 23:29:43,604 INFO L226 Difference]: Without dead ends: 44271 [2019-01-12 23:29:43,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:29:43,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2019-01-12 23:29:45,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2019-01-12 23:29:45,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2019-01-12 23:29:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2019-01-12 23:29:45,439 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2019-01-12 23:29:45,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:29:45,442 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2019-01-12 23:29:45,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:29:45,442 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2019-01-12 23:29:45,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-12 23:29:45,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:29:45,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:29:45,461 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:29:45,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:29:45,463 INFO L82 PathProgramCache]: Analyzing trace with hash -983112731, now seen corresponding path program 1 times [2019-01-12 23:29:45,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:29:45,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:29:45,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:29:45,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:29:45,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:29:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:29:45,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:29:45,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:29:45,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:29:45,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:29:45,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:29:45,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:29:45,599 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 5 states. [2019-01-12 23:29:48,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:29:48,019 INFO L93 Difference]: Finished difference Result 64005 states and 235335 transitions. [2019-01-12 23:29:48,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:29:48,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-01-12 23:29:48,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:29:48,868 INFO L225 Difference]: With dead ends: 64005 [2019-01-12 23:29:48,869 INFO L226 Difference]: Without dead ends: 63453 [2019-01-12 23:29:48,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:29:49,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2019-01-12 23:29:50,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2019-01-12 23:29:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2019-01-12 23:29:50,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152330 transitions. [2019-01-12 23:29:50,302 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152330 transitions. Word has length 46 [2019-01-12 23:29:50,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:29:50,304 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152330 transitions. [2019-01-12 23:29:50,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:29:50,305 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152330 transitions. [2019-01-12 23:29:50,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-12 23:29:50,312 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:29:50,313 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:29:50,313 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:29:50,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:29:50,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1484418599, now seen corresponding path program 1 times [2019-01-12 23:29:50,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:29:50,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:29:50,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:29:50,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:29:50,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:29:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:29:50,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:29:50,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:29:50,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:29:50,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:29:50,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:29:50,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:29:50,481 INFO L87 Difference]: Start difference. First operand 41421 states and 152330 transitions. Second operand 5 states. [2019-01-12 23:29:52,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:29:52,009 INFO L93 Difference]: Finished difference Result 81367 states and 298048 transitions. [2019-01-12 23:29:52,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:29:52,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-01-12 23:29:52,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:29:52,293 INFO L225 Difference]: With dead ends: 81367 [2019-01-12 23:29:52,293 INFO L226 Difference]: Without dead ends: 80855 [2019-01-12 23:29:52,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:29:52,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2019-01-12 23:29:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2019-01-12 23:29:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2019-01-12 23:29:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 166018 transitions. [2019-01-12 23:29:54,421 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 166018 transitions. Word has length 47 [2019-01-12 23:29:54,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:29:54,422 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 166018 transitions. [2019-01-12 23:29:54,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:29:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 166018 transitions. [2019-01-12 23:29:54,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 23:29:54,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:29:54,432 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-12 23:29:54,432 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:29:54,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:29:54,433 INFO L82 PathProgramCache]: Analyzing trace with hash 375052511, now seen corresponding path program 1 times [2019-01-12 23:29:54,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:29:54,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:29:54,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:29:54,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:29:54,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:29:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:29:54,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:29:54,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:29:54,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:29:54,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:29:54,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:29:54,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:29:54,563 INFO L87 Difference]: Start difference. First operand 45375 states and 166018 transitions. Second operand 3 states. [2019-01-12 23:29:54,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:29:54,873 INFO L93 Difference]: Finished difference Result 65251 states and 235814 transitions. [2019-01-12 23:29:54,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:29:54,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-01-12 23:29:54,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:29:55,083 INFO L225 Difference]: With dead ends: 65251 [2019-01-12 23:29:55,083 INFO L226 Difference]: Without dead ends: 65251 [2019-01-12 23:29:55,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:29:55,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2019-01-12 23:29:56,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2019-01-12 23:29:56,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2019-01-12 23:29:57,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 184325 transitions. [2019-01-12 23:29:57,355 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 184325 transitions. Word has length 49 [2019-01-12 23:29:57,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:29:57,356 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 184325 transitions. [2019-01-12 23:29:57,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:29:57,356 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 184325 transitions. [2019-01-12 23:29:57,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 23:29:57,373 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:29:57,373 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] [2019-01-12 23:29:57,373 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:29:57,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:29:57,374 INFO L82 PathProgramCache]: Analyzing trace with hash -559765890, now seen corresponding path program 1 times [2019-01-12 23:29:57,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:29:57,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:29:57,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:29:57,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:29:57,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:29:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:29:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:29:57,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:29:57,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:29:57,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:29:57,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:29:57,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:29:57,758 INFO L87 Difference]: Start difference. First operand 50945 states and 184325 transitions. Second operand 6 states. [2019-01-12 23:29:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:29:59,086 INFO L93 Difference]: Finished difference Result 67511 states and 242185 transitions. [2019-01-12 23:29:59,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:29:59,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-01-12 23:29:59,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:29:59,244 INFO L225 Difference]: With dead ends: 67511 [2019-01-12 23:29:59,244 INFO L226 Difference]: Without dead ends: 67511 [2019-01-12 23:29:59,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:29:59,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2019-01-12 23:30:00,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2019-01-12 23:30:00,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2019-01-12 23:30:00,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227584 transitions. [2019-01-12 23:30:00,490 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227584 transitions. Word has length 53 [2019-01-12 23:30:00,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:00,491 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227584 transitions. [2019-01-12 23:30:00,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:30:00,491 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227584 transitions. [2019-01-12 23:30:00,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 23:30:00,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:00,508 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] [2019-01-12 23:30:00,508 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:00,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:00,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1938250047, now seen corresponding path program 1 times [2019-01-12 23:30:00,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:00,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:00,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:00,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:00,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:00,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:00,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:30:00,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:30:00,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:30:00,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:00,668 INFO L87 Difference]: Start difference. First operand 63436 states and 227584 transitions. Second operand 7 states. [2019-01-12 23:30:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:02,966 INFO L93 Difference]: Finished difference Result 88528 states and 306201 transitions. [2019-01-12 23:30:02,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 23:30:02,966 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-01-12 23:30:02,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:03,160 INFO L225 Difference]: With dead ends: 88528 [2019-01-12 23:30:03,161 INFO L226 Difference]: Without dead ends: 88528 [2019-01-12 23:30:03,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-12 23:30:03,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2019-01-12 23:30:04,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2019-01-12 23:30:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2019-01-12 23:30:04,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262987 transitions. [2019-01-12 23:30:04,707 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262987 transitions. Word has length 53 [2019-01-12 23:30:04,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:04,707 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262987 transitions. [2019-01-12 23:30:04,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:30:04,708 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262987 transitions. [2019-01-12 23:30:04,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 23:30:04,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:04,723 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] [2019-01-12 23:30:04,725 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:04,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:04,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1469213568, now seen corresponding path program 1 times [2019-01-12 23:30:04,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:04,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:04,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:04,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:04,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:04,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:04,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:04,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:30:04,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:30:04,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:30:04,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:30:04,857 INFO L87 Difference]: Start difference. First operand 74881 states and 262987 transitions. Second operand 3 states. [2019-01-12 23:30:05,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:05,146 INFO L93 Difference]: Finished difference Result 57182 states and 199435 transitions. [2019-01-12 23:30:05,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:30:05,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-01-12 23:30:05,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:05,273 INFO L225 Difference]: With dead ends: 57182 [2019-01-12 23:30:05,273 INFO L226 Difference]: Without dead ends: 57182 [2019-01-12 23:30:05,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:30:05,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57182 states. [2019-01-12 23:30:09,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57182 to 56447. [2019-01-12 23:30:09,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56447 states. [2019-01-12 23:30:09,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56447 states to 56447 states and 197181 transitions. [2019-01-12 23:30:09,718 INFO L78 Accepts]: Start accepts. Automaton has 56447 states and 197181 transitions. Word has length 53 [2019-01-12 23:30:09,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:09,718 INFO L480 AbstractCegarLoop]: Abstraction has 56447 states and 197181 transitions. [2019-01-12 23:30:09,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:30:09,718 INFO L276 IsEmpty]: Start isEmpty. Operand 56447 states and 197181 transitions. [2019-01-12 23:30:09,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 23:30:09,728 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:09,728 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] [2019-01-12 23:30:09,729 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:09,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:09,729 INFO L82 PathProgramCache]: Analyzing trace with hash -211879190, now seen corresponding path program 1 times [2019-01-12 23:30:09,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:09,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:09,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:09,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:09,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:09,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:09,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:09,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:30:09,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:30:09,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:30:09,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:09,966 INFO L87 Difference]: Start difference. First operand 56447 states and 197181 transitions. Second operand 6 states. [2019-01-12 23:30:11,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:11,100 INFO L93 Difference]: Finished difference Result 97908 states and 340995 transitions. [2019-01-12 23:30:11,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 23:30:11,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-01-12 23:30:11,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:11,323 INFO L225 Difference]: With dead ends: 97908 [2019-01-12 23:30:11,323 INFO L226 Difference]: Without dead ends: 97332 [2019-01-12 23:30:11,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-01-12 23:30:11,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97332 states. [2019-01-12 23:30:12,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97332 to 56676. [2019-01-12 23:30:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56676 states. [2019-01-12 23:30:12,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56676 states to 56676 states and 198353 transitions. [2019-01-12 23:30:12,679 INFO L78 Accepts]: Start accepts. Automaton has 56676 states and 198353 transitions. Word has length 53 [2019-01-12 23:30:12,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:12,680 INFO L480 AbstractCegarLoop]: Abstraction has 56676 states and 198353 transitions. [2019-01-12 23:30:12,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:30:12,680 INFO L276 IsEmpty]: Start isEmpty. Operand 56676 states and 198353 transitions. [2019-01-12 23:30:12,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-12 23:30:12,691 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:12,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:12,692 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:12,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:12,692 INFO L82 PathProgramCache]: Analyzing trace with hash 2074481868, now seen corresponding path program 1 times [2019-01-12 23:30:12,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:12,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:12,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:12,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:12,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:12,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:12,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:30:12,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:30:12,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:30:12,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:12,849 INFO L87 Difference]: Start difference. First operand 56676 states and 198353 transitions. Second operand 4 states. [2019-01-12 23:30:13,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:13,086 INFO L93 Difference]: Finished difference Result 12705 states and 39586 transitions. [2019-01-12 23:30:13,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 23:30:13,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-01-12 23:30:13,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:13,829 INFO L225 Difference]: With dead ends: 12705 [2019-01-12 23:30:13,830 INFO L226 Difference]: Without dead ends: 10887 [2019-01-12 23:30:13,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:13,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2019-01-12 23:30:13,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 10839. [2019-01-12 23:30:13,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10839 states. [2019-01-12 23:30:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10839 states to 10839 states and 33402 transitions. [2019-01-12 23:30:13,966 INFO L78 Accepts]: Start accepts. Automaton has 10839 states and 33402 transitions. Word has length 54 [2019-01-12 23:30:13,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:13,966 INFO L480 AbstractCegarLoop]: Abstraction has 10839 states and 33402 transitions. [2019-01-12 23:30:13,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:30:13,967 INFO L276 IsEmpty]: Start isEmpty. Operand 10839 states and 33402 transitions. [2019-01-12 23:30:13,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 23:30:13,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:13,971 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] [2019-01-12 23:30:13,972 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:13,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:13,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1760614074, now seen corresponding path program 1 times [2019-01-12 23:30:13,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:13,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:13,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:13,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:13,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:14,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:14,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:14,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:30:14,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:30:14,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:30:14,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:14,185 INFO L87 Difference]: Start difference. First operand 10839 states and 33402 transitions. Second operand 4 states. [2019-01-12 23:30:14,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:14,336 INFO L93 Difference]: Finished difference Result 12386 states and 38231 transitions. [2019-01-12 23:30:14,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 23:30:14,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-01-12 23:30:14,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:14,357 INFO L225 Difference]: With dead ends: 12386 [2019-01-12 23:30:14,357 INFO L226 Difference]: Without dead ends: 12386 [2019-01-12 23:30:14,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:14,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2019-01-12 23:30:14,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 11359. [2019-01-12 23:30:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11359 states. [2019-01-12 23:30:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11359 states to 11359 states and 35015 transitions. [2019-01-12 23:30:14,517 INFO L78 Accepts]: Start accepts. Automaton has 11359 states and 35015 transitions. Word has length 61 [2019-01-12 23:30:14,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:14,517 INFO L480 AbstractCegarLoop]: Abstraction has 11359 states and 35015 transitions. [2019-01-12 23:30:14,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:30:14,517 INFO L276 IsEmpty]: Start isEmpty. Operand 11359 states and 35015 transitions. [2019-01-12 23:30:14,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 23:30:14,521 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:14,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] [2019-01-12 23:30:14,522 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:14,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:14,522 INFO L82 PathProgramCache]: Analyzing trace with hash -17803739, now seen corresponding path program 1 times [2019-01-12 23:30:14,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:14,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:14,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:14,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:14,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:14,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:14,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:14,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:30:14,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:30:14,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:30:14,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:14,864 INFO L87 Difference]: Start difference. First operand 11359 states and 35015 transitions. Second operand 6 states. [2019-01-12 23:30:15,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:15,489 INFO L93 Difference]: Finished difference Result 20935 states and 64448 transitions. [2019-01-12 23:30:15,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 23:30:15,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-01-12 23:30:15,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:15,522 INFO L225 Difference]: With dead ends: 20935 [2019-01-12 23:30:15,523 INFO L226 Difference]: Without dead ends: 20864 [2019-01-12 23:30:15,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-12 23:30:15,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20864 states. [2019-01-12 23:30:15,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20864 to 13298. [2019-01-12 23:30:15,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13298 states. [2019-01-12 23:30:15,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13298 states to 13298 states and 40712 transitions. [2019-01-12 23:30:15,746 INFO L78 Accepts]: Start accepts. Automaton has 13298 states and 40712 transitions. Word has length 61 [2019-01-12 23:30:15,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:15,747 INFO L480 AbstractCegarLoop]: Abstraction has 13298 states and 40712 transitions. [2019-01-12 23:30:15,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:30:15,747 INFO L276 IsEmpty]: Start isEmpty. Operand 13298 states and 40712 transitions. [2019-01-12 23:30:15,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:30:15,753 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:15,754 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] [2019-01-12 23:30:15,754 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:15,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:15,754 INFO L82 PathProgramCache]: Analyzing trace with hash 859851853, now seen corresponding path program 1 times [2019-01-12 23:30:15,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:15,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:15,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:15,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:15,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:15,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:15,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:30:15,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:30:15,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:30:15,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:30:15,886 INFO L87 Difference]: Start difference. First operand 13298 states and 40712 transitions. Second operand 3 states. [2019-01-12 23:30:16,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:16,654 INFO L93 Difference]: Finished difference Result 13930 states and 42364 transitions. [2019-01-12 23:30:16,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:30:16,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-12 23:30:16,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:16,676 INFO L225 Difference]: With dead ends: 13930 [2019-01-12 23:30:16,676 INFO L226 Difference]: Without dead ends: 13930 [2019-01-12 23:30:16,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:30:16,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2019-01-12 23:30:16,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 13614. [2019-01-12 23:30:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13614 states. [2019-01-12 23:30:16,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13614 states to 13614 states and 41538 transitions. [2019-01-12 23:30:16,851 INFO L78 Accepts]: Start accepts. Automaton has 13614 states and 41538 transitions. Word has length 67 [2019-01-12 23:30:16,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:16,851 INFO L480 AbstractCegarLoop]: Abstraction has 13614 states and 41538 transitions. [2019-01-12 23:30:16,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:30:16,852 INFO L276 IsEmpty]: Start isEmpty. Operand 13614 states and 41538 transitions. [2019-01-12 23:30:16,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:30:16,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:16,860 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] [2019-01-12 23:30:16,860 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:16,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:16,860 INFO L82 PathProgramCache]: Analyzing trace with hash -101762164, now seen corresponding path program 1 times [2019-01-12 23:30:16,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:16,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:16,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:16,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:16,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:17,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:17,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:17,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:30:17,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:30:17,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:30:17,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:17,068 INFO L87 Difference]: Start difference. First operand 13614 states and 41538 transitions. Second operand 4 states. [2019-01-12 23:30:17,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:17,370 INFO L93 Difference]: Finished difference Result 17463 states and 52743 transitions. [2019-01-12 23:30:17,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:30:17,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-01-12 23:30:17,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:17,397 INFO L225 Difference]: With dead ends: 17463 [2019-01-12 23:30:17,398 INFO L226 Difference]: Without dead ends: 17463 [2019-01-12 23:30:17,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:17,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17463 states. [2019-01-12 23:30:17,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17463 to 15244. [2019-01-12 23:30:17,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15244 states. [2019-01-12 23:30:17,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15244 states to 15244 states and 46198 transitions. [2019-01-12 23:30:17,604 INFO L78 Accepts]: Start accepts. Automaton has 15244 states and 46198 transitions. Word has length 67 [2019-01-12 23:30:17,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:17,605 INFO L480 AbstractCegarLoop]: Abstraction has 15244 states and 46198 transitions. [2019-01-12 23:30:17,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:30:17,605 INFO L276 IsEmpty]: Start isEmpty. Operand 15244 states and 46198 transitions. [2019-01-12 23:30:17,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:30:17,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:17,613 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] [2019-01-12 23:30:17,614 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:17,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:17,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1143002317, now seen corresponding path program 1 times [2019-01-12 23:30:17,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:17,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:17,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:17,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:17,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:17,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:17,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:17,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:30:17,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:30:17,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:30:17,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:17,783 INFO L87 Difference]: Start difference. First operand 15244 states and 46198 transitions. Second operand 6 states. [2019-01-12 23:30:18,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:18,803 INFO L93 Difference]: Finished difference Result 18862 states and 56126 transitions. [2019-01-12 23:30:18,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:30:18,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-01-12 23:30:18,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:18,846 INFO L225 Difference]: With dead ends: 18862 [2019-01-12 23:30:18,847 INFO L226 Difference]: Without dead ends: 18862 [2019-01-12 23:30:18,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:18,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18862 states. [2019-01-12 23:30:19,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18862 to 17720. [2019-01-12 23:30:19,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17720 states. [2019-01-12 23:30:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17720 states to 17720 states and 53178 transitions. [2019-01-12 23:30:19,078 INFO L78 Accepts]: Start accepts. Automaton has 17720 states and 53178 transitions. Word has length 67 [2019-01-12 23:30:19,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:19,078 INFO L480 AbstractCegarLoop]: Abstraction has 17720 states and 53178 transitions. [2019-01-12 23:30:19,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:30:19,078 INFO L276 IsEmpty]: Start isEmpty. Operand 17720 states and 53178 transitions. [2019-01-12 23:30:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:30:19,088 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:19,088 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] [2019-01-12 23:30:19,088 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:19,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:19,089 INFO L82 PathProgramCache]: Analyzing trace with hash -934207026, now seen corresponding path program 1 times [2019-01-12 23:30:19,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:19,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:19,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:19,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:19,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:19,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:19,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:30:19,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:30:19,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:30:19,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:19,288 INFO L87 Difference]: Start difference. First operand 17720 states and 53178 transitions. Second operand 6 states. [2019-01-12 23:30:19,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:19,807 INFO L93 Difference]: Finished difference Result 20389 states and 59240 transitions. [2019-01-12 23:30:19,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:30:19,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-01-12 23:30:19,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:19,838 INFO L225 Difference]: With dead ends: 20389 [2019-01-12 23:30:19,838 INFO L226 Difference]: Without dead ends: 20389 [2019-01-12 23:30:19,839 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-12 23:30:19,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20389 states. [2019-01-12 23:30:20,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20389 to 18002. [2019-01-12 23:30:20,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18002 states. [2019-01-12 23:30:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18002 states to 18002 states and 53189 transitions. [2019-01-12 23:30:20,093 INFO L78 Accepts]: Start accepts. Automaton has 18002 states and 53189 transitions. Word has length 67 [2019-01-12 23:30:20,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:20,094 INFO L480 AbstractCegarLoop]: Abstraction has 18002 states and 53189 transitions. [2019-01-12 23:30:20,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:30:20,094 INFO L276 IsEmpty]: Start isEmpty. Operand 18002 states and 53189 transitions. [2019-01-12 23:30:20,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:30:20,106 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:20,106 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] [2019-01-12 23:30:20,106 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:20,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:20,107 INFO L82 PathProgramCache]: Analyzing trace with hash -722856113, now seen corresponding path program 1 times [2019-01-12 23:30:20,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:20,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:20,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:20,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:20,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:20,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:20,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:20,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:20,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:20,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:20,247 INFO L87 Difference]: Start difference. First operand 18002 states and 53189 transitions. Second operand 5 states. [2019-01-12 23:30:20,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:20,665 INFO L93 Difference]: Finished difference Result 23413 states and 68682 transitions. [2019-01-12 23:30:20,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:30:20,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-01-12 23:30:20,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:20,703 INFO L225 Difference]: With dead ends: 23413 [2019-01-12 23:30:20,703 INFO L226 Difference]: Without dead ends: 23413 [2019-01-12 23:30:20,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:20,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23413 states. [2019-01-12 23:30:20,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23413 to 21350. [2019-01-12 23:30:20,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21350 states. [2019-01-12 23:30:20,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21350 states to 21350 states and 62593 transitions. [2019-01-12 23:30:20,995 INFO L78 Accepts]: Start accepts. Automaton has 21350 states and 62593 transitions. Word has length 67 [2019-01-12 23:30:20,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:20,995 INFO L480 AbstractCegarLoop]: Abstraction has 21350 states and 62593 transitions. [2019-01-12 23:30:20,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:20,996 INFO L276 IsEmpty]: Start isEmpty. Operand 21350 states and 62593 transitions. [2019-01-12 23:30:21,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:30:21,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:21,006 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] [2019-01-12 23:30:21,007 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:21,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:21,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1233390290, now seen corresponding path program 1 times [2019-01-12 23:30:21,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:21,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:21,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:21,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:21,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:21,345 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-01-12 23:30:21,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:21,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:21,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:30:21,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:30:21,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:30:21,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:21,360 INFO L87 Difference]: Start difference. First operand 21350 states and 62593 transitions. Second operand 4 states. [2019-01-12 23:30:22,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:22,140 INFO L93 Difference]: Finished difference Result 26758 states and 78553 transitions. [2019-01-12 23:30:22,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 23:30:22,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-01-12 23:30:22,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:22,185 INFO L225 Difference]: With dead ends: 26758 [2019-01-12 23:30:22,186 INFO L226 Difference]: Without dead ends: 26462 [2019-01-12 23:30:22,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:22,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26462 states. [2019-01-12 23:30:22,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26462 to 25142. [2019-01-12 23:30:22,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25142 states. [2019-01-12 23:30:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25142 states to 25142 states and 73709 transitions. [2019-01-12 23:30:22,607 INFO L78 Accepts]: Start accepts. Automaton has 25142 states and 73709 transitions. Word has length 67 [2019-01-12 23:30:22,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:22,608 INFO L480 AbstractCegarLoop]: Abstraction has 25142 states and 73709 transitions. [2019-01-12 23:30:22,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:30:22,608 INFO L276 IsEmpty]: Start isEmpty. Operand 25142 states and 73709 transitions. [2019-01-12 23:30:22,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:30:22,619 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:22,619 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] [2019-01-12 23:30:22,619 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:22,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:22,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1264625647, now seen corresponding path program 1 times [2019-01-12 23:30:22,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:22,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:22,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:22,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:22,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:22,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:22,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:22,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:22,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:22,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:22,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:22,870 INFO L87 Difference]: Start difference. First operand 25142 states and 73709 transitions. Second operand 5 states. [2019-01-12 23:30:22,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:22,959 INFO L93 Difference]: Finished difference Result 7314 states and 17674 transitions. [2019-01-12 23:30:22,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 23:30:22,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-01-12 23:30:22,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:22,968 INFO L225 Difference]: With dead ends: 7314 [2019-01-12 23:30:22,968 INFO L226 Difference]: Without dead ends: 6004 [2019-01-12 23:30:22,968 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-12 23:30:22,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2019-01-12 23:30:23,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 5514. [2019-01-12 23:30:23,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5514 states. [2019-01-12 23:30:23,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5514 states to 5514 states and 12848 transitions. [2019-01-12 23:30:23,023 INFO L78 Accepts]: Start accepts. Automaton has 5514 states and 12848 transitions. Word has length 67 [2019-01-12 23:30:23,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:23,024 INFO L480 AbstractCegarLoop]: Abstraction has 5514 states and 12848 transitions. [2019-01-12 23:30:23,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:23,024 INFO L276 IsEmpty]: Start isEmpty. Operand 5514 states and 12848 transitions. [2019-01-12 23:30:23,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:30:23,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:23,029 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] [2019-01-12 23:30:23,030 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:23,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:23,030 INFO L82 PathProgramCache]: Analyzing trace with hash 288361846, now seen corresponding path program 1 times [2019-01-12 23:30:23,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:23,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:23,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:23,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:23,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:23,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:23,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:30:23,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:30:23,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:30:23,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:30:23,107 INFO L87 Difference]: Start difference. First operand 5514 states and 12848 transitions. Second operand 3 states. [2019-01-12 23:30:23,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:23,199 INFO L93 Difference]: Finished difference Result 7126 states and 16417 transitions. [2019-01-12 23:30:23,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:30:23,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-12 23:30:23,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:23,208 INFO L225 Difference]: With dead ends: 7126 [2019-01-12 23:30:23,208 INFO L226 Difference]: Without dead ends: 7126 [2019-01-12 23:30:23,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:30:23,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7126 states. [2019-01-12 23:30:23,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7126 to 5453. [2019-01-12 23:30:23,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2019-01-12 23:30:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 12388 transitions. [2019-01-12 23:30:23,567 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 12388 transitions. Word has length 67 [2019-01-12 23:30:23,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:23,567 INFO L480 AbstractCegarLoop]: Abstraction has 5453 states and 12388 transitions. [2019-01-12 23:30:23,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:30:23,567 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 12388 transitions. [2019-01-12 23:30:23,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-12 23:30:23,573 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:23,573 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] [2019-01-12 23:30:23,573 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:23,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:23,574 INFO L82 PathProgramCache]: Analyzing trace with hash -211461463, now seen corresponding path program 1 times [2019-01-12 23:30:23,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:23,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:23,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:23,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:23,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:23,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:23,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:23,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:23,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:23,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:23,960 INFO L87 Difference]: Start difference. First operand 5453 states and 12388 transitions. Second operand 5 states. [2019-01-12 23:30:24,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:24,941 INFO L93 Difference]: Finished difference Result 6617 states and 15012 transitions. [2019-01-12 23:30:24,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:30:24,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-01-12 23:30:24,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:24,950 INFO L225 Difference]: With dead ends: 6617 [2019-01-12 23:30:24,950 INFO L226 Difference]: Without dead ends: 6617 [2019-01-12 23:30:24,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:30:24,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2019-01-12 23:30:25,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 5897. [2019-01-12 23:30:25,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5897 states. [2019-01-12 23:30:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5897 states to 5897 states and 13392 transitions. [2019-01-12 23:30:25,009 INFO L78 Accepts]: Start accepts. Automaton has 5897 states and 13392 transitions. Word has length 73 [2019-01-12 23:30:25,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:25,009 INFO L480 AbstractCegarLoop]: Abstraction has 5897 states and 13392 transitions. [2019-01-12 23:30:25,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:25,010 INFO L276 IsEmpty]: Start isEmpty. Operand 5897 states and 13392 transitions. [2019-01-12 23:30:25,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-12 23:30:25,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:25,016 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] [2019-01-12 23:30:25,016 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:25,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:25,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1531348872, now seen corresponding path program 1 times [2019-01-12 23:30:25,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:25,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:25,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:25,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:25,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:25,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:25,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:25,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:30:25,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:30:25,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:30:25,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:25,280 INFO L87 Difference]: Start difference. First operand 5897 states and 13392 transitions. Second operand 7 states. [2019-01-12 23:30:25,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:25,750 INFO L93 Difference]: Finished difference Result 7099 states and 15961 transitions. [2019-01-12 23:30:25,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 23:30:25,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-01-12 23:30:25,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:25,760 INFO L225 Difference]: With dead ends: 7099 [2019-01-12 23:30:25,760 INFO L226 Difference]: Without dead ends: 6980 [2019-01-12 23:30:25,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-01-12 23:30:25,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6980 states. [2019-01-12 23:30:25,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6980 to 5994. [2019-01-12 23:30:25,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5994 states. [2019-01-12 23:30:25,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5994 states to 5994 states and 13485 transitions. [2019-01-12 23:30:25,822 INFO L78 Accepts]: Start accepts. Automaton has 5994 states and 13485 transitions. Word has length 73 [2019-01-12 23:30:25,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:25,822 INFO L480 AbstractCegarLoop]: Abstraction has 5994 states and 13485 transitions. [2019-01-12 23:30:25,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:30:25,822 INFO L276 IsEmpty]: Start isEmpty. Operand 5994 states and 13485 transitions. [2019-01-12 23:30:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:25,829 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:25,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:25,830 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:25,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:25,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1678014975, now seen corresponding path program 1 times [2019-01-12 23:30:25,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:25,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:25,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:25,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:25,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:25,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:25,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:25,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:25,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:25,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:25,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:25,982 INFO L87 Difference]: Start difference. First operand 5994 states and 13485 transitions. Second operand 5 states. [2019-01-12 23:30:27,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:27,303 INFO L93 Difference]: Finished difference Result 5550 states and 12354 transitions. [2019-01-12 23:30:27,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 23:30:27,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-12 23:30:27,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:27,311 INFO L225 Difference]: With dead ends: 5550 [2019-01-12 23:30:27,311 INFO L226 Difference]: Without dead ends: 5550 [2019-01-12 23:30:27,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:27,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5550 states. [2019-01-12 23:30:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5550 to 5153. [2019-01-12 23:30:27,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5153 states. [2019-01-12 23:30:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 11452 transitions. [2019-01-12 23:30:27,360 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 11452 transitions. Word has length 94 [2019-01-12 23:30:27,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:27,360 INFO L480 AbstractCegarLoop]: Abstraction has 5153 states and 11452 transitions. [2019-01-12 23:30:27,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:27,360 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 11452 transitions. [2019-01-12 23:30:27,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:27,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:27,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:27,366 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:27,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:27,367 INFO L82 PathProgramCache]: Analyzing trace with hash -451364121, now seen corresponding path program 1 times [2019-01-12 23:30:27,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:27,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:27,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:27,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:27,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:27,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:27,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:27,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:30:27,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:30:27,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:30:27,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:27,499 INFO L87 Difference]: Start difference. First operand 5153 states and 11452 transitions. Second operand 4 states. [2019-01-12 23:30:27,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:27,611 INFO L93 Difference]: Finished difference Result 6337 states and 14007 transitions. [2019-01-12 23:30:27,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:30:27,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-01-12 23:30:27,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:27,620 INFO L225 Difference]: With dead ends: 6337 [2019-01-12 23:30:27,620 INFO L226 Difference]: Without dead ends: 6337 [2019-01-12 23:30:27,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6337 states. [2019-01-12 23:30:27,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6337 to 5568. [2019-01-12 23:30:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5568 states. [2019-01-12 23:30:27,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5568 states to 5568 states and 12373 transitions. [2019-01-12 23:30:27,682 INFO L78 Accepts]: Start accepts. Automaton has 5568 states and 12373 transitions. Word has length 94 [2019-01-12 23:30:27,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:27,683 INFO L480 AbstractCegarLoop]: Abstraction has 5568 states and 12373 transitions. [2019-01-12 23:30:27,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:30:27,683 INFO L276 IsEmpty]: Start isEmpty. Operand 5568 states and 12373 transitions. [2019-01-12 23:30:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:30:27,691 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:27,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:27,692 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:27,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:27,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1661573399, now seen corresponding path program 1 times [2019-01-12 23:30:27,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:27,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:27,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:27,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:27,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:27,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:27,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:27,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:27,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:27,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:27,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:27,850 INFO L87 Difference]: Start difference. First operand 5568 states and 12373 transitions. Second operand 5 states. [2019-01-12 23:30:28,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:28,090 INFO L93 Difference]: Finished difference Result 6441 states and 14301 transitions. [2019-01-12 23:30:28,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:30:28,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-01-12 23:30:28,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:28,098 INFO L225 Difference]: With dead ends: 6441 [2019-01-12 23:30:28,099 INFO L226 Difference]: Without dead ends: 6441 [2019-01-12 23:30:28,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:28,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6441 states. [2019-01-12 23:30:28,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6441 to 5079. [2019-01-12 23:30:28,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5079 states. [2019-01-12 23:30:28,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5079 states to 5079 states and 11282 transitions. [2019-01-12 23:30:28,150 INFO L78 Accepts]: Start accepts. Automaton has 5079 states and 11282 transitions. Word has length 96 [2019-01-12 23:30:28,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:28,151 INFO L480 AbstractCegarLoop]: Abstraction has 5079 states and 11282 transitions. [2019-01-12 23:30:28,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:28,151 INFO L276 IsEmpty]: Start isEmpty. Operand 5079 states and 11282 transitions. [2019-01-12 23:30:28,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:30:28,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:28,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:28,158 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:28,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:28,158 INFO L82 PathProgramCache]: Analyzing trace with hash -28769400, now seen corresponding path program 1 times [2019-01-12 23:30:28,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:28,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:28,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:28,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:28,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:28,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:28,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:28,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:30:28,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:30:28,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:30:28,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:28,402 INFO L87 Difference]: Start difference. First operand 5079 states and 11282 transitions. Second operand 7 states. [2019-01-12 23:30:28,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:28,822 INFO L93 Difference]: Finished difference Result 6777 states and 14905 transitions. [2019-01-12 23:30:28,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 23:30:28,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-01-12 23:30:28,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:28,831 INFO L225 Difference]: With dead ends: 6777 [2019-01-12 23:30:28,832 INFO L226 Difference]: Without dead ends: 6723 [2019-01-12 23:30:28,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-12 23:30:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6723 states. [2019-01-12 23:30:28,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6723 to 5556. [2019-01-12 23:30:28,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5556 states. [2019-01-12 23:30:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5556 states to 5556 states and 12272 transitions. [2019-01-12 23:30:28,888 INFO L78 Accepts]: Start accepts. Automaton has 5556 states and 12272 transitions. Word has length 96 [2019-01-12 23:30:28,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:28,888 INFO L480 AbstractCegarLoop]: Abstraction has 5556 states and 12272 transitions. [2019-01-12 23:30:28,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:30:28,888 INFO L276 IsEmpty]: Start isEmpty. Operand 5556 states and 12272 transitions. [2019-01-12 23:30:28,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:30:28,894 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:28,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:28,894 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:28,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:28,895 INFO L82 PathProgramCache]: Analyzing trace with hash -543358231, now seen corresponding path program 1 times [2019-01-12 23:30:28,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:28,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:28,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:28,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:28,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:29,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:29,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:30:29,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:30:29,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:30:29,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:29,040 INFO L87 Difference]: Start difference. First operand 5556 states and 12272 transitions. Second operand 6 states. [2019-01-12 23:30:29,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:29,427 INFO L93 Difference]: Finished difference Result 6493 states and 14426 transitions. [2019-01-12 23:30:29,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:30:29,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-01-12 23:30:29,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:29,436 INFO L225 Difference]: With dead ends: 6493 [2019-01-12 23:30:29,436 INFO L226 Difference]: Without dead ends: 6493 [2019-01-12 23:30:29,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:30:29,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6493 states. [2019-01-12 23:30:29,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6493 to 5763. [2019-01-12 23:30:29,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5763 states. [2019-01-12 23:30:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5763 states to 5763 states and 12725 transitions. [2019-01-12 23:30:29,494 INFO L78 Accepts]: Start accepts. Automaton has 5763 states and 12725 transitions. Word has length 96 [2019-01-12 23:30:29,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:29,494 INFO L480 AbstractCegarLoop]: Abstraction has 5763 states and 12725 transitions. [2019-01-12 23:30:29,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:30:29,495 INFO L276 IsEmpty]: Start isEmpty. Operand 5763 states and 12725 transitions. [2019-01-12 23:30:29,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:30:29,503 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:29,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:29,503 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:29,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:29,504 INFO L82 PathProgramCache]: Analyzing trace with hash 400392135, now seen corresponding path program 1 times [2019-01-12 23:30:29,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:29,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:29,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:29,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:29,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:29,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:29,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:29,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:30:29,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:30:29,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:30:29,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:29,702 INFO L87 Difference]: Start difference. First operand 5763 states and 12725 transitions. Second operand 6 states. [2019-01-12 23:30:30,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:30,405 INFO L93 Difference]: Finished difference Result 7787 states and 17066 transitions. [2019-01-12 23:30:30,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:30:30,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-01-12 23:30:30,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:30,416 INFO L225 Difference]: With dead ends: 7787 [2019-01-12 23:30:30,416 INFO L226 Difference]: Without dead ends: 7771 [2019-01-12 23:30:30,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-12 23:30:30,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7771 states. [2019-01-12 23:30:30,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7771 to 6210. [2019-01-12 23:30:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2019-01-12 23:30:30,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 13818 transitions. [2019-01-12 23:30:30,483 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 13818 transitions. Word has length 96 [2019-01-12 23:30:30,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:30,484 INFO L480 AbstractCegarLoop]: Abstraction has 6210 states and 13818 transitions. [2019-01-12 23:30:30,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:30:30,484 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 13818 transitions. [2019-01-12 23:30:30,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:30:30,491 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:30,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:30,491 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:30,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:30,491 INFO L82 PathProgramCache]: Analyzing trace with hash 611743048, now seen corresponding path program 1 times [2019-01-12 23:30:30,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:30,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:30,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:30,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:30,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:30,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:30,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:30,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:30:30,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:30:30,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:30:30,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:30,792 INFO L87 Difference]: Start difference. First operand 6210 states and 13818 transitions. Second operand 6 states. [2019-01-12 23:30:31,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:31,025 INFO L93 Difference]: Finished difference Result 6536 states and 14293 transitions. [2019-01-12 23:30:31,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:30:31,027 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-01-12 23:30:31,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:31,037 INFO L225 Difference]: With dead ends: 6536 [2019-01-12 23:30:31,037 INFO L226 Difference]: Without dead ends: 6514 [2019-01-12 23:30:31,037 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-12 23:30:31,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2019-01-12 23:30:31,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 5548. [2019-01-12 23:30:31,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5548 states. [2019-01-12 23:30:31,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5548 states to 5548 states and 12250 transitions. [2019-01-12 23:30:31,099 INFO L78 Accepts]: Start accepts. Automaton has 5548 states and 12250 transitions. Word has length 96 [2019-01-12 23:30:31,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:31,100 INFO L480 AbstractCegarLoop]: Abstraction has 5548 states and 12250 transitions. [2019-01-12 23:30:31,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:30:31,100 INFO L276 IsEmpty]: Start isEmpty. Operand 5548 states and 12250 transitions. [2019-01-12 23:30:31,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:30:31,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:31,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:31,106 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:31,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:31,106 INFO L82 PathProgramCache]: Analyzing trace with hash -893987928, now seen corresponding path program 1 times [2019-01-12 23:30:31,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:31,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:31,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:31,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:31,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:31,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:31,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:31,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 23:30:31,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 23:30:31,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 23:30:31,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:30:31,509 INFO L87 Difference]: Start difference. First operand 5548 states and 12250 transitions. Second operand 9 states. [2019-01-12 23:30:32,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:32,185 INFO L93 Difference]: Finished difference Result 6597 states and 14375 transitions. [2019-01-12 23:30:32,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 23:30:32,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-01-12 23:30:32,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:32,195 INFO L225 Difference]: With dead ends: 6597 [2019-01-12 23:30:32,195 INFO L226 Difference]: Without dead ends: 6597 [2019-01-12 23:30:32,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-12 23:30:32,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6597 states. [2019-01-12 23:30:32,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6597 to 5852. [2019-01-12 23:30:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5852 states. [2019-01-12 23:30:32,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5852 states to 5852 states and 12874 transitions. [2019-01-12 23:30:32,256 INFO L78 Accepts]: Start accepts. Automaton has 5852 states and 12874 transitions. Word has length 96 [2019-01-12 23:30:32,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:32,256 INFO L480 AbstractCegarLoop]: Abstraction has 5852 states and 12874 transitions. [2019-01-12 23:30:32,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 23:30:32,256 INFO L276 IsEmpty]: Start isEmpty. Operand 5852 states and 12874 transitions. [2019-01-12 23:30:32,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:30:32,263 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:32,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:32,263 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:32,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:32,264 INFO L82 PathProgramCache]: Analyzing trace with hash 273485737, now seen corresponding path program 1 times [2019-01-12 23:30:32,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:32,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:32,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:32,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:32,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:32,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:32,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:32,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:30:32,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:30:32,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:30:32,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:32,446 INFO L87 Difference]: Start difference. First operand 5852 states and 12874 transitions. Second operand 7 states. [2019-01-12 23:30:32,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:32,888 INFO L93 Difference]: Finished difference Result 7331 states and 16051 transitions. [2019-01-12 23:30:32,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 23:30:32,890 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-01-12 23:30:32,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:32,898 INFO L225 Difference]: With dead ends: 7331 [2019-01-12 23:30:32,898 INFO L226 Difference]: Without dead ends: 7331 [2019-01-12 23:30:32,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-01-12 23:30:32,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7331 states. [2019-01-12 23:30:32,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7331 to 6796. [2019-01-12 23:30:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6796 states. [2019-01-12 23:30:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6796 states to 6796 states and 14856 transitions. [2019-01-12 23:30:32,963 INFO L78 Accepts]: Start accepts. Automaton has 6796 states and 14856 transitions. Word has length 96 [2019-01-12 23:30:32,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:32,963 INFO L480 AbstractCegarLoop]: Abstraction has 6796 states and 14856 transitions. [2019-01-12 23:30:32,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:30:32,963 INFO L276 IsEmpty]: Start isEmpty. Operand 6796 states and 14856 transitions. [2019-01-12 23:30:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:30:32,970 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:32,970 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:32,971 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:32,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:32,971 INFO L82 PathProgramCache]: Analyzing trace with hash -2033999799, now seen corresponding path program 1 times [2019-01-12 23:30:32,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:32,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:32,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:32,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:32,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:33,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:33,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:30:33,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:30:33,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:30:33,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:33,097 INFO L87 Difference]: Start difference. First operand 6796 states and 14856 transitions. Second operand 7 states. [2019-01-12 23:30:33,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:33,265 INFO L93 Difference]: Finished difference Result 8554 states and 18799 transitions. [2019-01-12 23:30:33,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:30:33,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-01-12 23:30:33,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:33,274 INFO L225 Difference]: With dead ends: 8554 [2019-01-12 23:30:33,274 INFO L226 Difference]: Without dead ends: 8554 [2019-01-12 23:30:33,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-12 23:30:33,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8554 states. [2019-01-12 23:30:33,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8554 to 6128. [2019-01-12 23:30:33,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6128 states. [2019-01-12 23:30:33,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6128 states to 6128 states and 13324 transitions. [2019-01-12 23:30:33,334 INFO L78 Accepts]: Start accepts. Automaton has 6128 states and 13324 transitions. Word has length 96 [2019-01-12 23:30:33,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:33,335 INFO L480 AbstractCegarLoop]: Abstraction has 6128 states and 13324 transitions. [2019-01-12 23:30:33,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:30:33,335 INFO L276 IsEmpty]: Start isEmpty. Operand 6128 states and 13324 transitions. [2019-01-12 23:30:33,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:30:33,340 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:33,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:33,341 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:33,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:33,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1340898102, now seen corresponding path program 1 times [2019-01-12 23:30:33,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:33,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:33,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:33,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:33,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:33,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:33,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:30:33,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:30:33,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:30:33,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:33,694 INFO L87 Difference]: Start difference. First operand 6128 states and 13324 transitions. Second operand 7 states. [2019-01-12 23:30:33,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:33,943 INFO L93 Difference]: Finished difference Result 6757 states and 14643 transitions. [2019-01-12 23:30:33,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:30:33,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-01-12 23:30:33,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:33,953 INFO L225 Difference]: With dead ends: 6757 [2019-01-12 23:30:33,954 INFO L226 Difference]: Without dead ends: 6757 [2019-01-12 23:30:33,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-12 23:30:33,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6757 states. [2019-01-12 23:30:34,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6757 to 5214. [2019-01-12 23:30:34,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5214 states. [2019-01-12 23:30:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5214 states to 5214 states and 11389 transitions. [2019-01-12 23:30:34,008 INFO L78 Accepts]: Start accepts. Automaton has 5214 states and 11389 transitions. Word has length 96 [2019-01-12 23:30:34,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:34,008 INFO L480 AbstractCegarLoop]: Abstraction has 5214 states and 11389 transitions. [2019-01-12 23:30:34,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:30:34,008 INFO L276 IsEmpty]: Start isEmpty. Operand 5214 states and 11389 transitions. [2019-01-12 23:30:34,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:30:34,014 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:34,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:34,014 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:34,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:34,014 INFO L82 PathProgramCache]: Analyzing trace with hash -453394421, now seen corresponding path program 1 times [2019-01-12 23:30:34,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:34,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:34,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:34,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:34,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:34,345 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-12 23:30:34,518 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 23:30:34,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:34,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:34,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-12 23:30:34,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 23:30:34,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 23:30:34,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-12 23:30:34,724 INFO L87 Difference]: Start difference. First operand 5214 states and 11389 transitions. Second operand 11 states. [2019-01-12 23:30:36,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:36,427 INFO L93 Difference]: Finished difference Result 9915 states and 21866 transitions. [2019-01-12 23:30:36,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 23:30:36,428 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-01-12 23:30:36,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:36,437 INFO L225 Difference]: With dead ends: 9915 [2019-01-12 23:30:36,437 INFO L226 Difference]: Without dead ends: 6171 [2019-01-12 23:30:36,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-01-12 23:30:36,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6171 states. [2019-01-12 23:30:36,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6171 to 4642. [2019-01-12 23:30:36,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4642 states. [2019-01-12 23:30:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4642 states to 4642 states and 10103 transitions. [2019-01-12 23:30:36,489 INFO L78 Accepts]: Start accepts. Automaton has 4642 states and 10103 transitions. Word has length 96 [2019-01-12 23:30:36,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:36,489 INFO L480 AbstractCegarLoop]: Abstraction has 4642 states and 10103 transitions. [2019-01-12 23:30:36,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 23:30:36,490 INFO L276 IsEmpty]: Start isEmpty. Operand 4642 states and 10103 transitions. [2019-01-12 23:30:36,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:30:36,495 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:36,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:36,496 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:36,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:36,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1711267723, now seen corresponding path program 2 times [2019-01-12 23:30:36,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:36,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:36,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:36,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:36,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 23:30:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 23:30:36,589 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 23:30:36,845 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-12 23:30:36,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:30:36 BasicIcfg [2019-01-12 23:30:36,848 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 23:30:36,849 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 23:30:36,849 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 23:30:36,849 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 23:30:36,850 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:29:38" (3/4) ... [2019-01-12 23:30:36,857 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 23:30:37,104 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 23:30:37,107 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 23:30:37,108 INFO L168 Benchmark]: Toolchain (without parser) took 60767.28 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.8 GB). Free memory was 943.3 MB in the beginning and 1.9 GB in the end (delta: -973.2 MB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-01-12 23:30:37,108 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 23:30:37,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-01-12 23:30:37,109 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.49 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-12 23:30:37,109 INFO L168 Benchmark]: Boogie Preprocessor took 42.98 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-12 23:30:37,109 INFO L168 Benchmark]: RCFGBuilder took 1154.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2019-01-12 23:30:37,114 INFO L168 Benchmark]: TraceAbstraction took 58433.03 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -920.6 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-01-12 23:30:37,115 INFO L168 Benchmark]: Witness Printer took 257.81 ms. Allocated memory is still 4.8 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2019-01-12 23:30:37,119 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 805.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.49 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 42.98 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 1154.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 58433.03 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -920.6 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 257.81 ms. Allocated memory is still 4.8 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L679] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L681] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L684] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L685] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L686] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L687] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L688] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L692] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L693] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}] [L694] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L695] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L696] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L697] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L775] -1 pthread_t t309; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L776] FCALL, FORK -1 pthread_create(&t309, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L703] 0 y$w_buff1 = y$w_buff0 [L704] 0 y$w_buff0 = 1 [L705] 0 y$w_buff1_used = y$w_buff0_used [L706] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L777] -1 pthread_t t310; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L708] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L709] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L710] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L711] 0 y$r_buff0_thd1 = (_Bool)1 [L714] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] FCALL, FORK -1 pthread_create(&t310, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 x = 1 [L734] 1 __unbuffered_p1_EAX = x [L737] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L738] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L739] 1 y$flush_delayed = weak$$choice2 [L740] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L742] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L744] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L745] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L747] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y = y$flush_delayed ? y$mem_tmp : y [L750] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L720] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L721] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] -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) [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -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 [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] -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 [L791] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 58.2s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 27.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8963 SDtfs, 10046 SDslu, 20218 SDs, 0 SdLazy, 8730 SolverSat, 461 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 80 SyntacticMatches, 31 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 19.5s AutomataMinimizationTime, 33 MinimizatonAttempts, 183550 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 2490 NumberOfCodeBlocks, 2490 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2361 ConstructedInterpolants, 0 QuantifiedInterpolants, 579333 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...