./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi001_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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/rfi001_rmo.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 955a7462776db711df9d88fc8b0a22926f6ecdd0 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-2e94e6a [2018-12-31 22:47:42,440 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 22:47:42,442 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 22:47:42,454 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 22:47:42,454 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 22:47:42,455 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 22:47:42,457 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 22:47:42,459 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 22:47:42,461 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 22:47:42,462 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 22:47:42,463 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 22:47:42,463 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 22:47:42,464 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 22:47:42,465 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 22:47:42,467 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 22:47:42,467 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 22:47:42,468 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 22:47:42,470 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 22:47:42,473 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 22:47:42,474 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 22:47:42,476 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 22:47:42,477 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 22:47:42,480 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 22:47:42,480 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 22:47:42,480 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 22:47:42,481 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 22:47:42,482 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 22:47:42,484 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 22:47:42,485 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 22:47:42,486 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 22:47:42,486 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 22:47:42,487 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 22:47:42,487 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 22:47:42,488 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 22:47:42,489 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 22:47:42,490 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 22:47:42,490 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 22:47:42,518 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 22:47:42,518 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 22:47:42,523 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 22:47:42,523 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 22:47:42,523 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 22:47:42,524 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 22:47:42,524 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 22:47:42,524 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 22:47:42,524 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 22:47:42,524 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 22:47:42,525 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 22:47:42,525 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 22:47:42,525 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 22:47:42,525 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 22:47:42,525 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 22:47:42,525 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 22:47:42,526 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 22:47:42,526 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 22:47:42,526 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 22:47:42,526 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 22:47:42,526 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 22:47:42,526 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 22:47:42,528 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 22:47:42,528 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 22:47:42,528 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 22:47:42,529 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 22:47:42,529 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 22:47:42,529 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 22:47:42,529 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 -> 955a7462776db711df9d88fc8b0a22926f6ecdd0 [2018-12-31 22:47:42,564 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 22:47:42,577 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 22:47:42,580 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 22:47:42,582 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 22:47:42,582 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 22:47:42,583 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi001_rmo.opt_false-unreach-call.i [2018-12-31 22:47:42,640 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dc768929/b37e8eaab98d4a5fa7af6f76ee99878d/FLAG457cf6d49 [2018-12-31 22:47:43,151 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 22:47:43,152 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi001_rmo.opt_false-unreach-call.i [2018-12-31 22:47:43,176 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dc768929/b37e8eaab98d4a5fa7af6f76ee99878d/FLAG457cf6d49 [2018-12-31 22:47:43,437 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dc768929/b37e8eaab98d4a5fa7af6f76ee99878d [2018-12-31 22:47:43,440 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 22:47:43,442 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 22:47:43,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 22:47:43,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 22:47:43,447 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 22:47:43,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:47:43" (1/1) ... [2018-12-31 22:47:43,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556facdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:43, skipping insertion in model container [2018-12-31 22:47:43,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:47:43" (1/1) ... [2018-12-31 22:47:43,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 22:47:43,515 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 22:47:44,018 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:47:44,034 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 22:47:44,202 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:47:44,285 INFO L195 MainTranslator]: Completed translation [2018-12-31 22:47:44,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:44 WrapperNode [2018-12-31 22:47:44,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 22:47:44,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 22:47:44,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 22:47:44,287 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 22:47:44,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:44" (1/1) ... [2018-12-31 22:47:44,327 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:44" (1/1) ... [2018-12-31 22:47:44,365 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 22:47:44,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 22:47:44,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 22:47:44,366 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 22:47:44,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:44" (1/1) ... [2018-12-31 22:47:44,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:44" (1/1) ... [2018-12-31 22:47:44,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:44" (1/1) ... [2018-12-31 22:47:44,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:44" (1/1) ... [2018-12-31 22:47:44,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:44" (1/1) ... [2018-12-31 22:47:44,399 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:44" (1/1) ... [2018-12-31 22:47:44,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:44" (1/1) ... [2018-12-31 22:47:44,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 22:47:44,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 22:47:44,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 22:47:44,409 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 22:47:44,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 22:47:44,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 22:47:44,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 22:47:44,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 22:47:44,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 22:47:44,485 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 22:47:44,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 22:47:44,485 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 22:47:44,486 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 22:47:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 22:47:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 22:47:44,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 22:47:44,488 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 22:47:45,638 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 22:47:45,638 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 22:47:45,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:47:45 BoogieIcfgContainer [2018-12-31 22:47:45,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 22:47:45,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 22:47:45,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 22:47:45,646 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 22:47:45,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:47:43" (1/3) ... [2018-12-31 22:47:45,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4c4075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:47:45, skipping insertion in model container [2018-12-31 22:47:45,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:47:44" (2/3) ... [2018-12-31 22:47:45,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4c4075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:47:45, skipping insertion in model container [2018-12-31 22:47:45,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:47:45" (3/3) ... [2018-12-31 22:47:45,651 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_rmo.opt_false-unreach-call.i [2018-12-31 22:47:45,697 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,697 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,697 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,697 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,698 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,698 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,698 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,699 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,699 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,699 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,700 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,700 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,700 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,700 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,701 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,701 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,701 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,701 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,703 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,703 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,703 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,710 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,710 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,711 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,711 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,711 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,711 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,715 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,715 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,715 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,715 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,715 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:47:45,733 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 22:47:45,733 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 22:47:45,741 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 22:47:45,759 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 22:47:45,787 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 22:47:45,788 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 22:47:45,788 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 22:47:45,788 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 22:47:45,788 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 22:47:45,788 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 22:47:45,788 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 22:47:45,788 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 22:47:45,789 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 22:47:45,803 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-31 22:47:47,221 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2018-12-31 22:47:47,224 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2018-12-31 22:47:47,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 22:47:47,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:47,234 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] [2018-12-31 22:47:47,237 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:47,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:47,244 INFO L82 PathProgramCache]: Analyzing trace with hash 2006103772, now seen corresponding path program 1 times [2018-12-31 22:47:47,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:47,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:47,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:47,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:47,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:47,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:47,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:47:47,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:47:47,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:47:47,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:47:47,646 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2018-12-31 22:47:48,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:48,676 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2018-12-31 22:47:48,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:47:48,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-31 22:47:48,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:48,981 INFO L225 Difference]: With dead ends: 45389 [2018-12-31 22:47:48,981 INFO L226 Difference]: Without dead ends: 40629 [2018-12-31 22:47:48,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:47:49,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2018-12-31 22:47:50,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2018-12-31 22:47:50,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-31 22:47:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2018-12-31 22:47:50,726 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2018-12-31 22:47:50,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:50,727 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2018-12-31 22:47:50,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:47:50,727 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2018-12-31 22:47:50,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 22:47:50,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:50,744 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:47:50,744 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:50,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:50,745 INFO L82 PathProgramCache]: Analyzing trace with hash 455349977, now seen corresponding path program 1 times [2018-12-31 22:47:50,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:50,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:50,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:50,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:50,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:51,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:51,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:51,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:47:51,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:47:51,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:47:51,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:47:51,056 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 5 states. [2018-12-31 22:47:54,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:54,770 INFO L93 Difference]: Finished difference Result 64831 states and 241370 transitions. [2018-12-31 22:47:54,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:47:54,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-31 22:47:54,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:55,040 INFO L225 Difference]: With dead ends: 64831 [2018-12-31 22:47:55,040 INFO L226 Difference]: Without dead ends: 64671 [2018-12-31 22:47:55,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:47:55,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2018-12-31 22:47:56,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2018-12-31 22:47:56,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-31 22:47:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 138285 transitions. [2018-12-31 22:47:56,833 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 138285 transitions. Word has length 45 [2018-12-31 22:47:56,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:47:56,835 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 138285 transitions. [2018-12-31 22:47:56,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:47:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 138285 transitions. [2018-12-31 22:47:56,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 22:47:56,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:47:56,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:47:56,841 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:47:56,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:47:56,841 INFO L82 PathProgramCache]: Analyzing trace with hash -636463316, now seen corresponding path program 1 times [2018-12-31 22:47:56,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:47:56,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:47:56,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:56,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:47:56,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:47:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:47:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:47:56,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:47:56,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:47:56,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:47:56,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:47:56,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:47:56,970 INFO L87 Difference]: Start difference. First operand 37143 states and 138285 transitions. Second operand 5 states. [2018-12-31 22:47:57,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:47:57,789 INFO L93 Difference]: Finished difference Result 66627 states and 246624 transitions. [2018-12-31 22:47:57,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:47:57,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-31 22:47:57,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:47:58,027 INFO L225 Difference]: With dead ends: 66627 [2018-12-31 22:47:58,027 INFO L226 Difference]: Without dead ends: 66459 [2018-12-31 22:47:58,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:47:58,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66459 states. [2018-12-31 22:48:00,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66459 to 38835. [2018-12-31 22:48:00,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38835 states. [2018-12-31 22:48:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38835 states to 38835 states and 143993 transitions. [2018-12-31 22:48:00,131 INFO L78 Accepts]: Start accepts. Automaton has 38835 states and 143993 transitions. Word has length 46 [2018-12-31 22:48:00,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:00,132 INFO L480 AbstractCegarLoop]: Abstraction has 38835 states and 143993 transitions. [2018-12-31 22:48:00,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:00,132 INFO L276 IsEmpty]: Start isEmpty. Operand 38835 states and 143993 transitions. [2018-12-31 22:48:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 22:48:00,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:00,145 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] [2018-12-31 22:48:00,145 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:00,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:00,145 INFO L82 PathProgramCache]: Analyzing trace with hash -921353383, now seen corresponding path program 1 times [2018-12-31 22:48:00,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:00,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:00,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:00,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:00,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:00,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:00,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:00,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:00,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:00,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:00,317 INFO L87 Difference]: Start difference. First operand 38835 states and 143993 transitions. Second operand 6 states. [2018-12-31 22:48:01,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:01,782 INFO L93 Difference]: Finished difference Result 68209 states and 246840 transitions. [2018-12-31 22:48:01,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 22:48:01,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-31 22:48:01,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:01,965 INFO L225 Difference]: With dead ends: 68209 [2018-12-31 22:48:01,965 INFO L226 Difference]: Without dead ends: 68049 [2018-12-31 22:48:01,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-12-31 22:48:03,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68049 states. [2018-12-31 22:48:03,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68049 to 37685. [2018-12-31 22:48:03,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37685 states. [2018-12-31 22:48:04,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37685 states to 37685 states and 139753 transitions. [2018-12-31 22:48:04,036 INFO L78 Accepts]: Start accepts. Automaton has 37685 states and 139753 transitions. Word has length 53 [2018-12-31 22:48:04,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:04,037 INFO L480 AbstractCegarLoop]: Abstraction has 37685 states and 139753 transitions. [2018-12-31 22:48:04,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:04,037 INFO L276 IsEmpty]: Start isEmpty. Operand 37685 states and 139753 transitions. [2018-12-31 22:48:04,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-31 22:48:04,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:04,073 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:04,073 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:04,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:04,074 INFO L82 PathProgramCache]: Analyzing trace with hash 479415254, now seen corresponding path program 1 times [2018-12-31 22:48:04,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:04,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:04,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:04,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:04,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:04,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:04,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:04,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:04,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:04,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:04,235 INFO L87 Difference]: Start difference. First operand 37685 states and 139753 transitions. Second operand 6 states. [2018-12-31 22:48:05,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:05,230 INFO L93 Difference]: Finished difference Result 80345 states and 292574 transitions. [2018-12-31 22:48:05,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 22:48:05,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-31 22:48:05,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:05,453 INFO L225 Difference]: With dead ends: 80345 [2018-12-31 22:48:05,453 INFO L226 Difference]: Without dead ends: 80089 [2018-12-31 22:48:05,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-31 22:48:05,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80089 states. [2018-12-31 22:48:09,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80089 to 44758. [2018-12-31 22:48:09,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44758 states. [2018-12-31 22:48:10,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44758 states to 44758 states and 164072 transitions. [2018-12-31 22:48:10,091 INFO L78 Accepts]: Start accepts. Automaton has 44758 states and 164072 transitions. Word has length 60 [2018-12-31 22:48:10,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:10,092 INFO L480 AbstractCegarLoop]: Abstraction has 44758 states and 164072 transitions. [2018-12-31 22:48:10,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:10,092 INFO L276 IsEmpty]: Start isEmpty. Operand 44758 states and 164072 transitions. [2018-12-31 22:48:10,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-31 22:48:10,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:10,134 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] [2018-12-31 22:48:10,134 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:10,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:10,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1962483643, now seen corresponding path program 1 times [2018-12-31 22:48:10,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:10,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:10,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:10,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:10,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:10,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:10,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:10,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:48:10,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:48:10,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:48:10,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:48:10,250 INFO L87 Difference]: Start difference. First operand 44758 states and 164072 transitions. Second operand 3 states. [2018-12-31 22:48:10,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:10,603 INFO L93 Difference]: Finished difference Result 56320 states and 202934 transitions. [2018-12-31 22:48:10,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:48:10,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-12-31 22:48:10,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:10,750 INFO L225 Difference]: With dead ends: 56320 [2018-12-31 22:48:10,750 INFO L226 Difference]: Without dead ends: 56320 [2018-12-31 22:48:10,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:48:10,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56320 states. [2018-12-31 22:48:11,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56320 to 48991. [2018-12-31 22:48:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48991 states. [2018-12-31 22:48:11,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48991 states to 48991 states and 178474 transitions. [2018-12-31 22:48:11,904 INFO L78 Accepts]: Start accepts. Automaton has 48991 states and 178474 transitions. Word has length 62 [2018-12-31 22:48:11,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:11,905 INFO L480 AbstractCegarLoop]: Abstraction has 48991 states and 178474 transitions. [2018-12-31 22:48:11,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:48:11,905 INFO L276 IsEmpty]: Start isEmpty. Operand 48991 states and 178474 transitions. [2018-12-31 22:48:11,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 22:48:11,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:11,950 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:11,950 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:11,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:11,950 INFO L82 PathProgramCache]: Analyzing trace with hash 671786436, now seen corresponding path program 1 times [2018-12-31 22:48:11,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:11,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:11,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:11,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:11,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:12,501 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 16 [2018-12-31 22:48:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:12,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:12,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:48:12,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:48:12,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:48:12,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:12,528 INFO L87 Difference]: Start difference. First operand 48991 states and 178474 transitions. Second operand 5 states. [2018-12-31 22:48:14,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:14,586 INFO L93 Difference]: Finished difference Result 82728 states and 297581 transitions. [2018-12-31 22:48:14,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:48:14,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-31 22:48:14,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:14,842 INFO L225 Difference]: With dead ends: 82728 [2018-12-31 22:48:14,842 INFO L226 Difference]: Without dead ends: 82570 [2018-12-31 22:48:14,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:15,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82570 states. [2018-12-31 22:48:16,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82570 to 75015. [2018-12-31 22:48:16,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75015 states. [2018-12-31 22:48:16,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75015 states to 75015 states and 271535 transitions. [2018-12-31 22:48:16,683 INFO L78 Accepts]: Start accepts. Automaton has 75015 states and 271535 transitions. Word has length 66 [2018-12-31 22:48:16,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:16,683 INFO L480 AbstractCegarLoop]: Abstraction has 75015 states and 271535 transitions. [2018-12-31 22:48:16,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:16,683 INFO L276 IsEmpty]: Start isEmpty. Operand 75015 states and 271535 transitions. [2018-12-31 22:48:16,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 22:48:16,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:16,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:16,753 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:16,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:16,753 INFO L82 PathProgramCache]: Analyzing trace with hash 817342501, now seen corresponding path program 1 times [2018-12-31 22:48:16,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:16,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:16,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:16,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:16,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:17,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:17,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:17,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:48:17,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:48:17,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:48:17,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:17,295 INFO L87 Difference]: Start difference. First operand 75015 states and 271535 transitions. Second operand 7 states. [2018-12-31 22:48:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:19,187 INFO L93 Difference]: Finished difference Result 134875 states and 481034 transitions. [2018-12-31 22:48:19,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 22:48:19,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-12-31 22:48:19,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:19,565 INFO L225 Difference]: With dead ends: 134875 [2018-12-31 22:48:19,565 INFO L226 Difference]: Without dead ends: 134619 [2018-12-31 22:48:19,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-12-31 22:48:21,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134619 states. [2018-12-31 22:48:22,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134619 to 77027. [2018-12-31 22:48:22,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77027 states. [2018-12-31 22:48:22,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77027 states to 77027 states and 278041 transitions. [2018-12-31 22:48:22,437 INFO L78 Accepts]: Start accepts. Automaton has 77027 states and 278041 transitions. Word has length 66 [2018-12-31 22:48:22,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:22,438 INFO L480 AbstractCegarLoop]: Abstraction has 77027 states and 278041 transitions. [2018-12-31 22:48:22,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:48:22,438 INFO L276 IsEmpty]: Start isEmpty. Operand 77027 states and 278041 transitions. [2018-12-31 22:48:22,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 22:48:22,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:22,501 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] [2018-12-31 22:48:22,501 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:22,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:22,502 INFO L82 PathProgramCache]: Analyzing trace with hash -911785883, now seen corresponding path program 1 times [2018-12-31 22:48:22,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:22,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:22,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:22,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:22,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:22,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:22,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:22,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:48:22,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:48:22,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:48:22,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:22,651 INFO L87 Difference]: Start difference. First operand 77027 states and 278041 transitions. Second operand 7 states. [2018-12-31 22:48:24,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:24,389 INFO L93 Difference]: Finished difference Result 103020 states and 368719 transitions. [2018-12-31 22:48:24,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 22:48:24,390 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2018-12-31 22:48:24,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:24,658 INFO L225 Difference]: With dead ends: 103020 [2018-12-31 22:48:24,658 INFO L226 Difference]: Without dead ends: 102804 [2018-12-31 22:48:24,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-12-31 22:48:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102804 states. [2018-12-31 22:48:27,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102804 to 77796. [2018-12-31 22:48:27,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77796 states. [2018-12-31 22:48:27,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77796 states to 77796 states and 280572 transitions. [2018-12-31 22:48:27,327 INFO L78 Accepts]: Start accepts. Automaton has 77796 states and 280572 transitions. Word has length 67 [2018-12-31 22:48:27,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:27,327 INFO L480 AbstractCegarLoop]: Abstraction has 77796 states and 280572 transitions. [2018-12-31 22:48:27,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:48:27,327 INFO L276 IsEmpty]: Start isEmpty. Operand 77796 states and 280572 transitions. [2018-12-31 22:48:27,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 22:48:27,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:27,405 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] [2018-12-31 22:48:27,405 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:27,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:27,405 INFO L82 PathProgramCache]: Analyzing trace with hash -140132620, now seen corresponding path program 1 times [2018-12-31 22:48:27,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:27,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:27,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:27,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:27,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:27,819 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2018-12-31 22:48:27,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:27,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:27,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:27,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:27,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:27,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:27,834 INFO L87 Difference]: Start difference. First operand 77796 states and 280572 transitions. Second operand 6 states. [2018-12-31 22:48:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:29,001 INFO L93 Difference]: Finished difference Result 101531 states and 363932 transitions. [2018-12-31 22:48:29,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:48:29,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-31 22:48:29,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:29,293 INFO L225 Difference]: With dead ends: 101531 [2018-12-31 22:48:29,293 INFO L226 Difference]: Without dead ends: 100339 [2018-12-31 22:48:29,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:48:29,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100339 states. [2018-12-31 22:48:30,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100339 to 87851. [2018-12-31 22:48:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87851 states. [2018-12-31 22:48:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87851 states to 87851 states and 317359 transitions. [2018-12-31 22:48:31,183 INFO L78 Accepts]: Start accepts. Automaton has 87851 states and 317359 transitions. Word has length 69 [2018-12-31 22:48:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:31,184 INFO L480 AbstractCegarLoop]: Abstraction has 87851 states and 317359 transitions. [2018-12-31 22:48:31,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:31,184 INFO L276 IsEmpty]: Start isEmpty. Operand 87851 states and 317359 transitions. [2018-12-31 22:48:31,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 22:48:31,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:31,285 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] [2018-12-31 22:48:31,285 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:31,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:31,286 INFO L82 PathProgramCache]: Analyzing trace with hash -423283084, now seen corresponding path program 1 times [2018-12-31 22:48:31,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:31,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:31,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:31,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:31,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:31,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:31,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:31,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:48:31,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:48:31,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:48:31,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:31,713 INFO L87 Difference]: Start difference. First operand 87851 states and 317359 transitions. Second operand 7 states. [2018-12-31 22:48:34,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:34,401 INFO L93 Difference]: Finished difference Result 117958 states and 415823 transitions. [2018-12-31 22:48:34,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 22:48:34,401 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-12-31 22:48:34,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:34,783 INFO L225 Difference]: With dead ends: 117958 [2018-12-31 22:48:34,783 INFO L226 Difference]: Without dead ends: 117958 [2018-12-31 22:48:34,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-31 22:48:35,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117958 states. [2018-12-31 22:48:36,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117958 to 108488. [2018-12-31 22:48:36,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108488 states. [2018-12-31 22:48:37,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108488 states to 108488 states and 385701 transitions. [2018-12-31 22:48:37,132 INFO L78 Accepts]: Start accepts. Automaton has 108488 states and 385701 transitions. Word has length 69 [2018-12-31 22:48:37,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:37,132 INFO L480 AbstractCegarLoop]: Abstraction has 108488 states and 385701 transitions. [2018-12-31 22:48:37,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:48:37,132 INFO L276 IsEmpty]: Start isEmpty. Operand 108488 states and 385701 transitions. [2018-12-31 22:48:37,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 22:48:37,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:37,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:37,245 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:37,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:37,245 INFO L82 PathProgramCache]: Analyzing trace with hash 821481397, now seen corresponding path program 1 times [2018-12-31 22:48:37,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:37,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:37,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:37,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:37,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:37,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:37,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:37,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:48:37,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:48:37,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:48:37,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:37,420 INFO L87 Difference]: Start difference. First operand 108488 states and 385701 transitions. Second operand 4 states. [2018-12-31 22:48:37,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:37,709 INFO L93 Difference]: Finished difference Result 33337 states and 107663 transitions. [2018-12-31 22:48:37,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:48:37,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2018-12-31 22:48:37,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:37,776 INFO L225 Difference]: With dead ends: 33337 [2018-12-31 22:48:37,777 INFO L226 Difference]: Without dead ends: 32796 [2018-12-31 22:48:37,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:37,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32796 states. [2018-12-31 22:48:38,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32796 to 32784. [2018-12-31 22:48:38,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32784 states. [2018-12-31 22:48:38,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32784 states to 32784 states and 106019 transitions. [2018-12-31 22:48:38,312 INFO L78 Accepts]: Start accepts. Automaton has 32784 states and 106019 transitions. Word has length 69 [2018-12-31 22:48:38,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:38,312 INFO L480 AbstractCegarLoop]: Abstraction has 32784 states and 106019 transitions. [2018-12-31 22:48:38,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:48:38,312 INFO L276 IsEmpty]: Start isEmpty. Operand 32784 states and 106019 transitions. [2018-12-31 22:48:38,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-31 22:48:38,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:38,349 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] [2018-12-31 22:48:38,349 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:38,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:38,350 INFO L82 PathProgramCache]: Analyzing trace with hash -228550946, now seen corresponding path program 1 times [2018-12-31 22:48:38,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:38,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:38,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:38,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:38,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:38,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:38,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:48:38,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:48:38,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:48:38,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:38,543 INFO L87 Difference]: Start difference. First operand 32784 states and 106019 transitions. Second operand 4 states. [2018-12-31 22:48:38,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:38,944 INFO L93 Difference]: Finished difference Result 41168 states and 131730 transitions. [2018-12-31 22:48:38,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:48:38,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-31 22:48:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:39,028 INFO L225 Difference]: With dead ends: 41168 [2018-12-31 22:48:39,028 INFO L226 Difference]: Without dead ends: 41168 [2018-12-31 22:48:39,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:39,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41168 states. [2018-12-31 22:48:39,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41168 to 33984. [2018-12-31 22:48:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33984 states. [2018-12-31 22:48:39,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33984 states to 33984 states and 109618 transitions. [2018-12-31 22:48:39,623 INFO L78 Accepts]: Start accepts. Automaton has 33984 states and 109618 transitions. Word has length 79 [2018-12-31 22:48:39,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:39,624 INFO L480 AbstractCegarLoop]: Abstraction has 33984 states and 109618 transitions. [2018-12-31 22:48:39,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:48:39,624 INFO L276 IsEmpty]: Start isEmpty. Operand 33984 states and 109618 transitions. [2018-12-31 22:48:39,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-31 22:48:39,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:39,660 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] [2018-12-31 22:48:39,662 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:39,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:39,662 INFO L82 PathProgramCache]: Analyzing trace with hash -483287491, now seen corresponding path program 1 times [2018-12-31 22:48:39,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:39,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:39,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:39,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:39,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:39,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:39,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:39,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 22:48:39,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 22:48:39,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 22:48:39,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-31 22:48:39,882 INFO L87 Difference]: Start difference. First operand 33984 states and 109618 transitions. Second operand 10 states. [2018-12-31 22:48:41,485 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-31 22:48:43,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:43,883 INFO L93 Difference]: Finished difference Result 42536 states and 133856 transitions. [2018-12-31 22:48:43,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-31 22:48:43,884 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2018-12-31 22:48:43,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:43,970 INFO L225 Difference]: With dead ends: 42536 [2018-12-31 22:48:43,970 INFO L226 Difference]: Without dead ends: 42472 [2018-12-31 22:48:43,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2018-12-31 22:48:44,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42472 states. [2018-12-31 22:48:44,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42472 to 30432. [2018-12-31 22:48:44,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30432 states. [2018-12-31 22:48:44,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30432 states to 30432 states and 98034 transitions. [2018-12-31 22:48:44,548 INFO L78 Accepts]: Start accepts. Automaton has 30432 states and 98034 transitions. Word has length 79 [2018-12-31 22:48:44,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:44,548 INFO L480 AbstractCegarLoop]: Abstraction has 30432 states and 98034 transitions. [2018-12-31 22:48:44,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 22:48:44,548 INFO L276 IsEmpty]: Start isEmpty. Operand 30432 states and 98034 transitions. [2018-12-31 22:48:44,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-31 22:48:44,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:44,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:44,583 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:44,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:44,584 INFO L82 PathProgramCache]: Analyzing trace with hash 509727806, now seen corresponding path program 1 times [2018-12-31 22:48:44,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:44,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:44,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:44,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:44,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:44,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:44,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:44,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:48:44,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:48:44,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:48:44,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:48:44,677 INFO L87 Difference]: Start difference. First operand 30432 states and 98034 transitions. Second operand 3 states. [2018-12-31 22:48:45,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:45,089 INFO L93 Difference]: Finished difference Result 32782 states and 105178 transitions. [2018-12-31 22:48:45,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:48:45,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-31 22:48:45,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:45,175 INFO L225 Difference]: With dead ends: 32782 [2018-12-31 22:48:45,175 INFO L226 Difference]: Without dead ends: 32782 [2018-12-31 22:48:45,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:48:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32782 states. [2018-12-31 22:48:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32782 to 31588. [2018-12-31 22:48:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31588 states. [2018-12-31 22:48:45,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31588 states to 31588 states and 101554 transitions. [2018-12-31 22:48:45,685 INFO L78 Accepts]: Start accepts. Automaton has 31588 states and 101554 transitions. Word has length 80 [2018-12-31 22:48:45,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:45,686 INFO L480 AbstractCegarLoop]: Abstraction has 31588 states and 101554 transitions. [2018-12-31 22:48:45,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:48:45,686 INFO L276 IsEmpty]: Start isEmpty. Operand 31588 states and 101554 transitions. [2018-12-31 22:48:45,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-31 22:48:45,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:45,716 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] [2018-12-31 22:48:45,716 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:45,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:45,716 INFO L82 PathProgramCache]: Analyzing trace with hash 723145821, now seen corresponding path program 1 times [2018-12-31 22:48:45,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:45,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:45,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:45,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:45,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:45,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:45,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:48:45,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:48:45,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:48:45,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:45,904 INFO L87 Difference]: Start difference. First operand 31588 states and 101554 transitions. Second operand 4 states. [2018-12-31 22:48:46,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:46,425 INFO L93 Difference]: Finished difference Result 37254 states and 118412 transitions. [2018-12-31 22:48:46,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:48:46,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-31 22:48:46,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:46,496 INFO L225 Difference]: With dead ends: 37254 [2018-12-31 22:48:46,496 INFO L226 Difference]: Without dead ends: 37190 [2018-12-31 22:48:46,496 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 [2018-12-31 22:48:46,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37190 states. [2018-12-31 22:48:46,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37190 to 35586. [2018-12-31 22:48:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35586 states. [2018-12-31 22:48:47,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35586 states to 35586 states and 113597 transitions. [2018-12-31 22:48:47,083 INFO L78 Accepts]: Start accepts. Automaton has 35586 states and 113597 transitions. Word has length 81 [2018-12-31 22:48:47,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:47,083 INFO L480 AbstractCegarLoop]: Abstraction has 35586 states and 113597 transitions. [2018-12-31 22:48:47,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:48:47,084 INFO L276 IsEmpty]: Start isEmpty. Operand 35586 states and 113597 transitions. [2018-12-31 22:48:47,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-31 22:48:47,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:47,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] [2018-12-31 22:48:47,119 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:47,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:47,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1212514466, now seen corresponding path program 1 times [2018-12-31 22:48:47,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:47,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:47,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:47,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:47,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:47,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:47,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:47,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:48:47,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:48:47,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:48:47,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:48:47,257 INFO L87 Difference]: Start difference. First operand 35586 states and 113597 transitions. Second operand 3 states. [2018-12-31 22:48:48,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:48,054 INFO L93 Difference]: Finished difference Result 38016 states and 120971 transitions. [2018-12-31 22:48:48,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:48:48,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-31 22:48:48,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:48,122 INFO L225 Difference]: With dead ends: 38016 [2018-12-31 22:48:48,122 INFO L226 Difference]: Without dead ends: 38016 [2018-12-31 22:48:48,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:48:48,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38016 states. [2018-12-31 22:48:48,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38016 to 36812. [2018-12-31 22:48:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36812 states. [2018-12-31 22:48:48,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36812 states to 36812 states and 117311 transitions. [2018-12-31 22:48:48,663 INFO L78 Accepts]: Start accepts. Automaton has 36812 states and 117311 transitions. Word has length 81 [2018-12-31 22:48:48,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:48,663 INFO L480 AbstractCegarLoop]: Abstraction has 36812 states and 117311 transitions. [2018-12-31 22:48:48,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:48:48,663 INFO L276 IsEmpty]: Start isEmpty. Operand 36812 states and 117311 transitions. [2018-12-31 22:48:48,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 22:48:48,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:48,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:48,705 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:48,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:48,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1773086822, now seen corresponding path program 1 times [2018-12-31 22:48:48,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:48,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:48,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:48,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:48,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:48,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:48,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:48,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:48,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:48,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:48,952 INFO L87 Difference]: Start difference. First operand 36812 states and 117311 transitions. Second operand 6 states. [2018-12-31 22:48:49,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:49,968 INFO L93 Difference]: Finished difference Result 51980 states and 162835 transitions. [2018-12-31 22:48:49,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:48:49,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-31 22:48:49,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:50,071 INFO L225 Difference]: With dead ends: 51980 [2018-12-31 22:48:50,071 INFO L226 Difference]: Without dead ends: 51352 [2018-12-31 22:48:50,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:48:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51352 states. [2018-12-31 22:48:50,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51352 to 40520. [2018-12-31 22:48:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40520 states. [2018-12-31 22:48:50,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40520 states to 40520 states and 129212 transitions. [2018-12-31 22:48:50,752 INFO L78 Accepts]: Start accepts. Automaton has 40520 states and 129212 transitions. Word has length 82 [2018-12-31 22:48:50,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:50,753 INFO L480 AbstractCegarLoop]: Abstraction has 40520 states and 129212 transitions. [2018-12-31 22:48:50,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:50,753 INFO L276 IsEmpty]: Start isEmpty. Operand 40520 states and 129212 transitions. [2018-12-31 22:48:50,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 22:48:50,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:50,794 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] [2018-12-31 22:48:50,794 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:50,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:50,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1489936358, now seen corresponding path program 1 times [2018-12-31 22:48:50,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:50,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:50,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:50,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:50,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:51,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:51,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:48:51,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:48:51,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:48:51,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:51,401 INFO L87 Difference]: Start difference. First operand 40520 states and 129212 transitions. Second operand 7 states. [2018-12-31 22:48:52,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:52,701 INFO L93 Difference]: Finished difference Result 66300 states and 204819 transitions. [2018-12-31 22:48:52,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 22:48:52,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-31 22:48:52,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:52,830 INFO L225 Difference]: With dead ends: 66300 [2018-12-31 22:48:52,830 INFO L226 Difference]: Without dead ends: 66188 [2018-12-31 22:48:52,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-12-31 22:48:52,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66188 states. [2018-12-31 22:48:53,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66188 to 42493. [2018-12-31 22:48:53,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42493 states. [2018-12-31 22:48:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42493 states to 42493 states and 133441 transitions. [2018-12-31 22:48:53,678 INFO L78 Accepts]: Start accepts. Automaton has 42493 states and 133441 transitions. Word has length 82 [2018-12-31 22:48:53,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:53,679 INFO L480 AbstractCegarLoop]: Abstraction has 42493 states and 133441 transitions. [2018-12-31 22:48:53,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:48:53,679 INFO L276 IsEmpty]: Start isEmpty. Operand 42493 states and 133441 transitions. [2018-12-31 22:48:53,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 22:48:53,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:53,722 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] [2018-12-31 22:48:53,722 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:53,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:53,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1230500696, now seen corresponding path program 1 times [2018-12-31 22:48:53,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:53,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:53,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:53,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:53,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:53,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:53,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:48:53,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:48:53,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:48:53,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:53,989 INFO L87 Difference]: Start difference. First operand 42493 states and 133441 transitions. Second operand 7 states. [2018-12-31 22:48:55,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:55,349 INFO L93 Difference]: Finished difference Result 78553 states and 242987 transitions. [2018-12-31 22:48:55,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 22:48:55,350 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-31 22:48:55,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:55,526 INFO L225 Difference]: With dead ends: 78553 [2018-12-31 22:48:55,527 INFO L226 Difference]: Without dead ends: 77625 [2018-12-31 22:48:55,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-31 22:48:55,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77625 states. [2018-12-31 22:48:56,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77625 to 45654. [2018-12-31 22:48:56,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45654 states. [2018-12-31 22:48:56,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45654 states to 45654 states and 142939 transitions. [2018-12-31 22:48:56,470 INFO L78 Accepts]: Start accepts. Automaton has 45654 states and 142939 transitions. Word has length 82 [2018-12-31 22:48:56,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:56,470 INFO L480 AbstractCegarLoop]: Abstraction has 45654 states and 142939 transitions. [2018-12-31 22:48:56,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:48:56,470 INFO L276 IsEmpty]: Start isEmpty. Operand 45654 states and 142939 transitions. [2018-12-31 22:48:56,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 22:48:56,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:56,515 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] [2018-12-31 22:48:56,516 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:56,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:56,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1180169000, now seen corresponding path program 1 times [2018-12-31 22:48:56,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:56,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:56,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:56,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:56,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:56,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:56,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:56,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 22:48:56,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 22:48:56,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 22:48:56,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:48:56,908 INFO L87 Difference]: Start difference. First operand 45654 states and 142939 transitions. Second operand 8 states. [2018-12-31 22:48:58,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:58,805 INFO L93 Difference]: Finished difference Result 68585 states and 208881 transitions. [2018-12-31 22:48:58,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-31 22:48:58,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-12-31 22:48:58,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:58,934 INFO L225 Difference]: With dead ends: 68585 [2018-12-31 22:48:58,934 INFO L226 Difference]: Without dead ends: 67769 [2018-12-31 22:48:58,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-12-31 22:48:59,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67769 states. [2018-12-31 22:48:59,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67769 to 44212. [2018-12-31 22:48:59,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44212 states. [2018-12-31 22:48:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44212 states to 44212 states and 138022 transitions. [2018-12-31 22:48:59,759 INFO L78 Accepts]: Start accepts. Automaton has 44212 states and 138022 transitions. Word has length 82 [2018-12-31 22:48:59,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:59,760 INFO L480 AbstractCegarLoop]: Abstraction has 44212 states and 138022 transitions. [2018-12-31 22:48:59,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 22:48:59,760 INFO L276 IsEmpty]: Start isEmpty. Operand 44212 states and 138022 transitions. [2018-12-31 22:48:59,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 22:48:59,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:59,799 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] [2018-12-31 22:48:59,800 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:59,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:59,800 INFO L82 PathProgramCache]: Analyzing trace with hash 2141783017, now seen corresponding path program 1 times [2018-12-31 22:48:59,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:59,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:59,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:59,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:59,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:00,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:00,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:00,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 22:49:00,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 22:49:00,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 22:49:00,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:49:00,046 INFO L87 Difference]: Start difference. First operand 44212 states and 138022 transitions. Second operand 8 states. [2018-12-31 22:49:01,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:01,951 INFO L93 Difference]: Finished difference Result 55748 states and 171883 transitions. [2018-12-31 22:49:01,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-31 22:49:01,952 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-12-31 22:49:01,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:02,062 INFO L225 Difference]: With dead ends: 55748 [2018-12-31 22:49:02,062 INFO L226 Difference]: Without dead ends: 55748 [2018-12-31 22:49:02,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-12-31 22:49:02,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55748 states. [2018-12-31 22:49:02,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55748 to 38956. [2018-12-31 22:49:02,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38956 states. [2018-12-31 22:49:02,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38956 states to 38956 states and 121772 transitions. [2018-12-31 22:49:02,759 INFO L78 Accepts]: Start accepts. Automaton has 38956 states and 121772 transitions. Word has length 82 [2018-12-31 22:49:02,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:02,759 INFO L480 AbstractCegarLoop]: Abstraction has 38956 states and 121772 transitions. [2018-12-31 22:49:02,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 22:49:02,759 INFO L276 IsEmpty]: Start isEmpty. Operand 38956 states and 121772 transitions. [2018-12-31 22:49:02,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 22:49:02,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:02,794 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] [2018-12-31 22:49:02,794 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:02,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:02,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1672467863, now seen corresponding path program 1 times [2018-12-31 22:49:02,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:02,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:02,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:02,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:02,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:03,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:03,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 22:49:03,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 22:49:03,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 22:49:03,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:49:03,199 INFO L87 Difference]: Start difference. First operand 38956 states and 121772 transitions. Second operand 9 states. [2018-12-31 22:49:05,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:05,398 INFO L93 Difference]: Finished difference Result 56356 states and 171062 transitions. [2018-12-31 22:49:05,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 22:49:05,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2018-12-31 22:49:05,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:05,512 INFO L225 Difference]: With dead ends: 56356 [2018-12-31 22:49:05,512 INFO L226 Difference]: Without dead ends: 56356 [2018-12-31 22:49:05,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-12-31 22:49:05,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56356 states. [2018-12-31 22:49:06,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56356 to 42032. [2018-12-31 22:49:06,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42032 states. [2018-12-31 22:49:06,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42032 states to 42032 states and 130931 transitions. [2018-12-31 22:49:06,282 INFO L78 Accepts]: Start accepts. Automaton has 42032 states and 130931 transitions. Word has length 82 [2018-12-31 22:49:06,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:06,282 INFO L480 AbstractCegarLoop]: Abstraction has 42032 states and 130931 transitions. [2018-12-31 22:49:06,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 22:49:06,282 INFO L276 IsEmpty]: Start isEmpty. Operand 42032 states and 130931 transitions. [2018-12-31 22:49:06,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 22:49:06,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:06,326 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] [2018-12-31 22:49:06,327 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:06,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:06,327 INFO L82 PathProgramCache]: Analyzing trace with hash -427703382, now seen corresponding path program 1 times [2018-12-31 22:49:06,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:06,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:06,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:06,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:06,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:06,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:06,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:06,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:49:06,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:49:06,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:49:06,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:49:06,537 INFO L87 Difference]: Start difference. First operand 42032 states and 130931 transitions. Second operand 5 states. [2018-12-31 22:49:06,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:06,598 INFO L93 Difference]: Finished difference Result 5368 states and 13973 transitions. [2018-12-31 22:49:06,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:49:06,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-31 22:49:06,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:06,606 INFO L225 Difference]: With dead ends: 5368 [2018-12-31 22:49:06,606 INFO L226 Difference]: Without dead ends: 4792 [2018-12-31 22:49:06,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:49:06,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4792 states. [2018-12-31 22:49:06,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4792 to 4628. [2018-12-31 22:49:06,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4628 states. [2018-12-31 22:49:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4628 states to 4628 states and 12093 transitions. [2018-12-31 22:49:06,659 INFO L78 Accepts]: Start accepts. Automaton has 4628 states and 12093 transitions. Word has length 82 [2018-12-31 22:49:06,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:06,660 INFO L480 AbstractCegarLoop]: Abstraction has 4628 states and 12093 transitions. [2018-12-31 22:49:06,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:49:06,660 INFO L276 IsEmpty]: Start isEmpty. Operand 4628 states and 12093 transitions. [2018-12-31 22:49:06,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:49:06,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:06,665 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] [2018-12-31 22:49:06,665 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:06,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:06,665 INFO L82 PathProgramCache]: Analyzing trace with hash -365297887, now seen corresponding path program 1 times [2018-12-31 22:49:06,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:06,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:06,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:06,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:06,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:06,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:06,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:06,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:49:06,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:49:06,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:49:06,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:49:06,833 INFO L87 Difference]: Start difference. First operand 4628 states and 12093 transitions. Second operand 5 states. [2018-12-31 22:49:07,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:07,102 INFO L93 Difference]: Finished difference Result 5272 states and 13634 transitions. [2018-12-31 22:49:07,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:49:07,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 22:49:07,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:07,111 INFO L225 Difference]: With dead ends: 5272 [2018-12-31 22:49:07,111 INFO L226 Difference]: Without dead ends: 5272 [2018-12-31 22:49:07,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:49:07,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5272 states. [2018-12-31 22:49:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5272 to 4680. [2018-12-31 22:49:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2018-12-31 22:49:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 12205 transitions. [2018-12-31 22:49:07,162 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 12205 transitions. Word has length 94 [2018-12-31 22:49:07,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:07,162 INFO L480 AbstractCegarLoop]: Abstraction has 4680 states and 12205 transitions. [2018-12-31 22:49:07,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:49:07,163 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 12205 transitions. [2018-12-31 22:49:07,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:49:07,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:07,167 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] [2018-12-31 22:49:07,167 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:07,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:07,168 INFO L82 PathProgramCache]: Analyzing trace with hash 804370255, now seen corresponding path program 1 times [2018-12-31 22:49:07,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:07,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:07,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:07,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:07,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:07,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:07,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:07,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:49:07,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:49:07,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:49:07,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:49:07,288 INFO L87 Difference]: Start difference. First operand 4680 states and 12205 transitions. Second operand 6 states. [2018-12-31 22:49:07,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:07,671 INFO L93 Difference]: Finished difference Result 4961 states and 12756 transitions. [2018-12-31 22:49:07,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:49:07,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-31 22:49:07,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:07,680 INFO L225 Difference]: With dead ends: 4961 [2018-12-31 22:49:07,680 INFO L226 Difference]: Without dead ends: 4924 [2018-12-31 22:49:07,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:49:07,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4924 states. [2018-12-31 22:49:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4924 to 4854. [2018-12-31 22:49:07,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4854 states. [2018-12-31 22:49:07,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4854 states to 4854 states and 12556 transitions. [2018-12-31 22:49:07,735 INFO L78 Accepts]: Start accepts. Automaton has 4854 states and 12556 transitions. Word has length 94 [2018-12-31 22:49:07,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:07,736 INFO L480 AbstractCegarLoop]: Abstraction has 4854 states and 12556 transitions. [2018-12-31 22:49:07,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:49:07,736 INFO L276 IsEmpty]: Start isEmpty. Operand 4854 states and 12556 transitions. [2018-12-31 22:49:07,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:49:07,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:07,741 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] [2018-12-31 22:49:07,741 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:07,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:07,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1789856562, now seen corresponding path program 1 times [2018-12-31 22:49:07,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:07,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:07,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:07,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:07,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:07,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:07,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:07,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:49:07,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:49:07,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:49:07,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:49:07,945 INFO L87 Difference]: Start difference. First operand 4854 states and 12556 transitions. Second operand 7 states. [2018-12-31 22:49:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:08,253 INFO L93 Difference]: Finished difference Result 5098 states and 13143 transitions. [2018-12-31 22:49:08,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:49:08,254 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-31 22:49:08,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:08,262 INFO L225 Difference]: With dead ends: 5098 [2018-12-31 22:49:08,262 INFO L226 Difference]: Without dead ends: 5098 [2018-12-31 22:49:08,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:49:08,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5098 states. [2018-12-31 22:49:08,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5098 to 4836. [2018-12-31 22:49:08,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4836 states. [2018-12-31 22:49:08,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4836 states to 4836 states and 12519 transitions. [2018-12-31 22:49:08,319 INFO L78 Accepts]: Start accepts. Automaton has 4836 states and 12519 transitions. Word has length 94 [2018-12-31 22:49:08,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:08,319 INFO L480 AbstractCegarLoop]: Abstraction has 4836 states and 12519 transitions. [2018-12-31 22:49:08,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:49:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 4836 states and 12519 transitions. [2018-12-31 22:49:08,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:49:08,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:08,325 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] [2018-12-31 22:49:08,325 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:08,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:08,325 INFO L82 PathProgramCache]: Analyzing trace with hash -378977042, now seen corresponding path program 1 times [2018-12-31 22:49:08,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:08,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:08,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:08,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:08,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:08,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:08,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:49:08,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:49:08,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:49:08,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:49:08,412 INFO L87 Difference]: Start difference. First operand 4836 states and 12519 transitions. Second operand 5 states. [2018-12-31 22:49:08,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:08,644 INFO L93 Difference]: Finished difference Result 9965 states and 25923 transitions. [2018-12-31 22:49:08,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:49:08,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 22:49:08,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:08,659 INFO L225 Difference]: With dead ends: 9965 [2018-12-31 22:49:08,659 INFO L226 Difference]: Without dead ends: 9965 [2018-12-31 22:49:08,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:49:08,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9965 states. [2018-12-31 22:49:08,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9965 to 4910. [2018-12-31 22:49:08,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4910 states. [2018-12-31 22:49:08,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4910 states to 4910 states and 12681 transitions. [2018-12-31 22:49:08,745 INFO L78 Accepts]: Start accepts. Automaton has 4910 states and 12681 transitions. Word has length 94 [2018-12-31 22:49:08,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:08,745 INFO L480 AbstractCegarLoop]: Abstraction has 4910 states and 12681 transitions. [2018-12-31 22:49:08,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:49:08,745 INFO L276 IsEmpty]: Start isEmpty. Operand 4910 states and 12681 transitions. [2018-12-31 22:49:08,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:49:08,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:08,751 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] [2018-12-31 22:49:08,751 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:08,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:08,752 INFO L82 PathProgramCache]: Analyzing trace with hash -984252051, now seen corresponding path program 1 times [2018-12-31 22:49:08,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:08,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:08,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:08,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:08,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:09,079 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-12-31 22:49:09,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:09,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:09,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:49:09,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:49:09,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:49:09,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:49:09,103 INFO L87 Difference]: Start difference. First operand 4910 states and 12681 transitions. Second operand 5 states. [2018-12-31 22:49:09,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:09,241 INFO L93 Difference]: Finished difference Result 4892 states and 12592 transitions. [2018-12-31 22:49:09,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:49:09,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 22:49:09,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:09,249 INFO L225 Difference]: With dead ends: 4892 [2018-12-31 22:49:09,249 INFO L226 Difference]: Without dead ends: 4892 [2018-12-31 22:49:09,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:49:09,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4892 states. [2018-12-31 22:49:09,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4892 to 4892. [2018-12-31 22:49:09,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4892 states. [2018-12-31 22:49:09,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4892 states to 4892 states and 12592 transitions. [2018-12-31 22:49:09,300 INFO L78 Accepts]: Start accepts. Automaton has 4892 states and 12592 transitions. Word has length 94 [2018-12-31 22:49:09,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:09,300 INFO L480 AbstractCegarLoop]: Abstraction has 4892 states and 12592 transitions. [2018-12-31 22:49:09,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:49:09,300 INFO L276 IsEmpty]: Start isEmpty. Operand 4892 states and 12592 transitions. [2018-12-31 22:49:09,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 22:49:09,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:09,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:09,306 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:09,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:09,306 INFO L82 PathProgramCache]: Analyzing trace with hash -2053095252, now seen corresponding path program 1 times [2018-12-31 22:49:09,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:09,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:09,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:09,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:09,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:09,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:09,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:49:09,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:49:09,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:49:09,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:49:09,493 INFO L87 Difference]: Start difference. First operand 4892 states and 12592 transitions. Second operand 6 states. [2018-12-31 22:49:09,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:09,694 INFO L93 Difference]: Finished difference Result 3980 states and 9848 transitions. [2018-12-31 22:49:09,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:49:09,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-31 22:49:09,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:09,701 INFO L225 Difference]: With dead ends: 3980 [2018-12-31 22:49:09,701 INFO L226 Difference]: Without dead ends: 3980 [2018-12-31 22:49:09,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:49:09,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3980 states. [2018-12-31 22:49:09,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3980 to 3058. [2018-12-31 22:49:09,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3058 states. [2018-12-31 22:49:09,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 7642 transitions. [2018-12-31 22:49:09,740 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 7642 transitions. Word has length 94 [2018-12-31 22:49:09,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:09,741 INFO L480 AbstractCegarLoop]: Abstraction has 3058 states and 7642 transitions. [2018-12-31 22:49:09,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:49:09,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 7642 transitions. [2018-12-31 22:49:09,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 22:49:09,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:09,747 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] [2018-12-31 22:49:09,748 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:09,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:09,749 INFO L82 PathProgramCache]: Analyzing trace with hash -896804400, now seen corresponding path program 1 times [2018-12-31 22:49:09,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:09,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:09,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:09,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:09,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:10,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:10,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:10,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 22:49:10,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 22:49:10,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 22:49:10,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:49:10,517 INFO L87 Difference]: Start difference. First operand 3058 states and 7642 transitions. Second operand 8 states. [2018-12-31 22:49:11,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:11,422 INFO L93 Difference]: Finished difference Result 7304 states and 18412 transitions. [2018-12-31 22:49:11,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-31 22:49:11,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-31 22:49:11,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:11,435 INFO L225 Difference]: With dead ends: 7304 [2018-12-31 22:49:11,435 INFO L226 Difference]: Without dead ends: 7272 [2018-12-31 22:49:11,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-12-31 22:49:11,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7272 states. [2018-12-31 22:49:11,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7272 to 3769. [2018-12-31 22:49:11,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3769 states. [2018-12-31 22:49:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3769 states to 3769 states and 9361 transitions. [2018-12-31 22:49:11,496 INFO L78 Accepts]: Start accepts. Automaton has 3769 states and 9361 transitions. Word has length 96 [2018-12-31 22:49:11,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:11,496 INFO L480 AbstractCegarLoop]: Abstraction has 3769 states and 9361 transitions. [2018-12-31 22:49:11,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 22:49:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 3769 states and 9361 transitions. [2018-12-31 22:49:11,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 22:49:11,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:11,501 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] [2018-12-31 22:49:11,502 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:11,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:11,502 INFO L82 PathProgramCache]: Analyzing trace with hash 347960081, now seen corresponding path program 1 times [2018-12-31 22:49:11,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:11,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:11,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:11,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:11,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:12,018 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 6 [2018-12-31 22:49:12,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:12,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:12,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:49:12,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:49:12,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:49:12,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:49:12,097 INFO L87 Difference]: Start difference. First operand 3769 states and 9361 transitions. Second operand 5 states. [2018-12-31 22:49:12,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:12,521 INFO L93 Difference]: Finished difference Result 5639 states and 14350 transitions. [2018-12-31 22:49:12,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:49:12,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-31 22:49:12,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:12,533 INFO L225 Difference]: With dead ends: 5639 [2018-12-31 22:49:12,533 INFO L226 Difference]: Without dead ends: 5639 [2018-12-31 22:49:12,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:49:12,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2018-12-31 22:49:12,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 3550. [2018-12-31 22:49:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3550 states. [2018-12-31 22:49:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 8862 transitions. [2018-12-31 22:49:12,587 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 8862 transitions. Word has length 96 [2018-12-31 22:49:12,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:12,587 INFO L480 AbstractCegarLoop]: Abstraction has 3550 states and 8862 transitions. [2018-12-31 22:49:12,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:49:12,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 8862 transitions. [2018-12-31 22:49:12,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 22:49:12,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:12,591 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] [2018-12-31 22:49:12,592 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:12,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:12,592 INFO L82 PathProgramCache]: Analyzing trace with hash -567038639, now seen corresponding path program 1 times [2018-12-31 22:49:12,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:12,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:12,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:12,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:12,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:12,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:12,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:49:12,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:49:12,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:49:12,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:49:12,981 INFO L87 Difference]: Start difference. First operand 3550 states and 8862 transitions. Second operand 5 states. [2018-12-31 22:49:14,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:14,267 INFO L93 Difference]: Finished difference Result 3998 states and 9966 transitions. [2018-12-31 22:49:14,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:49:14,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-31 22:49:14,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:14,274 INFO L225 Difference]: With dead ends: 3998 [2018-12-31 22:49:14,274 INFO L226 Difference]: Without dead ends: 3966 [2018-12-31 22:49:14,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:49:14,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3966 states. [2018-12-31 22:49:14,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3966 to 3046. [2018-12-31 22:49:14,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3046 states. [2018-12-31 22:49:14,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3046 states to 3046 states and 7608 transitions. [2018-12-31 22:49:14,313 INFO L78 Accepts]: Start accepts. Automaton has 3046 states and 7608 transitions. Word has length 96 [2018-12-31 22:49:14,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:14,313 INFO L480 AbstractCegarLoop]: Abstraction has 3046 states and 7608 transitions. [2018-12-31 22:49:14,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:49:14,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3046 states and 7608 transitions. [2018-12-31 22:49:14,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 22:49:14,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:14,318 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] [2018-12-31 22:49:14,318 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:14,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:14,318 INFO L82 PathProgramCache]: Analyzing trace with hash 677725842, now seen corresponding path program 1 times [2018-12-31 22:49:14,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:14,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:14,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:14,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:14,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:14,729 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 22:49:14,908 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 22:49:15,115 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 22:49:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:15,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:15,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 22:49:15,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 22:49:15,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 22:49:15,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 22:49:15,625 INFO L87 Difference]: Start difference. First operand 3046 states and 7608 transitions. Second operand 10 states. [2018-12-31 22:49:16,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:16,163 INFO L93 Difference]: Finished difference Result 5121 states and 12979 transitions. [2018-12-31 22:49:16,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:49:16,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-31 22:49:16,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:16,168 INFO L225 Difference]: With dead ends: 5121 [2018-12-31 22:49:16,168 INFO L226 Difference]: Without dead ends: 2051 [2018-12-31 22:49:16,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-31 22:49:16,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2018-12-31 22:49:16,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 2051. [2018-12-31 22:49:16,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2051 states. [2018-12-31 22:49:16,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 5303 transitions. [2018-12-31 22:49:16,191 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 5303 transitions. Word has length 96 [2018-12-31 22:49:16,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:16,191 INFO L480 AbstractCegarLoop]: Abstraction has 2051 states and 5303 transitions. [2018-12-31 22:49:16,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 22:49:16,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 5303 transitions. [2018-12-31 22:49:16,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 22:49:16,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:16,194 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] [2018-12-31 22:49:16,195 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:16,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:16,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1311116434, now seen corresponding path program 2 times [2018-12-31 22:49:16,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:16,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:16,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:16,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:49:16,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:49:16,422 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-31 22:49:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:49:17,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:49:17,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-31 22:49:17,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 22:49:17,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 22:49:17,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-31 22:49:17,830 INFO L87 Difference]: Start difference. First operand 2051 states and 5303 transitions. Second operand 12 states. [2018-12-31 22:49:18,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:18,609 INFO L93 Difference]: Finished difference Result 3882 states and 10151 transitions. [2018-12-31 22:49:18,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 22:49:18,610 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-31 22:49:18,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:18,615 INFO L225 Difference]: With dead ends: 3882 [2018-12-31 22:49:18,615 INFO L226 Difference]: Without dead ends: 2746 [2018-12-31 22:49:18,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-31 22:49:18,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2018-12-31 22:49:18,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2580. [2018-12-31 22:49:18,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2580 states. [2018-12-31 22:49:18,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 6543 transitions. [2018-12-31 22:49:18,649 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 6543 transitions. Word has length 96 [2018-12-31 22:49:18,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:18,649 INFO L480 AbstractCegarLoop]: Abstraction has 2580 states and 6543 transitions. [2018-12-31 22:49:18,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 22:49:18,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 6543 transitions. [2018-12-31 22:49:18,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 22:49:18,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:49:18,653 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:18,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:18,653 INFO L82 PathProgramCache]: Analyzing trace with hash 187348118, now seen corresponding path program 3 times [2018-12-31 22:49:18,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:18,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:18,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:18,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:49:18,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:49:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:49:18,738 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 22:49:18,909 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 22:49:18,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:49:18 BasicIcfg [2018-12-31 22:49:18,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 22:49:18,912 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 22:49:18,912 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 22:49:18,912 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 22:49:18,915 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:47:45" (3/4) ... [2018-12-31 22:49:18,921 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 22:49:19,110 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 22:49:19,110 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 22:49:19,111 INFO L168 Benchmark]: Toolchain (without parser) took 95670.39 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 946.0 MB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 684.1 MB. Max. memory is 11.5 GB. [2018-12-31 22:49:19,113 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 22:49:19,114 INFO L168 Benchmark]: CACSL2BoogieTranslator took 842.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-31 22:49:19,114 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.12 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. [2018-12-31 22:49:19,116 INFO L168 Benchmark]: Boogie Preprocessor took 42.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 22:49:19,116 INFO L168 Benchmark]: RCFGBuilder took 1230.77 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.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. [2018-12-31 22:49:19,122 INFO L168 Benchmark]: TraceAbstraction took 93271.59 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 604.1 MB. Max. memory is 11.5 GB. [2018-12-31 22:49:19,122 INFO L168 Benchmark]: Witness Printer took 198.43 ms. Allocated memory is still 5.0 GB. Free memory was 4.3 GB in the beginning and 4.3 GB in the end (delta: 57.7 MB). Peak memory consumption was 57.7 MB. Max. memory is 11.5 GB. [2018-12-31 22:49:19,128 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 842.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.12 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 42.39 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 1230.77 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.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 93271.59 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 604.1 MB. Max. memory is 11.5 GB. * Witness Printer took 198.43 ms. Allocated memory is still 5.0 GB. Free memory was 4.3 GB in the beginning and 4.3 GB in the end (delta: 57.7 MB). Peak memory consumption was 57.7 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=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] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=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] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=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] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=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}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=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] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=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] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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] [L697] -1 int z = 0; VAL [__unbuffered_cnt=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, z=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=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, z=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=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, z=0] [L765] -1 pthread_t t1613; VAL [__unbuffered_cnt=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, z=0] [L766] FCALL, FORK -1 pthread_create(&t1613, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] -1 pthread_t t1614; VAL [__unbuffered_cnt=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=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L768] FCALL, FORK -1 pthread_create(&t1614, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L723] 0 y$w_buff1 = y$w_buff0 [L724] 0 y$w_buff0 = 2 [L725] 0 y$w_buff1_used = y$w_buff0_used [L726] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=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=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L729] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L730] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L731] 0 y$r_buff0_thd2 = (_Bool)1 [L734] 0 z = 1 [L737] 0 __unbuffered_p1_EAX = z [L740] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L703] 1 x = 1 [L706] 1 y = 1 VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L744] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L709] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L709] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L709] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L709] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L710] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L746] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L747] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L750] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L711] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L711] 1 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 [L712] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L712] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L713] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L713] 1 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 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] -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) [L775] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L776] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] -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 [L777] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L778] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] -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 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 y$flush_delayed = weak$$choice2 [L784] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L786] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L786] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L787] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L788] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L789] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L791] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L792] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] -1 y = y$flush_delayed ? y$mem_tmp : y [L794] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __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=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __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=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __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=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 181 locations, 3 error locations. UNSAFE Result, 93.1s OverallTime, 36 OverallIterations, 1 TraceHistogramMax, 43.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11109 SDtfs, 13175 SDslu, 30919 SDs, 0 SdLazy, 15359 SolverSat, 819 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 115 SyntacticMatches, 26 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 13.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108488occurred in iteration=11, 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: 33.7s AutomataMinimizationTime, 35 MinimizatonAttempts, 415407 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 2824 NumberOfCodeBlocks, 2824 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2693 ConstructedInterpolants, 0 QuantifiedInterpolants, 513080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...