./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix012_rmo.oepc_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_rmo.oepc_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 874a9972fda7c5371d5beee908ce94ffa39446d7 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:30:11,433 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 23:30:11,438 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 23:30:11,450 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 23:30:11,450 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 23:30:11,451 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 23:30:11,453 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 23:30:11,455 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 23:30:11,457 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 23:30:11,458 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 23:30:11,459 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 23:30:11,459 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 23:30:11,460 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 23:30:11,461 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 23:30:11,463 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 23:30:11,464 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 23:30:11,464 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 23:30:11,467 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 23:30:11,469 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 23:30:11,471 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 23:30:11,472 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 23:30:11,473 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 23:30:11,477 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 23:30:11,477 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 23:30:11,477 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 23:30:11,478 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 23:30:11,480 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 23:30:11,480 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 23:30:11,483 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 23:30:11,484 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 23:30:11,485 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 23:30:11,486 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 23:30:11,486 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 23:30:11,486 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 23:30:11,487 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 23:30:11,490 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 23:30:11,490 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:30:11,509 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 23:30:11,510 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 23:30:11,511 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 23:30:11,511 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 23:30:11,511 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 23:30:11,512 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 23:30:11,512 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 23:30:11,512 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 23:30:11,512 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 23:30:11,513 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 23:30:11,514 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 23:30:11,514 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 23:30:11,514 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 23:30:11,514 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 23:30:11,515 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 23:30:11,515 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 23:30:11,515 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 23:30:11,515 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 23:30:11,515 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 23:30:11,516 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 23:30:11,517 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 23:30:11,517 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 23:30:11,517 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 23:30:11,518 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 23:30:11,518 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 23:30:11,518 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 23:30:11,519 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 23:30:11,519 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 23:30:11,519 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 -> 874a9972fda7c5371d5beee908ce94ffa39446d7 [2019-01-12 23:30:11,558 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 23:30:11,576 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 23:30:11,583 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 23:30:11,584 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 23:30:11,585 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 23:30:11,585 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix012_rmo.oepc_false-unreach-call.i [2019-01-12 23:30:11,650 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/918fbb0c4/0edd2cd6ee694cc5b608b21512bf34e7/FLAG0c97acc8d [2019-01-12 23:30:12,280 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 23:30:12,281 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix012_rmo.oepc_false-unreach-call.i [2019-01-12 23:30:12,300 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/918fbb0c4/0edd2cd6ee694cc5b608b21512bf34e7/FLAG0c97acc8d [2019-01-12 23:30:12,449 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/918fbb0c4/0edd2cd6ee694cc5b608b21512bf34e7 [2019-01-12 23:30:12,455 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 23:30:12,457 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 23:30:12,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 23:30:12,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 23:30:12,466 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 23:30:12,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:30:12" (1/1) ... [2019-01-12 23:30:12,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c433c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:12, skipping insertion in model container [2019-01-12 23:30:12,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:30:12" (1/1) ... [2019-01-12 23:30:12,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 23:30:12,556 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 23:30:13,073 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 23:30:13,097 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 23:30:13,276 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 23:30:13,354 INFO L195 MainTranslator]: Completed translation [2019-01-12 23:30:13,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:13 WrapperNode [2019-01-12 23:30:13,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 23:30:13,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 23:30:13,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 23:30:13,356 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 23:30:13,367 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:30:13" (1/1) ... [2019-01-12 23:30:13,393 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:30:13" (1/1) ... [2019-01-12 23:30:13,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 23:30:13,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 23:30:13,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 23:30:13,427 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 23:30:13,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:13" (1/1) ... [2019-01-12 23:30:13,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:13" (1/1) ... [2019-01-12 23:30:13,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:13" (1/1) ... [2019-01-12 23:30:13,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:13" (1/1) ... [2019-01-12 23:30:13,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:13" (1/1) ... [2019-01-12 23:30:13,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:13" (1/1) ... [2019-01-12 23:30:13,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:13" (1/1) ... [2019-01-12 23:30:13,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 23:30:13,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 23:30:13,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 23:30:13,472 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 23:30:13,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:13" (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:30:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 23:30:13,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-12 23:30:13,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 23:30:13,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 23:30:13,538 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-12 23:30:13,538 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-12 23:30:13,538 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-12 23:30:13,539 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-12 23:30:13,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-12 23:30:13,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 23:30:13,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 23:30:13,541 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:30:14,612 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 23:30:14,613 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-12 23:30:14,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:30:14 BoogieIcfgContainer [2019-01-12 23:30:14,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 23:30:14,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 23:30:14,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 23:30:14,620 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 23:30:14,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:30:12" (1/3) ... [2019-01-12 23:30:14,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728a96b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:30:14, skipping insertion in model container [2019-01-12 23:30:14,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:13" (2/3) ... [2019-01-12 23:30:14,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728a96b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:30:14, skipping insertion in model container [2019-01-12 23:30:14,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:30:14" (3/3) ... [2019-01-12 23:30:14,626 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_rmo.oepc_false-unreach-call.i [2019-01-12 23:30:14,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,676 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,676 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,676 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,677 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:30:14,677 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,678 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,679 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,679 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,679 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,680 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,680 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,680 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,680 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,681 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,682 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,682 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,684 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,686 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,687 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,687 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,687 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,687 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,687 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,688 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,688 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,688 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,688 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,688 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,689 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,694 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,694 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,706 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,706 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,706 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,706 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,711 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,712 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,712 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,712 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,712 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,715 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:14,759 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-12 23:30:14,759 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 23:30:14,769 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 23:30:14,787 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 23:30:14,815 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 23:30:14,816 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 23:30:14,816 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 23:30:14,816 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 23:30:14,816 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 23:30:14,816 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 23:30:14,816 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 23:30:14,817 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 23:30:14,817 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 23:30:14,831 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2019-01-12 23:30:17,190 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2019-01-12 23:30:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2019-01-12 23:30:17,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 23:30:17,200 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:17,201 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:30:17,204 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:17,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:17,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1782476305, now seen corresponding path program 1 times [2019-01-12 23:30:17,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:17,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:17,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:17,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:17,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:17,522 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,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:17,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:30:17,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:30:17,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:30:17,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:17,545 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2019-01-12 23:30:19,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:19,154 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2019-01-12 23:30:19,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:30:19,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-01-12 23:30:19,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:19,523 INFO L225 Difference]: With dead ends: 60791 [2019-01-12 23:30:19,523 INFO L226 Difference]: Without dead ends: 44271 [2019-01-12 23:30:19,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:19,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2019-01-12 23:30:21,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2019-01-12 23:30:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2019-01-12 23:30:21,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2019-01-12 23:30:21,499 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2019-01-12 23:30:21,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:21,500 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2019-01-12 23:30:21,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:30:21,500 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2019-01-12 23:30:21,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-12 23:30:21,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:21,512 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:30:21,512 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:21,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:21,513 INFO L82 PathProgramCache]: Analyzing trace with hash -983112731, now seen corresponding path program 1 times [2019-01-12 23:30:21,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:21,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:21,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:21,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:21,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:21,686 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,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:21,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:30:21,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:30:21,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:30:21,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:21,689 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 4 states. [2019-01-12 23:30:22,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:22,054 INFO L93 Difference]: Finished difference Result 8529 states and 28345 transitions. [2019-01-12 23:30:22,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 23:30:22,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-01-12 23:30:22,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:22,084 INFO L225 Difference]: With dead ends: 8529 [2019-01-12 23:30:22,084 INFO L226 Difference]: Without dead ends: 7467 [2019-01-12 23:30:22,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:22,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2019-01-12 23:30:22,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7467. [2019-01-12 23:30:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7467 states. [2019-01-12 23:30:22,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7467 states to 7467 states and 24637 transitions. [2019-01-12 23:30:22,306 INFO L78 Accepts]: Start accepts. Automaton has 7467 states and 24637 transitions. Word has length 46 [2019-01-12 23:30:22,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:22,308 INFO L480 AbstractCegarLoop]: Abstraction has 7467 states and 24637 transitions. [2019-01-12 23:30:22,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:30:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand 7467 states and 24637 transitions. [2019-01-12 23:30:22,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-12 23:30:22,312 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:22,312 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:30:22,313 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:22,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:22,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1484418599, now seen corresponding path program 1 times [2019-01-12 23:30:22,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:22,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:22,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:22,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:22,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:22,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:22,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:22,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:22,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:22,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:22,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:22,579 INFO L87 Difference]: Start difference. First operand 7467 states and 24637 transitions. Second operand 5 states. [2019-01-12 23:30:23,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:23,974 INFO L93 Difference]: Finished difference Result 13999 states and 45806 transitions. [2019-01-12 23:30:23,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:30:23,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-01-12 23:30:23,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:24,027 INFO L225 Difference]: With dead ends: 13999 [2019-01-12 23:30:24,027 INFO L226 Difference]: Without dead ends: 13931 [2019-01-12 23:30:24,027 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:30:24,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13931 states. [2019-01-12 23:30:24,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13931 to 9442. [2019-01-12 23:30:24,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9442 states. [2019-01-12 23:30:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9442 states to 9442 states and 30543 transitions. [2019-01-12 23:30:24,490 INFO L78 Accepts]: Start accepts. Automaton has 9442 states and 30543 transitions. Word has length 47 [2019-01-12 23:30:24,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:24,492 INFO L480 AbstractCegarLoop]: Abstraction has 9442 states and 30543 transitions. [2019-01-12 23:30:24,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:24,492 INFO L276 IsEmpty]: Start isEmpty. Operand 9442 states and 30543 transitions. [2019-01-12 23:30:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 23:30:24,495 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:24,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] [2019-01-12 23:30:24,496 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:24,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:24,496 INFO L82 PathProgramCache]: Analyzing trace with hash 375052511, now seen corresponding path program 1 times [2019-01-12 23:30:24,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:24,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:24,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:24,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:24,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:24,592 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:24,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:24,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:30:24,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:30:24,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:30:24,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:30:24,595 INFO L87 Difference]: Start difference. First operand 9442 states and 30543 transitions. Second operand 3 states. [2019-01-12 23:30:24,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:24,911 INFO L93 Difference]: Finished difference Result 13280 states and 42642 transitions. [2019-01-12 23:30:24,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:30:24,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-01-12 23:30:24,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:24,945 INFO L225 Difference]: With dead ends: 13280 [2019-01-12 23:30:24,945 INFO L226 Difference]: Without dead ends: 13280 [2019-01-12 23:30:24,946 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:24,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13280 states. [2019-01-12 23:30:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13280 to 9846. [2019-01-12 23:30:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9846 states. [2019-01-12 23:30:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9846 states to 9846 states and 31509 transitions. [2019-01-12 23:30:25,210 INFO L78 Accepts]: Start accepts. Automaton has 9846 states and 31509 transitions. Word has length 49 [2019-01-12 23:30:25,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:25,211 INFO L480 AbstractCegarLoop]: Abstraction has 9846 states and 31509 transitions. [2019-01-12 23:30:25,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:30:25,211 INFO L276 IsEmpty]: Start isEmpty. Operand 9846 states and 31509 transitions. [2019-01-12 23:30:25,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 23:30:25,215 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:25,215 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:25,215 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:25,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:25,216 INFO L82 PathProgramCache]: Analyzing trace with hash -211879190, now seen corresponding path program 1 times [2019-01-12 23:30:25,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:25,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:25,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:25,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:25,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:25,670 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,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:25,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:30:25,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:30:25,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:30:25,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:25,672 INFO L87 Difference]: Start difference. First operand 9846 states and 31509 transitions. Second operand 6 states. [2019-01-12 23:30:26,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:26,570 INFO L93 Difference]: Finished difference Result 14204 states and 45065 transitions. [2019-01-12 23:30:26,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 23:30:26,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-01-12 23:30:26,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:26,601 INFO L225 Difference]: With dead ends: 14204 [2019-01-12 23:30:26,601 INFO L226 Difference]: Without dead ends: 14132 [2019-01-12 23:30:26,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-12 23:30:26,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14132 states. [2019-01-12 23:30:26,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14132 to 10850. [2019-01-12 23:30:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10850 states. [2019-01-12 23:30:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10850 states to 10850 states and 34564 transitions. [2019-01-12 23:30:26,878 INFO L78 Accepts]: Start accepts. Automaton has 10850 states and 34564 transitions. Word has length 53 [2019-01-12 23:30:26,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:26,878 INFO L480 AbstractCegarLoop]: Abstraction has 10850 states and 34564 transitions. [2019-01-12 23:30:26,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:30:26,879 INFO L276 IsEmpty]: Start isEmpty. Operand 10850 states and 34564 transitions. [2019-01-12 23:30:26,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 23:30:26,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:26,889 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:26,889 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:26,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:26,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1760614074, now seen corresponding path program 1 times [2019-01-12 23:30:26,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:26,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:26,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:26,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:26,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:27,117 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,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:27,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:30:27,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:30:27,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:30:27,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:27,121 INFO L87 Difference]: Start difference. First operand 10850 states and 34564 transitions. Second operand 4 states. [2019-01-12 23:30:27,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:27,318 INFO L93 Difference]: Finished difference Result 12397 states and 39573 transitions. [2019-01-12 23:30:27,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 23:30:27,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-01-12 23:30:27,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:27,338 INFO L225 Difference]: With dead ends: 12397 [2019-01-12 23:30:27,338 INFO L226 Difference]: Without dead ends: 12397 [2019-01-12 23:30:27,339 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:27,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12397 states. [2019-01-12 23:30:27,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12397 to 11370. [2019-01-12 23:30:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11370 states. [2019-01-12 23:30:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11370 states to 11370 states and 36237 transitions. [2019-01-12 23:30:27,639 INFO L78 Accepts]: Start accepts. Automaton has 11370 states and 36237 transitions. Word has length 61 [2019-01-12 23:30:27,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:27,642 INFO L480 AbstractCegarLoop]: Abstraction has 11370 states and 36237 transitions. [2019-01-12 23:30:27,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:30:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 11370 states and 36237 transitions. [2019-01-12 23:30:27,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 23:30:27,652 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:27,653 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:27,653 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:27,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:27,653 INFO L82 PathProgramCache]: Analyzing trace with hash -17803739, now seen corresponding path program 1 times [2019-01-12 23:30:27,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:27,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:27,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:27,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:27,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:27,816 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,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:27,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:30:27,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:30:27,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:30:27,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:27,819 INFO L87 Difference]: Start difference. First operand 11370 states and 36237 transitions. Second operand 6 states. [2019-01-12 23:30:28,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:28,629 INFO L93 Difference]: Finished difference Result 20970 states and 66487 transitions. [2019-01-12 23:30:28,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 23:30:28,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-01-12 23:30:28,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:28,665 INFO L225 Difference]: With dead ends: 20970 [2019-01-12 23:30:28,666 INFO L226 Difference]: Without dead ends: 20899 [2019-01-12 23:30:28,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-12 23:30:28,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20899 states. [2019-01-12 23:30:29,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20899 to 13756. [2019-01-12 23:30:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13756 states. [2019-01-12 23:30:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13756 states to 13756 states and 43281 transitions. [2019-01-12 23:30:29,193 INFO L78 Accepts]: Start accepts. Automaton has 13756 states and 43281 transitions. Word has length 61 [2019-01-12 23:30:29,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:29,193 INFO L480 AbstractCegarLoop]: Abstraction has 13756 states and 43281 transitions. [2019-01-12 23:30:29,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:30:29,194 INFO L276 IsEmpty]: Start isEmpty. Operand 13756 states and 43281 transitions. [2019-01-12 23:30:29,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-12 23:30:29,207 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:29,207 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] [2019-01-12 23:30:29,207 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:29,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:29,208 INFO L82 PathProgramCache]: Analyzing trace with hash -248672700, now seen corresponding path program 1 times [2019-01-12 23:30:29,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:29,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:29,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:29,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:29,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:29,343 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,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:29,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:30:29,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:30:29,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:30:29,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:30:29,345 INFO L87 Difference]: Start difference. First operand 13756 states and 43281 transitions. Second operand 3 states. [2019-01-12 23:30:29,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:29,834 INFO L93 Difference]: Finished difference Result 14388 states and 44981 transitions. [2019-01-12 23:30:29,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:30:29,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-01-12 23:30:29,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:29,857 INFO L225 Difference]: With dead ends: 14388 [2019-01-12 23:30:29,857 INFO L226 Difference]: Without dead ends: 14388 [2019-01-12 23:30:29,857 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:29,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14388 states. [2019-01-12 23:30:30,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14388 to 14072. [2019-01-12 23:30:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14072 states. [2019-01-12 23:30:30,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14072 states to 14072 states and 44131 transitions. [2019-01-12 23:30:30,064 INFO L78 Accepts]: Start accepts. Automaton has 14072 states and 44131 transitions. Word has length 65 [2019-01-12 23:30:30,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:30,064 INFO L480 AbstractCegarLoop]: Abstraction has 14072 states and 44131 transitions. [2019-01-12 23:30:30,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:30:30,064 INFO L276 IsEmpty]: Start isEmpty. Operand 14072 states and 44131 transitions. [2019-01-12 23:30:30,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-12 23:30:30,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:30,072 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] [2019-01-12 23:30:30,072 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:30,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:30,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1828536643, now seen corresponding path program 1 times [2019-01-12 23:30:30,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:30,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:30,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:30,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:30,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:30,311 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,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:30,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:30:30,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:30:30,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:30:30,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:30,314 INFO L87 Difference]: Start difference. First operand 14072 states and 44131 transitions. Second operand 4 states. [2019-01-12 23:30:30,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:30,920 INFO L93 Difference]: Finished difference Result 17952 states and 55436 transitions. [2019-01-12 23:30:30,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:30:30,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-01-12 23:30:30,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:30,947 INFO L225 Difference]: With dead ends: 17952 [2019-01-12 23:30:30,947 INFO L226 Difference]: Without dead ends: 17952 [2019-01-12 23:30:30,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:30,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17952 states. [2019-01-12 23:30:31,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17952 to 16110. [2019-01-12 23:30:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16110 states. [2019-01-12 23:30:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16110 states to 16110 states and 49982 transitions. [2019-01-12 23:30:31,193 INFO L78 Accepts]: Start accepts. Automaton has 16110 states and 49982 transitions. Word has length 65 [2019-01-12 23:30:31,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:31,193 INFO L480 AbstractCegarLoop]: Abstraction has 16110 states and 49982 transitions. [2019-01-12 23:30:31,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:30:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 16110 states and 49982 transitions. [2019-01-12 23:30:31,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:30:31,206 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:31,206 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:31,206 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:31,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:31,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1344510516, now seen corresponding path program 1 times [2019-01-12 23:30:31,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:31,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:31,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:31,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:31,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:31,360 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,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:31,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:30:31,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:30:31,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:30:31,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:31,361 INFO L87 Difference]: Start difference. First operand 16110 states and 49982 transitions. Second operand 6 states. [2019-01-12 23:30:33,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:33,005 INFO L93 Difference]: Finished difference Result 19822 states and 60438 transitions. [2019-01-12 23:30:33,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:30:33,006 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-01-12 23:30:33,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:33,046 INFO L225 Difference]: With dead ends: 19822 [2019-01-12 23:30:33,046 INFO L226 Difference]: Without dead ends: 19822 [2019-01-12 23:30:33,046 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:33,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19822 states. [2019-01-12 23:30:33,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19822 to 18618. [2019-01-12 23:30:33,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18618 states. [2019-01-12 23:30:33,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18618 states to 18618 states and 57218 transitions. [2019-01-12 23:30:33,677 INFO L78 Accepts]: Start accepts. Automaton has 18618 states and 57218 transitions. Word has length 67 [2019-01-12 23:30:33,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:33,678 INFO L480 AbstractCegarLoop]: Abstraction has 18618 states and 57218 transitions. [2019-01-12 23:30:33,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:30:33,678 INFO L276 IsEmpty]: Start isEmpty. Operand 18618 states and 57218 transitions. [2019-01-12 23:30:33,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:30:33,692 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:33,692 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:33,692 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:33,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:33,693 INFO L82 PathProgramCache]: Analyzing trace with hash 873247437, now seen corresponding path program 1 times [2019-01-12 23:30:33,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:33,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:33,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:33,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:33,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:34,111 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-12 23:30:34,179 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,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:34,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:30:34,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:30:34,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:30:34,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:34,181 INFO L87 Difference]: Start difference. First operand 18618 states and 57218 transitions. Second operand 6 states. [2019-01-12 23:30:35,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:35,000 INFO L93 Difference]: Finished difference Result 21450 states and 63627 transitions. [2019-01-12 23:30:35,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:30:35,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-01-12 23:30:35,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:35,031 INFO L225 Difference]: With dead ends: 21450 [2019-01-12 23:30:35,031 INFO L226 Difference]: Without dead ends: 21450 [2019-01-12 23:30:35,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:30:35,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21450 states. [2019-01-12 23:30:35,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21450 to 19134. [2019-01-12 23:30:35,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19134 states. [2019-01-12 23:30:35,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19134 states to 19134 states and 57765 transitions. [2019-01-12 23:30:35,292 INFO L78 Accepts]: Start accepts. Automaton has 19134 states and 57765 transitions. Word has length 67 [2019-01-12 23:30:35,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:35,292 INFO L480 AbstractCegarLoop]: Abstraction has 19134 states and 57765 transitions. [2019-01-12 23:30:35,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:30:35,292 INFO L276 IsEmpty]: Start isEmpty. Operand 19134 states and 57765 transitions. [2019-01-12 23:30:35,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:30:35,303 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:35,303 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:35,303 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:35,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:35,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1084598350, now seen corresponding path program 1 times [2019-01-12 23:30:35,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:35,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:35,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:35,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:35,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:35,744 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:35,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:35,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:35,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:35,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:35,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:35,745 INFO L87 Difference]: Start difference. First operand 19134 states and 57765 transitions. Second operand 5 states. [2019-01-12 23:30:36,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:36,758 INFO L93 Difference]: Finished difference Result 25025 states and 75019 transitions. [2019-01-12 23:30:36,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:30:36,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-01-12 23:30:36,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:36,795 INFO L225 Difference]: With dead ends: 25025 [2019-01-12 23:30:36,795 INFO L226 Difference]: Without dead ends: 25025 [2019-01-12 23:30:36,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:36,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25025 states. [2019-01-12 23:30:37,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25025 to 22710. [2019-01-12 23:30:37,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22710 states. [2019-01-12 23:30:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22710 states to 22710 states and 68033 transitions. [2019-01-12 23:30:37,120 INFO L78 Accepts]: Start accepts. Automaton has 22710 states and 68033 transitions. Word has length 67 [2019-01-12 23:30:37,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:37,120 INFO L480 AbstractCegarLoop]: Abstraction has 22710 states and 68033 transitions. [2019-01-12 23:30:37,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:37,121 INFO L276 IsEmpty]: Start isEmpty. Operand 22710 states and 68033 transitions. [2019-01-12 23:30:37,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:30:37,132 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:37,133 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:37,133 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:37,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:37,133 INFO L82 PathProgramCache]: Analyzing trace with hash 574064173, now seen corresponding path program 1 times [2019-01-12 23:30:37,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:37,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:37,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:37,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:37,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:37,446 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:37,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:37,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:37,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:37,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:37,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:37,447 INFO L87 Difference]: Start difference. First operand 22710 states and 68033 transitions. Second operand 5 states. [2019-01-12 23:30:38,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:38,167 INFO L93 Difference]: Finished difference Result 31960 states and 94872 transitions. [2019-01-12 23:30:38,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:30:38,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-01-12 23:30:38,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:38,214 INFO L225 Difference]: With dead ends: 31960 [2019-01-12 23:30:38,214 INFO L226 Difference]: Without dead ends: 31960 [2019-01-12 23:30:38,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:30:38,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31960 states. [2019-01-12 23:30:38,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31960 to 28240. [2019-01-12 23:30:38,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28240 states. [2019-01-12 23:30:38,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28240 states to 28240 states and 84260 transitions. [2019-01-12 23:30:38,741 INFO L78 Accepts]: Start accepts. Automaton has 28240 states and 84260 transitions. Word has length 67 [2019-01-12 23:30:38,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:38,741 INFO L480 AbstractCegarLoop]: Abstraction has 28240 states and 84260 transitions. [2019-01-12 23:30:38,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:38,741 INFO L276 IsEmpty]: Start isEmpty. Operand 28240 states and 84260 transitions. [2019-01-12 23:30:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:30:39,035 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:39,036 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:39,036 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:39,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:39,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1233390290, now seen corresponding path program 1 times [2019-01-12 23:30:39,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:39,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:39,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:39,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:39,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:39,241 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:39,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:39,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:30:39,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:30:39,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:30:39,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:39,242 INFO L87 Difference]: Start difference. First operand 28240 states and 84260 transitions. Second operand 4 states. [2019-01-12 23:30:40,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:40,021 INFO L93 Difference]: Finished difference Result 38904 states and 116586 transitions. [2019-01-12 23:30:40,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 23:30:40,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-01-12 23:30:40,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:40,082 INFO L225 Difference]: With dead ends: 38904 [2019-01-12 23:30:40,082 INFO L226 Difference]: Without dead ends: 38672 [2019-01-12 23:30:40,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:40,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38672 states. [2019-01-12 23:30:40,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38672 to 35808. [2019-01-12 23:30:40,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35808 states. [2019-01-12 23:30:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35808 states to 35808 states and 107400 transitions. [2019-01-12 23:30:40,575 INFO L78 Accepts]: Start accepts. Automaton has 35808 states and 107400 transitions. Word has length 67 [2019-01-12 23:30:40,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:40,576 INFO L480 AbstractCegarLoop]: Abstraction has 35808 states and 107400 transitions. [2019-01-12 23:30:40,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:30:40,576 INFO L276 IsEmpty]: Start isEmpty. Operand 35808 states and 107400 transitions. [2019-01-12 23:30:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:30:40,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:40,589 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:40,590 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:40,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:40,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1264625647, now seen corresponding path program 1 times [2019-01-12 23:30:40,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:40,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:40,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:40,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:40,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:40,809 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:40,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:40,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:40,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:40,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:40,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:40,810 INFO L87 Difference]: Start difference. First operand 35808 states and 107400 transitions. Second operand 5 states. [2019-01-12 23:30:40,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:40,967 INFO L93 Difference]: Finished difference Result 9316 states and 22547 transitions. [2019-01-12 23:30:40,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 23:30:40,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-01-12 23:30:40,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:40,977 INFO L225 Difference]: With dead ends: 9316 [2019-01-12 23:30:40,977 INFO L226 Difference]: Without dead ends: 7464 [2019-01-12 23:30:40,978 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:40,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7464 states. [2019-01-12 23:30:41,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7464 to 6361. [2019-01-12 23:30:41,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6361 states. [2019-01-12 23:30:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 15018 transitions. [2019-01-12 23:30:41,048 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 15018 transitions. Word has length 67 [2019-01-12 23:30:41,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:41,049 INFO L480 AbstractCegarLoop]: Abstraction has 6361 states and 15018 transitions. [2019-01-12 23:30:41,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:41,049 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 15018 transitions. [2019-01-12 23:30:41,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:30:41,055 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:41,055 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:41,055 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:41,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:41,055 INFO L82 PathProgramCache]: Analyzing trace with hash 288361846, now seen corresponding path program 1 times [2019-01-12 23:30:41,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:41,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:41,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:41,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:41,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:41,131 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:41,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:41,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:30:41,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:30:41,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:30:41,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:30:41,133 INFO L87 Difference]: Start difference. First operand 6361 states and 15018 transitions. Second operand 3 states. [2019-01-12 23:30:41,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:41,191 INFO L93 Difference]: Finished difference Result 8820 states and 20757 transitions. [2019-01-12 23:30:41,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:30:41,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-12 23:30:41,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:41,201 INFO L225 Difference]: With dead ends: 8820 [2019-01-12 23:30:41,201 INFO L226 Difference]: Without dead ends: 8820 [2019-01-12 23:30:41,202 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:41,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8820 states. [2019-01-12 23:30:41,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8820 to 6300. [2019-01-12 23:30:41,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6300 states. [2019-01-12 23:30:41,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6300 states to 6300 states and 14558 transitions. [2019-01-12 23:30:41,274 INFO L78 Accepts]: Start accepts. Automaton has 6300 states and 14558 transitions. Word has length 67 [2019-01-12 23:30:41,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:41,274 INFO L480 AbstractCegarLoop]: Abstraction has 6300 states and 14558 transitions. [2019-01-12 23:30:41,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:30:41,274 INFO L276 IsEmpty]: Start isEmpty. Operand 6300 states and 14558 transitions. [2019-01-12 23:30:41,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-12 23:30:41,282 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:41,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:41,283 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:41,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:41,283 INFO L82 PathProgramCache]: Analyzing trace with hash -211461463, now seen corresponding path program 1 times [2019-01-12 23:30:41,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:41,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:41,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:41,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:41,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:41,417 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:41,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:41,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:41,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:41,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:41,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:41,419 INFO L87 Difference]: Start difference. First operand 6300 states and 14558 transitions. Second operand 5 states. [2019-01-12 23:30:41,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:41,627 INFO L93 Difference]: Finished difference Result 7470 states and 17199 transitions. [2019-01-12 23:30:41,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:30:41,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-01-12 23:30:41,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:41,639 INFO L225 Difference]: With dead ends: 7470 [2019-01-12 23:30:41,639 INFO L226 Difference]: Without dead ends: 7470 [2019-01-12 23:30:41,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:30:41,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2019-01-12 23:30:41,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 6744. [2019-01-12 23:30:41,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6744 states. [2019-01-12 23:30:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6744 states to 6744 states and 15562 transitions. [2019-01-12 23:30:41,707 INFO L78 Accepts]: Start accepts. Automaton has 6744 states and 15562 transitions. Word has length 73 [2019-01-12 23:30:41,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:41,707 INFO L480 AbstractCegarLoop]: Abstraction has 6744 states and 15562 transitions. [2019-01-12 23:30:41,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:41,708 INFO L276 IsEmpty]: Start isEmpty. Operand 6744 states and 15562 transitions. [2019-01-12 23:30:41,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-12 23:30:41,713 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:41,714 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:41,714 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:41,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:41,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1531348872, now seen corresponding path program 1 times [2019-01-12 23:30:41,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:41,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:41,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:41,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:41,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:42,009 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:42,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:42,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:30:42,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:30:42,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:30:42,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:42,010 INFO L87 Difference]: Start difference. First operand 6744 states and 15562 transitions. Second operand 7 states. [2019-01-12 23:30:42,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:42,512 INFO L93 Difference]: Finished difference Result 7881 states and 17984 transitions. [2019-01-12 23:30:42,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 23:30:42,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-01-12 23:30:42,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:42,524 INFO L225 Difference]: With dead ends: 7881 [2019-01-12 23:30:42,524 INFO L226 Difference]: Without dead ends: 7762 [2019-01-12 23:30:42,525 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:42,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2019-01-12 23:30:42,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 6841. [2019-01-12 23:30:42,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6841 states. [2019-01-12 23:30:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 15655 transitions. [2019-01-12 23:30:42,594 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 15655 transitions. Word has length 73 [2019-01-12 23:30:42,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:42,595 INFO L480 AbstractCegarLoop]: Abstraction has 6841 states and 15655 transitions. [2019-01-12 23:30:42,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:30:42,595 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 15655 transitions. [2019-01-12 23:30:42,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-12 23:30:42,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:42,602 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] [2019-01-12 23:30:42,602 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:42,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:42,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1190095737, now seen corresponding path program 1 times [2019-01-12 23:30:42,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:42,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:42,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:42,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:42,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:42,672 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:42,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:42,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:30:42,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:30:42,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:30:42,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:42,673 INFO L87 Difference]: Start difference. First operand 6841 states and 15655 transitions. Second operand 4 states. [2019-01-12 23:30:43,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:43,005 INFO L93 Difference]: Finished difference Result 10608 states and 24142 transitions. [2019-01-12 23:30:43,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:30:43,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-12 23:30:43,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:43,019 INFO L225 Difference]: With dead ends: 10608 [2019-01-12 23:30:43,019 INFO L226 Difference]: Without dead ends: 10608 [2019-01-12 23:30:43,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10608 states. [2019-01-12 23:30:43,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10608 to 7961. [2019-01-12 23:30:43,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7961 states. [2019-01-12 23:30:43,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7961 states to 7961 states and 17989 transitions. [2019-01-12 23:30:43,111 INFO L78 Accepts]: Start accepts. Automaton has 7961 states and 17989 transitions. Word has length 92 [2019-01-12 23:30:43,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:43,111 INFO L480 AbstractCegarLoop]: Abstraction has 7961 states and 17989 transitions. [2019-01-12 23:30:43,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:30:43,111 INFO L276 IsEmpty]: Start isEmpty. Operand 7961 states and 17989 transitions. [2019-01-12 23:30:43,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-12 23:30:43,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:43,119 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] [2019-01-12 23:30:43,120 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:43,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:43,120 INFO L82 PathProgramCache]: Analyzing trace with hash -135706017, now seen corresponding path program 1 times [2019-01-12 23:30:43,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:43,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:43,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:43,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:43,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:43,379 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:43,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:43,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:30:43,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:30:43,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:30:43,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:43,382 INFO L87 Difference]: Start difference. First operand 7961 states and 17989 transitions. Second operand 4 states. [2019-01-12 23:30:43,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:43,514 INFO L93 Difference]: Finished difference Result 8526 states and 19282 transitions. [2019-01-12 23:30:43,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:30:43,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-12 23:30:43,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:43,524 INFO L225 Difference]: With dead ends: 8526 [2019-01-12 23:30:43,524 INFO L226 Difference]: Without dead ends: 8526 [2019-01-12 23:30:43,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:43,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8526 states. [2019-01-12 23:30:43,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8526 to 7867. [2019-01-12 23:30:43,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7867 states. [2019-01-12 23:30:43,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7867 states to 7867 states and 17884 transitions. [2019-01-12 23:30:43,604 INFO L78 Accepts]: Start accepts. Automaton has 7867 states and 17884 transitions. Word has length 92 [2019-01-12 23:30:43,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:43,604 INFO L480 AbstractCegarLoop]: Abstraction has 7867 states and 17884 transitions. [2019-01-12 23:30:43,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:30:43,604 INFO L276 IsEmpty]: Start isEmpty. Operand 7867 states and 17884 transitions. [2019-01-12 23:30:43,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:43,612 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:43,612 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:43,613 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:43,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:43,613 INFO L82 PathProgramCache]: Analyzing trace with hash -2094563457, now seen corresponding path program 1 times [2019-01-12 23:30:43,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:43,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:43,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:43,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:43,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:43,795 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:43,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:43,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:43,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:43,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:43,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:43,796 INFO L87 Difference]: Start difference. First operand 7867 states and 17884 transitions. Second operand 5 states. [2019-01-12 23:30:44,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:44,213 INFO L93 Difference]: Finished difference Result 7433 states and 16736 transitions. [2019-01-12 23:30:44,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 23:30:44,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-12 23:30:44,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:44,223 INFO L225 Difference]: With dead ends: 7433 [2019-01-12 23:30:44,223 INFO L226 Difference]: Without dead ends: 7433 [2019-01-12 23:30:44,223 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:44,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7433 states. [2019-01-12 23:30:44,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7433 to 7001. [2019-01-12 23:30:44,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7001 states. [2019-01-12 23:30:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7001 states to 7001 states and 15799 transitions. [2019-01-12 23:30:44,300 INFO L78 Accepts]: Start accepts. Automaton has 7001 states and 15799 transitions. Word has length 94 [2019-01-12 23:30:44,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:44,300 INFO L480 AbstractCegarLoop]: Abstraction has 7001 states and 15799 transitions. [2019-01-12 23:30:44,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:44,300 INFO L276 IsEmpty]: Start isEmpty. Operand 7001 states and 15799 transitions. [2019-01-12 23:30:44,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:44,307 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:44,308 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:44,309 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:44,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:44,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1142550815, now seen corresponding path program 2 times [2019-01-12 23:30:44,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:44,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:44,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:44,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:44,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:44,456 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:44,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:44,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:44,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:44,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:44,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:44,457 INFO L87 Difference]: Start difference. First operand 7001 states and 15799 transitions. Second operand 5 states. [2019-01-12 23:30:44,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:44,612 INFO L93 Difference]: Finished difference Result 8250 states and 18542 transitions. [2019-01-12 23:30:44,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:30:44,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-12 23:30:44,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:44,622 INFO L225 Difference]: With dead ends: 8250 [2019-01-12 23:30:44,622 INFO L226 Difference]: Without dead ends: 8250 [2019-01-12 23:30:44,622 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:44,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8250 states. [2019-01-12 23:30:44,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8250 to 6483. [2019-01-12 23:30:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6483 states. [2019-01-12 23:30:44,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6483 states to 6483 states and 14650 transitions. [2019-01-12 23:30:44,691 INFO L78 Accepts]: Start accepts. Automaton has 6483 states and 14650 transitions. Word has length 94 [2019-01-12 23:30:44,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:44,692 INFO L480 AbstractCegarLoop]: Abstraction has 6483 states and 14650 transitions. [2019-01-12 23:30:44,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:44,692 INFO L276 IsEmpty]: Start isEmpty. Operand 6483 states and 14650 transitions. [2019-01-12 23:30:44,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:44,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:44,701 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:44,701 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:44,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:44,701 INFO L82 PathProgramCache]: Analyzing trace with hash 807749440, now seen corresponding path program 1 times [2019-01-12 23:30:44,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:44,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:44,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:44,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 23:30:44,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:45,071 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:45,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:45,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:30:45,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:30:45,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:30:45,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:45,072 INFO L87 Difference]: Start difference. First operand 6483 states and 14650 transitions. Second operand 7 states. [2019-01-12 23:30:45,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:45,540 INFO L93 Difference]: Finished difference Result 8462 states and 18843 transitions. [2019-01-12 23:30:45,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 23:30:45,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-12 23:30:45,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:45,552 INFO L225 Difference]: With dead ends: 8462 [2019-01-12 23:30:45,553 INFO L226 Difference]: Without dead ends: 8349 [2019-01-12 23:30:45,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-12 23:30:45,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8349 states. [2019-01-12 23:30:45,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8349 to 7024. [2019-01-12 23:30:45,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7024 states. [2019-01-12 23:30:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7024 states to 7024 states and 15769 transitions. [2019-01-12 23:30:45,626 INFO L78 Accepts]: Start accepts. Automaton has 7024 states and 15769 transitions. Word has length 94 [2019-01-12 23:30:45,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:45,627 INFO L480 AbstractCegarLoop]: Abstraction has 7024 states and 15769 transitions. [2019-01-12 23:30:45,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:30:45,627 INFO L276 IsEmpty]: Start isEmpty. Operand 7024 states and 15769 transitions. [2019-01-12 23:30:45,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:45,636 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:45,636 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:45,636 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:45,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:45,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1870899937, now seen corresponding path program 1 times [2019-01-12 23:30:45,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:45,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:45,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:45,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:45,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:45,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:45,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:45,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:30:45,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:30:45,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:30:45,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:45,783 INFO L87 Difference]: Start difference. First operand 7024 states and 15769 transitions. Second operand 6 states. [2019-01-12 23:30:46,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:46,743 INFO L93 Difference]: Finished difference Result 8049 states and 18198 transitions. [2019-01-12 23:30:46,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:30:46,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-12 23:30:46,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:46,761 INFO L225 Difference]: With dead ends: 8049 [2019-01-12 23:30:46,762 INFO L226 Difference]: Without dead ends: 8049 [2019-01-12 23:30:46,762 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:46,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8049 states. [2019-01-12 23:30:46,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8049 to 7228. [2019-01-12 23:30:46,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7228 states. [2019-01-12 23:30:46,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7228 states to 7228 states and 16216 transitions. [2019-01-12 23:30:46,905 INFO L78 Accepts]: Start accepts. Automaton has 7228 states and 16216 transitions. Word has length 94 [2019-01-12 23:30:46,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:46,905 INFO L480 AbstractCegarLoop]: Abstraction has 7228 states and 16216 transitions. [2019-01-12 23:30:46,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:30:46,905 INFO L276 IsEmpty]: Start isEmpty. Operand 7228 states and 16216 transitions. [2019-01-12 23:30:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:46,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:46,922 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:46,922 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:46,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:46,923 INFO L82 PathProgramCache]: Analyzing trace with hash 542381867, now seen corresponding path program 1 times [2019-01-12 23:30:46,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:46,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:46,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:46,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:46,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:47,725 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:47,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:47,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:30:47,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:30:47,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:30:47,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:47,726 INFO L87 Difference]: Start difference. First operand 7228 states and 16216 transitions. Second operand 7 states. [2019-01-12 23:30:48,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:48,345 INFO L93 Difference]: Finished difference Result 9206 states and 20445 transitions. [2019-01-12 23:30:48,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 23:30:48,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-12 23:30:48,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:48,357 INFO L225 Difference]: With dead ends: 9206 [2019-01-12 23:30:48,357 INFO L226 Difference]: Without dead ends: 9140 [2019-01-12 23:30:48,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-01-12 23:30:48,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9140 states. [2019-01-12 23:30:48,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9140 to 7429. [2019-01-12 23:30:48,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7429 states. [2019-01-12 23:30:48,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7429 states to 7429 states and 16659 transitions. [2019-01-12 23:30:48,437 INFO L78 Accepts]: Start accepts. Automaton has 7429 states and 16659 transitions. Word has length 94 [2019-01-12 23:30:48,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:48,437 INFO L480 AbstractCegarLoop]: Abstraction has 7429 states and 16659 transitions. [2019-01-12 23:30:48,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:30:48,438 INFO L276 IsEmpty]: Start isEmpty. Operand 7429 states and 16659 transitions. [2019-01-12 23:30:48,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:48,445 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:48,445 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:48,445 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:48,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:48,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1056970698, now seen corresponding path program 1 times [2019-01-12 23:30:48,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:48,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:48,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:48,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:48,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:48,695 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:48,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:48,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:30:48,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:30:48,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:30:48,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:48,697 INFO L87 Difference]: Start difference. First operand 7429 states and 16659 transitions. Second operand 7 states. [2019-01-12 23:30:49,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:49,153 INFO L93 Difference]: Finished difference Result 10300 states and 23079 transitions. [2019-01-12 23:30:49,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 23:30:49,154 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-12 23:30:49,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:49,165 INFO L225 Difference]: With dead ends: 10300 [2019-01-12 23:30:49,165 INFO L226 Difference]: Without dead ends: 10268 [2019-01-12 23:30:49,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-12 23:30:49,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10268 states. [2019-01-12 23:30:49,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10268 to 9038. [2019-01-12 23:30:49,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9038 states. [2019-01-12 23:30:49,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9038 states to 9038 states and 20122 transitions. [2019-01-12 23:30:49,259 INFO L78 Accepts]: Start accepts. Automaton has 9038 states and 20122 transitions. Word has length 94 [2019-01-12 23:30:49,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:49,260 INFO L480 AbstractCegarLoop]: Abstraction has 9038 states and 20122 transitions. [2019-01-12 23:30:49,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:30:49,260 INFO L276 IsEmpty]: Start isEmpty. Operand 9038 states and 20122 transitions. [2019-01-12 23:30:49,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:49,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:49,268 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:49,268 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:49,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:49,269 INFO L82 PathProgramCache]: Analyzing trace with hash -739980661, now seen corresponding path program 1 times [2019-01-12 23:30:49,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:49,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:49,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:49,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:49,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:49,532 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:49,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:49,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 23:30:49,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 23:30:49,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 23:30:49,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:30:49,534 INFO L87 Difference]: Start difference. First operand 9038 states and 20122 transitions. Second operand 8 states. [2019-01-12 23:30:50,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:50,248 INFO L93 Difference]: Finished difference Result 13894 states and 31745 transitions. [2019-01-12 23:30:50,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 23:30:50,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-01-12 23:30:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:50,265 INFO L225 Difference]: With dead ends: 13894 [2019-01-12 23:30:50,265 INFO L226 Difference]: Without dead ends: 13894 [2019-01-12 23:30:50,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-01-12 23:30:50,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13894 states. [2019-01-12 23:30:50,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13894 to 9725. [2019-01-12 23:30:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9725 states. [2019-01-12 23:30:50,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9725 states to 9725 states and 21894 transitions. [2019-01-12 23:30:50,381 INFO L78 Accepts]: Start accepts. Automaton has 9725 states and 21894 transitions. Word has length 94 [2019-01-12 23:30:50,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:50,381 INFO L480 AbstractCegarLoop]: Abstraction has 9725 states and 21894 transitions. [2019-01-12 23:30:50,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 23:30:50,381 INFO L276 IsEmpty]: Start isEmpty. Operand 9725 states and 21894 transitions. [2019-01-12 23:30:50,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:50,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:50,390 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:50,391 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:50,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:50,391 INFO L82 PathProgramCache]: Analyzing trace with hash 147523020, now seen corresponding path program 1 times [2019-01-12 23:30:50,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:50,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:50,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:50,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:50,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:50,755 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:50,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:50,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:30:50,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:30:50,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:30:50,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:50,757 INFO L87 Difference]: Start difference. First operand 9725 states and 21894 transitions. Second operand 7 states. [2019-01-12 23:30:51,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:51,212 INFO L93 Difference]: Finished difference Result 11456 states and 25577 transitions. [2019-01-12 23:30:51,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 23:30:51,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-12 23:30:51,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:51,226 INFO L225 Difference]: With dead ends: 11456 [2019-01-12 23:30:51,227 INFO L226 Difference]: Without dead ends: 11456 [2019-01-12 23:30:51,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-01-12 23:30:51,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11456 states. [2019-01-12 23:30:51,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11456 to 9707. [2019-01-12 23:30:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9707 states. [2019-01-12 23:30:51,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9707 states to 9707 states and 21847 transitions. [2019-01-12 23:30:51,325 INFO L78 Accepts]: Start accepts. Automaton has 9707 states and 21847 transitions. Word has length 94 [2019-01-12 23:30:51,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:51,325 INFO L480 AbstractCegarLoop]: Abstraction has 9707 states and 21847 transitions. [2019-01-12 23:30:51,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:30:51,325 INFO L276 IsEmpty]: Start isEmpty. Operand 9707 states and 21847 transitions. [2019-01-12 23:30:51,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:51,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:51,334 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:51,335 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:51,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:51,335 INFO L82 PathProgramCache]: Analyzing trace with hash 553697994, now seen corresponding path program 1 times [2019-01-12 23:30:51,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:51,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:51,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:51,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:51,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:51,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 23:30:51,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:51,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 23:30:51,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 23:30:51,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 23:30:51,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:30:51,602 INFO L87 Difference]: Start difference. First operand 9707 states and 21847 transitions. Second operand 9 states. [2019-01-12 23:30:52,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:52,311 INFO L93 Difference]: Finished difference Result 12151 states and 27464 transitions. [2019-01-12 23:30:52,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 23:30:52,313 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-01-12 23:30:52,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:52,326 INFO L225 Difference]: With dead ends: 12151 [2019-01-12 23:30:52,326 INFO L226 Difference]: Without dead ends: 12119 [2019-01-12 23:30:52,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-01-12 23:30:52,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12119 states. [2019-01-12 23:30:52,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12119 to 9180. [2019-01-12 23:30:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9180 states. [2019-01-12 23:30:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9180 states to 9180 states and 20654 transitions. [2019-01-12 23:30:52,433 INFO L78 Accepts]: Start accepts. Automaton has 9180 states and 20654 transitions. Word has length 94 [2019-01-12 23:30:52,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:52,433 INFO L480 AbstractCegarLoop]: Abstraction has 9180 states and 20654 transitions. [2019-01-12 23:30:52,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 23:30:52,434 INFO L276 IsEmpty]: Start isEmpty. Operand 9180 states and 20654 transitions. [2019-01-12 23:30:52,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:52,442 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:52,442 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:52,442 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:52,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:52,443 INFO L82 PathProgramCache]: Analyzing trace with hash -355749684, now seen corresponding path program 1 times [2019-01-12 23:30:52,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:52,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:52,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:52,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:52,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:52,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:52,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:52,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:30:52,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:30:52,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:30:52,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:52,667 INFO L87 Difference]: Start difference. First operand 9180 states and 20654 transitions. Second operand 7 states. [2019-01-12 23:30:52,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:52,877 INFO L93 Difference]: Finished difference Result 12433 states and 28468 transitions. [2019-01-12 23:30:52,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:30:52,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-12 23:30:52,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:52,892 INFO L225 Difference]: With dead ends: 12433 [2019-01-12 23:30:52,893 INFO L226 Difference]: Without dead ends: 12433 [2019-01-12 23:30:52,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-12 23:30:52,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12433 states. [2019-01-12 23:30:53,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12433 to 8813. [2019-01-12 23:30:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8813 states. [2019-01-12 23:30:53,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8813 states to 8813 states and 19726 transitions. [2019-01-12 23:30:53,022 INFO L78 Accepts]: Start accepts. Automaton has 8813 states and 19726 transitions. Word has length 94 [2019-01-12 23:30:53,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:53,022 INFO L480 AbstractCegarLoop]: Abstraction has 8813 states and 19726 transitions. [2019-01-12 23:30:53,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:30:53,023 INFO L276 IsEmpty]: Start isEmpty. Operand 8813 states and 19726 transitions. [2019-01-12 23:30:53,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:30:53,032 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:53,033 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:53,033 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:53,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:53,033 INFO L82 PathProgramCache]: Analyzing trace with hash -2087725236, now seen corresponding path program 1 times [2019-01-12 23:30:53,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:53,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:53,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:53,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:53,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:53,261 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:53,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:53,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:30:53,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:30:53,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:30:53,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:30:53,263 INFO L87 Difference]: Start difference. First operand 8813 states and 19726 transitions. Second operand 6 states. [2019-01-12 23:30:53,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:53,423 INFO L93 Difference]: Finished difference Result 8333 states and 18270 transitions. [2019-01-12 23:30:53,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:30:53,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-12 23:30:53,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:53,435 INFO L225 Difference]: With dead ends: 8333 [2019-01-12 23:30:53,435 INFO L226 Difference]: Without dead ends: 8333 [2019-01-12 23:30:53,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:30:53,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8333 states. [2019-01-12 23:30:53,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8333 to 5655. [2019-01-12 23:30:53,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5655 states. [2019-01-12 23:30:53,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5655 states to 5655 states and 12316 transitions. [2019-01-12 23:30:53,529 INFO L78 Accepts]: Start accepts. Automaton has 5655 states and 12316 transitions. Word has length 94 [2019-01-12 23:30:53,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:53,530 INFO L480 AbstractCegarLoop]: Abstraction has 5655 states and 12316 transitions. [2019-01-12 23:30:53,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:30:53,530 INFO L276 IsEmpty]: Start isEmpty. Operand 5655 states and 12316 transitions. [2019-01-12 23:30:53,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:30:53,537 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:53,537 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:53,537 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:53,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:53,537 INFO L82 PathProgramCache]: Analyzing trace with hash 736311241, now seen corresponding path program 1 times [2019-01-12 23:30:53,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:53,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:53,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:53,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:53,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:53,810 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:53,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:53,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 23:30:53,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 23:30:53,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 23:30:53,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:30:53,811 INFO L87 Difference]: Start difference. First operand 5655 states and 12316 transitions. Second operand 8 states. [2019-01-12 23:30:54,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:54,648 INFO L93 Difference]: Finished difference Result 7376 states and 16096 transitions. [2019-01-12 23:30:54,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 23:30:54,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-01-12 23:30:54,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:54,658 INFO L225 Difference]: With dead ends: 7376 [2019-01-12 23:30:54,658 INFO L226 Difference]: Without dead ends: 7344 [2019-01-12 23:30:54,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2019-01-12 23:30:54,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7344 states. [2019-01-12 23:30:54,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7344 to 5797. [2019-01-12 23:30:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5797 states. [2019-01-12 23:30:54,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5797 states to 5797 states and 12624 transitions. [2019-01-12 23:30:54,722 INFO L78 Accepts]: Start accepts. Automaton has 5797 states and 12624 transitions. Word has length 96 [2019-01-12 23:30:54,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:54,722 INFO L480 AbstractCegarLoop]: Abstraction has 5797 states and 12624 transitions. [2019-01-12 23:30:54,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 23:30:54,723 INFO L276 IsEmpty]: Start isEmpty. Operand 5797 states and 12624 transitions. [2019-01-12 23:30:54,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:30:54,729 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:54,729 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:54,729 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:54,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:54,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1340898102, now seen corresponding path program 1 times [2019-01-12 23:30:54,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:54,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:54,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:54,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:54,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:55,013 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:55,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:55,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:30:55,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:30:55,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:30:55,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:30:55,015 INFO L87 Difference]: Start difference. First operand 5797 states and 12624 transitions. Second operand 7 states. [2019-01-12 23:30:55,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:55,291 INFO L93 Difference]: Finished difference Result 6320 states and 13791 transitions. [2019-01-12 23:30:55,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:30:55,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-01-12 23:30:55,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:55,299 INFO L225 Difference]: With dead ends: 6320 [2019-01-12 23:30:55,300 INFO L226 Difference]: Without dead ends: 6320 [2019-01-12 23:30:55,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-12 23:30:55,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6320 states. [2019-01-12 23:30:55,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6320 to 6154. [2019-01-12 23:30:55,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6154 states. [2019-01-12 23:30:55,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6154 states to 6154 states and 13459 transitions. [2019-01-12 23:30:55,357 INFO L78 Accepts]: Start accepts. Automaton has 6154 states and 13459 transitions. Word has length 96 [2019-01-12 23:30:55,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:55,357 INFO L480 AbstractCegarLoop]: Abstraction has 6154 states and 13459 transitions. [2019-01-12 23:30:55,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:30:55,357 INFO L276 IsEmpty]: Start isEmpty. Operand 6154 states and 13459 transitions. [2019-01-12 23:30:55,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:30:55,363 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:55,363 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:55,363 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:55,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:55,364 INFO L82 PathProgramCache]: Analyzing trace with hash -453394421, now seen corresponding path program 1 times [2019-01-12 23:30:55,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:55,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:55,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:55,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:55,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:55,678 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-12 23:30:55,843 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 23:30:57,123 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:57,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:57,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-12 23:30:57,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 23:30:57,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 23:30:57,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-12 23:30:57,125 INFO L87 Difference]: Start difference. First operand 6154 states and 13459 transitions. Second operand 11 states. [2019-01-12 23:30:57,715 WARN L181 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-01-12 23:30:59,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:59,318 INFO L93 Difference]: Finished difference Result 11273 states and 24993 transitions. [2019-01-12 23:30:59,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 23:30:59,319 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-01-12 23:30:59,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:59,328 INFO L225 Difference]: With dead ends: 11273 [2019-01-12 23:30:59,328 INFO L226 Difference]: Without dead ends: 7253 [2019-01-12 23:30:59,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-01-12 23:30:59,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7253 states. [2019-01-12 23:30:59,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7253 to 5499. [2019-01-12 23:30:59,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5499 states. [2019-01-12 23:30:59,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5499 states to 5499 states and 12005 transitions. [2019-01-12 23:30:59,384 INFO L78 Accepts]: Start accepts. Automaton has 5499 states and 12005 transitions. Word has length 96 [2019-01-12 23:30:59,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:59,384 INFO L480 AbstractCegarLoop]: Abstraction has 5499 states and 12005 transitions. [2019-01-12 23:30:59,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 23:30:59,385 INFO L276 IsEmpty]: Start isEmpty. Operand 5499 states and 12005 transitions. [2019-01-12 23:30:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:30:59,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:59,390 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:59,390 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:59,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:59,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1711267723, now seen corresponding path program 2 times [2019-01-12 23:30:59,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:59,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:59,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:59,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:59,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 23:30:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 23:30:59,473 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 23:30:59,685 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-12 23:30:59,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:30:59 BasicIcfg [2019-01-12 23:30:59,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 23:30:59,691 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 23:30:59,691 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 23:30:59,692 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 23:30:59,694 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:30:14" (3/4) ... [2019-01-12 23:30:59,699 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 23:30:59,939 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 23:30:59,942 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 23:30:59,943 INFO L168 Benchmark]: Toolchain (without parser) took 47487.46 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 948.7 MB in the beginning and 1.8 GB in the end (delta: -878.3 MB). Peak memory consumption was 905.3 MB. Max. memory is 11.5 GB. [2019-01-12 23:30:59,943 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 23:30:59,947 INFO L168 Benchmark]: CACSL2BoogieTranslator took 894.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2019-01-12 23:30:59,947 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.16 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-12 23:30:59,948 INFO L168 Benchmark]: Boogie Preprocessor took 43.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:59,948 INFO L168 Benchmark]: RCFGBuilder took 1143.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 11.5 GB. [2019-01-12 23:30:59,948 INFO L168 Benchmark]: TraceAbstraction took 45074.02 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -800.7 MB). Peak memory consumption was 844.5 MB. Max. memory is 11.5 GB. [2019-01-12 23:30:59,949 INFO L168 Benchmark]: Witness Printer took 250.73 ms. Allocated memory is still 2.8 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. [2019-01-12 23:30:59,960 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 894.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.16 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.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 1143.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 45074.02 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -800.7 MB). Peak memory consumption was 844.5 MB. Max. memory is 11.5 GB. * Witness Printer took 250.73 ms. Allocated memory is still 2.8 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 36.1 MB). Peak memory consumption was 36.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 t315; 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(&t315, ((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 t316; 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(&t316, ((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, 44.8s OverallTime, 35 OverallIterations, 1 TraceHistogramMax, 22.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8933 SDtfs, 9480 SDslu, 21136 SDs, 0 SdLazy, 9057 SolverSat, 446 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 354 GetRequests, 82 SyntacticMatches, 37 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35808occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 85368 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 2698 NumberOfCodeBlocks, 2698 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2568 ConstructedInterpolants, 0 QuantifiedInterpolants, 614570 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...