./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe029_pso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/safe029_pso.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26b2b2357b814182a8d4879b997bcd0cb02065f5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 05:27:23,458 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 05:27:23,460 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 05:27:23,473 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 05:27:23,473 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 05:27:23,475 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 05:27:23,476 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 05:27:23,478 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 05:27:23,480 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 05:27:23,481 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 05:27:23,482 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 05:27:23,482 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 05:27:23,484 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 05:27:23,485 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 05:27:23,486 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 05:27:23,487 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 05:27:23,488 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 05:27:23,490 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 05:27:23,493 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 05:27:23,494 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 05:27:23,496 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 05:27:23,497 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 05:27:23,500 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 05:27:23,500 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 05:27:23,501 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 05:27:23,502 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 05:27:23,503 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 05:27:23,504 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 05:27:23,505 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 05:27:23,507 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 05:27:23,507 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 05:27:23,507 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 05:27:23,508 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 05:27:23,508 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 05:27:23,509 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 05:27:23,510 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 05:27:23,510 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 05:27:23,537 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 05:27:23,541 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 05:27:23,545 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 05:27:23,547 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 05:27:23,548 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 05:27:23,548 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 05:27:23,548 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 05:27:23,548 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 05:27:23,549 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 05:27:23,549 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 05:27:23,549 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 05:27:23,549 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 05:27:23,549 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 05:27:23,549 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 05:27:23,550 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 05:27:23,552 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 05:27:23,552 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 05:27:23,553 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 05:27:23,553 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 05:27:23,553 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 05:27:23,553 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 05:27:23,553 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 05:27:23,553 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 05:27:23,556 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 05:27:23,556 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 05:27:23,557 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 05:27:23,557 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 05:27:23,557 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 05:27:23,557 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 -> 26b2b2357b814182a8d4879b997bcd0cb02065f5 [2019-01-13 05:27:23,600 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 05:27:23,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 05:27:23,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 05:27:23,628 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 05:27:23,629 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 05:27:23,630 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe029_pso.oepc_false-unreach-call.i [2019-01-13 05:27:23,688 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cda07237/f8c0074ffbb449168d5ade90127257d6/FLAG6782fa7f6 [2019-01-13 05:27:24,177 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 05:27:24,178 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe029_pso.oepc_false-unreach-call.i [2019-01-13 05:27:24,199 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cda07237/f8c0074ffbb449168d5ade90127257d6/FLAG6782fa7f6 [2019-01-13 05:27:24,474 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cda07237/f8c0074ffbb449168d5ade90127257d6 [2019-01-13 05:27:24,480 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 05:27:24,482 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 05:27:24,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 05:27:24,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 05:27:24,488 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 05:27:24,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:27:24" (1/1) ... [2019-01-13 05:27:24,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd7693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:24, skipping insertion in model container [2019-01-13 05:27:24,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:27:24" (1/1) ... [2019-01-13 05:27:24,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 05:27:24,574 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 05:27:25,081 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:27:25,104 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 05:27:25,311 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:27:25,412 INFO L195 MainTranslator]: Completed translation [2019-01-13 05:27:25,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:25 WrapperNode [2019-01-13 05:27:25,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 05:27:25,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 05:27:25,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 05:27:25,414 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 05:27:25,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:25" (1/1) ... [2019-01-13 05:27:25,456 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:25" (1/1) ... [2019-01-13 05:27:25,505 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 05:27:25,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 05:27:25,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 05:27:25,505 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 05:27:25,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:25" (1/1) ... [2019-01-13 05:27:25,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:25" (1/1) ... [2019-01-13 05:27:25,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:25" (1/1) ... [2019-01-13 05:27:25,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:25" (1/1) ... [2019-01-13 05:27:25,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:25" (1/1) ... [2019-01-13 05:27:25,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:25" (1/1) ... [2019-01-13 05:27:25,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:25" (1/1) ... [2019-01-13 05:27:25,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 05:27:25,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 05:27:25,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 05:27:25,547 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 05:27:25,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 05:27:25,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 05:27:25,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 05:27:25,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 05:27:25,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 05:27:25,619 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 05:27:25,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 05:27:25,619 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 05:27:25,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 05:27:25,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 05:27:25,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 05:27:25,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 05:27:25,622 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 05:27:26,740 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 05:27:26,740 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 05:27:26,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:27:26 BoogieIcfgContainer [2019-01-13 05:27:26,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 05:27:26,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 05:27:26,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 05:27:26,750 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 05:27:26,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 05:27:24" (1/3) ... [2019-01-13 05:27:26,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1735ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:27:26, skipping insertion in model container [2019-01-13 05:27:26,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:27:25" (2/3) ... [2019-01-13 05:27:26,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1735ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:27:26, skipping insertion in model container [2019-01-13 05:27:26,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:27:26" (3/3) ... [2019-01-13 05:27:26,754 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_pso.oepc_false-unreach-call.i [2019-01-13 05:27:26,797 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,797 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,797 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,798 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,798 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,798 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,798 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,799 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,799 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,799 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,799 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,800 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,800 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,800 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,800 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,800 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,801 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,801 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,801 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,801 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,802 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,802 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,802 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,802 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,802 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,803 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,803 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,803 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,803 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,804 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,804 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,804 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,804 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,804 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,805 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,805 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,805 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,805 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,806 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,806 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,806 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,807 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,807 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,807 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,807 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,807 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,808 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,808 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,808 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,809 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,809 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,809 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,809 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,809 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:27:26,841 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 05:27:26,841 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 05:27:26,850 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 05:27:26,867 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 05:27:26,890 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 05:27:26,891 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 05:27:26,891 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 05:27:26,891 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 05:27:26,891 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 05:27:26,892 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 05:27:26,892 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 05:27:26,892 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 05:27:26,892 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 05:27:26,907 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140places, 178 transitions [2019-01-13 05:27:28,528 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25102 states. [2019-01-13 05:27:28,531 INFO L276 IsEmpty]: Start isEmpty. Operand 25102 states. [2019-01-13 05:27:28,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-13 05:27:28,540 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:28,541 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] [2019-01-13 05:27:28,544 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:28,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:28,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2024635459, now seen corresponding path program 1 times [2019-01-13 05:27:28,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:28,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:28,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:28,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:28,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:28,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:28,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:28,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:27:28,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:27:28,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:27:28,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:27:28,947 INFO L87 Difference]: Start difference. First operand 25102 states. Second operand 4 states. [2019-01-13 05:27:30,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:30,230 INFO L93 Difference]: Finished difference Result 45394 states and 177648 transitions. [2019-01-13 05:27:30,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 05:27:30,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-01-13 05:27:30,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:30,669 INFO L225 Difference]: With dead ends: 45394 [2019-01-13 05:27:30,670 INFO L226 Difference]: Without dead ends: 40634 [2019-01-13 05:27:30,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:27:31,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40634 states. [2019-01-13 05:27:32,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40634 to 23668. [2019-01-13 05:27:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23668 states. [2019-01-13 05:27:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23668 states to 23668 states and 92565 transitions. [2019-01-13 05:27:32,473 INFO L78 Accepts]: Start accepts. Automaton has 23668 states and 92565 transitions. Word has length 31 [2019-01-13 05:27:32,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:32,478 INFO L480 AbstractCegarLoop]: Abstraction has 23668 states and 92565 transitions. [2019-01-13 05:27:32,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:27:32,478 INFO L276 IsEmpty]: Start isEmpty. Operand 23668 states and 92565 transitions. [2019-01-13 05:27:32,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-13 05:27:32,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:32,497 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] [2019-01-13 05:27:32,497 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:32,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:32,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1263924681, now seen corresponding path program 1 times [2019-01-13 05:27:32,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:32,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:32,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:32,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:32,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:32,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:32,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:27:32,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:27:32,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:27:32,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:27:32,753 INFO L87 Difference]: Start difference. First operand 23668 states and 92565 transitions. Second operand 5 states. [2019-01-13 05:27:35,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:35,782 INFO L93 Difference]: Finished difference Result 64836 states and 241395 transitions. [2019-01-13 05:27:35,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:27:35,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-01-13 05:27:35,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:36,157 INFO L225 Difference]: With dead ends: 64836 [2019-01-13 05:27:36,158 INFO L226 Difference]: Without dead ends: 64676 [2019-01-13 05:27:36,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:27:36,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64676 states. [2019-01-13 05:27:37,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64676 to 37148. [2019-01-13 05:27:37,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37148 states. [2019-01-13 05:27:38,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37148 states to 37148 states and 138310 transitions. [2019-01-13 05:27:38,045 INFO L78 Accepts]: Start accepts. Automaton has 37148 states and 138310 transitions. Word has length 42 [2019-01-13 05:27:38,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:38,047 INFO L480 AbstractCegarLoop]: Abstraction has 37148 states and 138310 transitions. [2019-01-13 05:27:38,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:27:38,047 INFO L276 IsEmpty]: Start isEmpty. Operand 37148 states and 138310 transitions. [2019-01-13 05:27:38,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-13 05:27:38,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:38,053 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] [2019-01-13 05:27:38,053 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:38,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:38,053 INFO L82 PathProgramCache]: Analyzing trace with hash 555727520, now seen corresponding path program 1 times [2019-01-13 05:27:38,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:38,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:38,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:38,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:38,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:38,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:38,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:38,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:27:38,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:27:38,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:27:38,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:27:38,165 INFO L87 Difference]: Start difference. First operand 37148 states and 138310 transitions. Second operand 4 states. [2019-01-13 05:27:38,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:38,265 INFO L93 Difference]: Finished difference Result 12370 states and 41203 transitions. [2019-01-13 05:27:38,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:27:38,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-01-13 05:27:38,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:38,297 INFO L225 Difference]: With dead ends: 12370 [2019-01-13 05:27:38,298 INFO L226 Difference]: Without dead ends: 11849 [2019-01-13 05:27:38,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:27:38,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2019-01-13 05:27:38,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 11849. [2019-01-13 05:27:38,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11849 states. [2019-01-13 05:27:38,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11849 states to 11849 states and 39648 transitions. [2019-01-13 05:27:38,605 INFO L78 Accepts]: Start accepts. Automaton has 11849 states and 39648 transitions. Word has length 43 [2019-01-13 05:27:38,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:38,606 INFO L480 AbstractCegarLoop]: Abstraction has 11849 states and 39648 transitions. [2019-01-13 05:27:38,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:27:38,606 INFO L276 IsEmpty]: Start isEmpty. Operand 11849 states and 39648 transitions. [2019-01-13 05:27:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 05:27:38,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:38,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:38,613 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:38,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:38,614 INFO L82 PathProgramCache]: Analyzing trace with hash -2022717967, now seen corresponding path program 1 times [2019-01-13 05:27:38,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:38,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:38,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:38,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:38,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:38,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:38,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:27:38,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:27:38,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:27:38,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:27:38,737 INFO L87 Difference]: Start difference. First operand 11849 states and 39648 transitions. Second operand 4 states. [2019-01-13 05:27:39,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:39,185 INFO L93 Difference]: Finished difference Result 17025 states and 55723 transitions. [2019-01-13 05:27:39,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:27:39,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-01-13 05:27:39,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:39,236 INFO L225 Difference]: With dead ends: 17025 [2019-01-13 05:27:39,236 INFO L226 Difference]: Without dead ends: 17025 [2019-01-13 05:27:39,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:27:39,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17025 states. [2019-01-13 05:27:39,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17025 to 12885. [2019-01-13 05:27:39,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12885 states. [2019-01-13 05:27:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12885 states to 12885 states and 42750 transitions. [2019-01-13 05:27:40,200 INFO L78 Accepts]: Start accepts. Automaton has 12885 states and 42750 transitions. Word has length 56 [2019-01-13 05:27:40,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:40,200 INFO L480 AbstractCegarLoop]: Abstraction has 12885 states and 42750 transitions. [2019-01-13 05:27:40,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:27:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 12885 states and 42750 transitions. [2019-01-13 05:27:40,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 05:27:40,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:40,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:40,217 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:40,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:40,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1977003375, now seen corresponding path program 1 times [2019-01-13 05:27:40,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:40,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:40,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:40,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:40,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:40,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:40,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:40,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:27:40,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:27:40,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:27:40,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:27:40,506 INFO L87 Difference]: Start difference. First operand 12885 states and 42750 transitions. Second operand 4 states. [2019-01-13 05:27:41,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:41,537 INFO L93 Difference]: Finished difference Result 18380 states and 60007 transitions. [2019-01-13 05:27:41,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:27:41,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-01-13 05:27:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:41,588 INFO L225 Difference]: With dead ends: 18380 [2019-01-13 05:27:41,588 INFO L226 Difference]: Without dead ends: 18380 [2019-01-13 05:27:41,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:27:41,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18380 states. [2019-01-13 05:27:41,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18380 to 16341. [2019-01-13 05:27:41,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16341 states. [2019-01-13 05:27:42,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16341 states to 16341 states and 53832 transitions. [2019-01-13 05:27:42,015 INFO L78 Accepts]: Start accepts. Automaton has 16341 states and 53832 transitions. Word has length 56 [2019-01-13 05:27:42,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:42,018 INFO L480 AbstractCegarLoop]: Abstraction has 16341 states and 53832 transitions. [2019-01-13 05:27:42,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:27:42,018 INFO L276 IsEmpty]: Start isEmpty. Operand 16341 states and 53832 transitions. [2019-01-13 05:27:42,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 05:27:42,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:42,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:42,031 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:42,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:42,031 INFO L82 PathProgramCache]: Analyzing trace with hash -964654224, now seen corresponding path program 1 times [2019-01-13 05:27:42,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:42,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:42,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:42,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:42,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:42,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:42,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:42,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:27:42,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:27:42,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:27:42,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:27:42,445 INFO L87 Difference]: Start difference. First operand 16341 states and 53832 transitions. Second operand 6 states. [2019-01-13 05:27:43,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:43,044 INFO L93 Difference]: Finished difference Result 17857 states and 58003 transitions. [2019-01-13 05:27:43,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:27:43,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-01-13 05:27:43,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:43,079 INFO L225 Difference]: With dead ends: 17857 [2019-01-13 05:27:43,079 INFO L226 Difference]: Without dead ends: 17857 [2019-01-13 05:27:43,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:27:43,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17857 states. [2019-01-13 05:27:43,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17857 to 16903. [2019-01-13 05:27:43,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16903 states. [2019-01-13 05:27:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16903 states to 16903 states and 55361 transitions. [2019-01-13 05:27:43,419 INFO L78 Accepts]: Start accepts. Automaton has 16903 states and 55361 transitions. Word has length 56 [2019-01-13 05:27:43,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:43,420 INFO L480 AbstractCegarLoop]: Abstraction has 16903 states and 55361 transitions. [2019-01-13 05:27:43,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:27:43,420 INFO L276 IsEmpty]: Start isEmpty. Operand 16903 states and 55361 transitions. [2019-01-13 05:27:43,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 05:27:43,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:43,430 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:43,431 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:43,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:43,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1258057231, now seen corresponding path program 1 times [2019-01-13 05:27:43,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:43,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:43,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:43,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:43,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:43,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:43,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:27:43,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:27:43,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:27:43,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:27:43,639 INFO L87 Difference]: Start difference. First operand 16903 states and 55361 transitions. Second operand 6 states. [2019-01-13 05:27:45,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:45,111 INFO L93 Difference]: Finished difference Result 23475 states and 75946 transitions. [2019-01-13 05:27:45,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 05:27:45,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-01-13 05:27:45,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:45,156 INFO L225 Difference]: With dead ends: 23475 [2019-01-13 05:27:45,156 INFO L226 Difference]: Without dead ends: 23443 [2019-01-13 05:27:45,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-13 05:27:45,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23443 states. [2019-01-13 05:27:45,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23443 to 18807. [2019-01-13 05:27:45,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18807 states. [2019-01-13 05:27:45,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18807 states to 18807 states and 61305 transitions. [2019-01-13 05:27:45,546 INFO L78 Accepts]: Start accepts. Automaton has 18807 states and 61305 transitions. Word has length 56 [2019-01-13 05:27:45,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:45,547 INFO L480 AbstractCegarLoop]: Abstraction has 18807 states and 61305 transitions. [2019-01-13 05:27:45,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:27:45,547 INFO L276 IsEmpty]: Start isEmpty. Operand 18807 states and 61305 transitions. [2019-01-13 05:27:45,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-13 05:27:45,574 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:45,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:45,575 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:45,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:45,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2076609247, now seen corresponding path program 1 times [2019-01-13 05:27:45,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:45,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:45,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:45,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:45,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:45,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:45,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:27:45,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:27:45,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:27:45,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:27:45,789 INFO L87 Difference]: Start difference. First operand 18807 states and 61305 transitions. Second operand 7 states. [2019-01-13 05:27:46,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:46,791 INFO L93 Difference]: Finished difference Result 24535 states and 79153 transitions. [2019-01-13 05:27:46,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 05:27:46,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-01-13 05:27:46,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:46,834 INFO L225 Difference]: With dead ends: 24535 [2019-01-13 05:27:46,834 INFO L226 Difference]: Without dead ends: 24471 [2019-01-13 05:27:46,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-01-13 05:27:46,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24471 states. [2019-01-13 05:27:47,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24471 to 20899. [2019-01-13 05:27:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20899 states. [2019-01-13 05:27:47,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20899 states to 20899 states and 67710 transitions. [2019-01-13 05:27:47,179 INFO L78 Accepts]: Start accepts. Automaton has 20899 states and 67710 transitions. Word has length 70 [2019-01-13 05:27:47,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:47,180 INFO L480 AbstractCegarLoop]: Abstraction has 20899 states and 67710 transitions. [2019-01-13 05:27:47,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:27:47,180 INFO L276 IsEmpty]: Start isEmpty. Operand 20899 states and 67710 transitions. [2019-01-13 05:27:47,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-13 05:27:47,204 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:47,205 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:47,205 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:47,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:47,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1643744653, now seen corresponding path program 1 times [2019-01-13 05:27:47,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:47,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:47,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:47,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:47,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:47,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:47,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:47,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 05:27:47,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 05:27:47,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 05:27:47,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 05:27:47,296 INFO L87 Difference]: Start difference. First operand 20899 states and 67710 transitions. Second operand 3 states. [2019-01-13 05:27:47,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:47,475 INFO L93 Difference]: Finished difference Result 24947 states and 79522 transitions. [2019-01-13 05:27:47,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 05:27:47,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-01-13 05:27:47,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:47,519 INFO L225 Difference]: With dead ends: 24947 [2019-01-13 05:27:47,519 INFO L226 Difference]: Without dead ends: 24947 [2019-01-13 05:27:47,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 05:27:47,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24947 states. [2019-01-13 05:27:47,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24947 to 22467. [2019-01-13 05:27:47,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22467 states. [2019-01-13 05:27:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22467 states to 22467 states and 72190 transitions. [2019-01-13 05:27:47,880 INFO L78 Accepts]: Start accepts. Automaton has 22467 states and 72190 transitions. Word has length 72 [2019-01-13 05:27:47,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:47,880 INFO L480 AbstractCegarLoop]: Abstraction has 22467 states and 72190 transitions. [2019-01-13 05:27:47,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 05:27:47,880 INFO L276 IsEmpty]: Start isEmpty. Operand 22467 states and 72190 transitions. [2019-01-13 05:27:47,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-13 05:27:47,908 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:47,908 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] [2019-01-13 05:27:47,908 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:47,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:47,909 INFO L82 PathProgramCache]: Analyzing trace with hash -671189007, now seen corresponding path program 1 times [2019-01-13 05:27:47,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:47,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:47,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:47,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:47,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:48,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:48,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:48,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:27:48,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:27:48,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:27:48,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:27:48,165 INFO L87 Difference]: Start difference. First operand 22467 states and 72190 transitions. Second operand 4 states. [2019-01-13 05:27:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:48,930 INFO L93 Difference]: Finished difference Result 34667 states and 110116 transitions. [2019-01-13 05:27:48,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:27:48,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-01-13 05:27:48,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:48,997 INFO L225 Difference]: With dead ends: 34667 [2019-01-13 05:27:48,998 INFO L226 Difference]: Without dead ends: 34471 [2019-01-13 05:27:48,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:27:49,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34471 states. [2019-01-13 05:27:49,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34471 to 29099. [2019-01-13 05:27:49,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29099 states. [2019-01-13 05:27:49,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29099 states to 29099 states and 93336 transitions. [2019-01-13 05:27:49,997 INFO L78 Accepts]: Start accepts. Automaton has 29099 states and 93336 transitions. Word has length 76 [2019-01-13 05:27:49,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:49,997 INFO L480 AbstractCegarLoop]: Abstraction has 29099 states and 93336 transitions. [2019-01-13 05:27:49,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:27:49,998 INFO L276 IsEmpty]: Start isEmpty. Operand 29099 states and 93336 transitions. [2019-01-13 05:27:50,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-13 05:27:50,032 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:50,032 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] [2019-01-13 05:27:50,033 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:50,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:50,033 INFO L82 PathProgramCache]: Analyzing trace with hash 573575474, now seen corresponding path program 1 times [2019-01-13 05:27:50,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:50,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:50,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:50,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:50,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:50,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:50,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:27:50,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:27:50,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:27:50,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:27:50,315 INFO L87 Difference]: Start difference. First operand 29099 states and 93336 transitions. Second operand 6 states. [2019-01-13 05:27:51,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:51,382 INFO L93 Difference]: Finished difference Result 52152 states and 164833 transitions. [2019-01-13 05:27:51,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 05:27:51,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-01-13 05:27:51,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:51,483 INFO L225 Difference]: With dead ends: 52152 [2019-01-13 05:27:51,483 INFO L226 Difference]: Without dead ends: 51912 [2019-01-13 05:27:51,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:27:51,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51912 states. [2019-01-13 05:27:52,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51912 to 43712. [2019-01-13 05:27:52,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43712 states. [2019-01-13 05:27:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43712 states to 43712 states and 140003 transitions. [2019-01-13 05:27:52,239 INFO L78 Accepts]: Start accepts. Automaton has 43712 states and 140003 transitions. Word has length 76 [2019-01-13 05:27:52,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:52,240 INFO L480 AbstractCegarLoop]: Abstraction has 43712 states and 140003 transitions. [2019-01-13 05:27:52,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:27:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 43712 states and 140003 transitions. [2019-01-13 05:27:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-13 05:27:52,285 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:52,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, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:52,285 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:52,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:52,286 INFO L82 PathProgramCache]: Analyzing trace with hash -270896397, now seen corresponding path program 1 times [2019-01-13 05:27:52,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:52,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:52,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:52,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:52,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:52,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:52,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:52,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:27:52,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:27:52,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:27:52,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:27:52,461 INFO L87 Difference]: Start difference. First operand 43712 states and 140003 transitions. Second operand 5 states. [2019-01-13 05:27:52,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:52,567 INFO L93 Difference]: Finished difference Result 5456 states and 14431 transitions. [2019-01-13 05:27:52,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 05:27:52,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-01-13 05:27:52,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:52,574 INFO L225 Difference]: With dead ends: 5456 [2019-01-13 05:27:52,575 INFO L226 Difference]: Without dead ends: 4832 [2019-01-13 05:27:52,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:27:52,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4832 states. [2019-01-13 05:27:52,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4832 to 4684. [2019-01-13 05:27:52,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4684 states. [2019-01-13 05:27:52,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 12409 transitions. [2019-01-13 05:27:52,629 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 12409 transitions. Word has length 76 [2019-01-13 05:27:52,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:52,629 INFO L480 AbstractCegarLoop]: Abstraction has 4684 states and 12409 transitions. [2019-01-13 05:27:52,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:27:52,630 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 12409 transitions. [2019-01-13 05:27:52,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:27:52,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:52,635 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] [2019-01-13 05:27:52,635 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:52,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:52,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1415378869, now seen corresponding path program 1 times [2019-01-13 05:27:52,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:52,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:52,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:52,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:52,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:52,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:52,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:27:52,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:27:52,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:27:52,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:27:52,772 INFO L87 Difference]: Start difference. First operand 4684 states and 12409 transitions. Second operand 5 states. [2019-01-13 05:27:53,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:53,039 INFO L93 Difference]: Finished difference Result 5468 states and 14247 transitions. [2019-01-13 05:27:53,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:27:53,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-01-13 05:27:53,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:53,048 INFO L225 Difference]: With dead ends: 5468 [2019-01-13 05:27:53,048 INFO L226 Difference]: Without dead ends: 5440 [2019-01-13 05:27:53,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:27:53,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2019-01-13 05:27:53,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5316. [2019-01-13 05:27:53,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5316 states. [2019-01-13 05:27:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 13901 transitions. [2019-01-13 05:27:53,107 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 13901 transitions. Word has length 89 [2019-01-13 05:27:53,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:53,108 INFO L480 AbstractCegarLoop]: Abstraction has 5316 states and 13901 transitions. [2019-01-13 05:27:53,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:27:53,108 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 13901 transitions. [2019-01-13 05:27:53,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:27:53,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:53,116 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] [2019-01-13 05:27:53,116 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:53,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:53,116 INFO L82 PathProgramCache]: Analyzing trace with hash -282188276, now seen corresponding path program 1 times [2019-01-13 05:27:53,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:53,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:53,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:53,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:53,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:53,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:53,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:53,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 05:27:53,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 05:27:53,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 05:27:53,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 05:27:53,251 INFO L87 Difference]: Start difference. First operand 5316 states and 13901 transitions. Second operand 3 states. [2019-01-13 05:27:53,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:53,937 INFO L93 Difference]: Finished difference Result 5440 states and 14174 transitions. [2019-01-13 05:27:53,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 05:27:53,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-01-13 05:27:53,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:53,946 INFO L225 Difference]: With dead ends: 5440 [2019-01-13 05:27:53,946 INFO L226 Difference]: Without dead ends: 5440 [2019-01-13 05:27:53,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 05:27:53,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2019-01-13 05:27:53,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5384. [2019-01-13 05:27:53,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5384 states. [2019-01-13 05:27:54,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 14051 transitions. [2019-01-13 05:27:54,004 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 14051 transitions. Word has length 89 [2019-01-13 05:27:54,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:54,004 INFO L480 AbstractCegarLoop]: Abstraction has 5384 states and 14051 transitions. [2019-01-13 05:27:54,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 05:27:54,005 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 14051 transitions. [2019-01-13 05:27:54,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:54,012 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:54,012 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] [2019-01-13 05:27:54,013 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:54,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:54,013 INFO L82 PathProgramCache]: Analyzing trace with hash -203880528, now seen corresponding path program 1 times [2019-01-13 05:27:54,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:54,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:54,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:54,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:54,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:54,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:54,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:54,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:27:54,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:27:54,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:27:54,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:27:54,198 INFO L87 Difference]: Start difference. First operand 5384 states and 14051 transitions. Second operand 4 states. [2019-01-13 05:27:54,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:54,400 INFO L93 Difference]: Finished difference Result 9734 states and 25760 transitions. [2019-01-13 05:27:54,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 05:27:54,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-13 05:27:54,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:54,416 INFO L225 Difference]: With dead ends: 9734 [2019-01-13 05:27:54,416 INFO L226 Difference]: Without dead ends: 9706 [2019-01-13 05:27:54,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:27:54,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9706 states. [2019-01-13 05:27:54,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9706 to 5140. [2019-01-13 05:27:54,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5140 states. [2019-01-13 05:27:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5140 states to 5140 states and 13376 transitions. [2019-01-13 05:27:54,495 INFO L78 Accepts]: Start accepts. Automaton has 5140 states and 13376 transitions. Word has length 91 [2019-01-13 05:27:54,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:54,496 INFO L480 AbstractCegarLoop]: Abstraction has 5140 states and 13376 transitions. [2019-01-13 05:27:54,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:27:54,496 INFO L276 IsEmpty]: Start isEmpty. Operand 5140 states and 13376 transitions. [2019-01-13 05:27:54,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:54,501 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:54,502 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] [2019-01-13 05:27:54,502 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:54,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:54,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1904621007, now seen corresponding path program 1 times [2019-01-13 05:27:54,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:54,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:54,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:54,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:54,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:54,659 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-13 05:27:54,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:54,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:54,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:27:54,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:27:54,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:27:54,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:27:54,740 INFO L87 Difference]: Start difference. First operand 5140 states and 13376 transitions. Second operand 6 states. [2019-01-13 05:27:55,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:55,143 INFO L93 Difference]: Finished difference Result 5643 states and 14543 transitions. [2019-01-13 05:27:55,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 05:27:55,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-13 05:27:55,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:55,153 INFO L225 Difference]: With dead ends: 5643 [2019-01-13 05:27:55,153 INFO L226 Difference]: Without dead ends: 5643 [2019-01-13 05:27:55,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:27:55,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2019-01-13 05:27:55,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5222. [2019-01-13 05:27:55,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5222 states. [2019-01-13 05:27:55,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 13576 transitions. [2019-01-13 05:27:55,215 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 13576 transitions. Word has length 91 [2019-01-13 05:27:55,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:55,215 INFO L480 AbstractCegarLoop]: Abstraction has 5222 states and 13576 transitions. [2019-01-13 05:27:55,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:27:55,215 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 13576 transitions. [2019-01-13 05:27:55,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:55,225 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:55,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:27:55,225 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:55,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:55,225 INFO L82 PathProgramCache]: Analyzing trace with hash -935039984, now seen corresponding path program 1 times [2019-01-13 05:27:55,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:55,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:55,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:55,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:55,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:55,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:55,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:27:55,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:27:55,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:27:55,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:27:55,423 INFO L87 Difference]: Start difference. First operand 5222 states and 13576 transitions. Second operand 7 states. [2019-01-13 05:27:55,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:55,960 INFO L93 Difference]: Finished difference Result 5203 states and 13406 transitions. [2019-01-13 05:27:55,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 05:27:55,961 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-01-13 05:27:55,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:55,973 INFO L225 Difference]: With dead ends: 5203 [2019-01-13 05:27:55,973 INFO L226 Difference]: Without dead ends: 5178 [2019-01-13 05:27:55,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-13 05:27:55,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5178 states. [2019-01-13 05:27:56,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5178 to 4801. [2019-01-13 05:27:56,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4801 states. [2019-01-13 05:27:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4801 states to 4801 states and 12542 transitions. [2019-01-13 05:27:56,072 INFO L78 Accepts]: Start accepts. Automaton has 4801 states and 12542 transitions. Word has length 91 [2019-01-13 05:27:56,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:56,074 INFO L480 AbstractCegarLoop]: Abstraction has 4801 states and 12542 transitions. [2019-01-13 05:27:56,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:27:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 4801 states and 12542 transitions. [2019-01-13 05:27:56,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:56,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:56,085 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] [2019-01-13 05:27:56,086 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:56,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:56,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1383736623, now seen corresponding path program 1 times [2019-01-13 05:27:56,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:56,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:56,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:56,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:56,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:56,641 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2019-01-13 05:27:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:56,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:56,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:27:56,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:27:56,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:27:56,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:27:56,757 INFO L87 Difference]: Start difference. First operand 4801 states and 12542 transitions. Second operand 6 states. [2019-01-13 05:27:57,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:57,152 INFO L93 Difference]: Finished difference Result 4393 states and 11483 transitions. [2019-01-13 05:27:57,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:27:57,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-13 05:27:57,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:57,160 INFO L225 Difference]: With dead ends: 4393 [2019-01-13 05:27:57,160 INFO L226 Difference]: Without dead ends: 4393 [2019-01-13 05:27:57,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:27:57,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2019-01-13 05:27:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 4259. [2019-01-13 05:27:57,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4259 states. [2019-01-13 05:27:57,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4259 states to 4259 states and 11187 transitions. [2019-01-13 05:27:57,207 INFO L78 Accepts]: Start accepts. Automaton has 4259 states and 11187 transitions. Word has length 91 [2019-01-13 05:27:57,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:57,208 INFO L480 AbstractCegarLoop]: Abstraction has 4259 states and 11187 transitions. [2019-01-13 05:27:57,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:27:57,208 INFO L276 IsEmpty]: Start isEmpty. Operand 4259 states and 11187 transitions. [2019-01-13 05:27:57,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:57,213 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:57,213 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] [2019-01-13 05:27:57,213 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:57,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:57,213 INFO L82 PathProgramCache]: Analyzing trace with hash -82841607, now seen corresponding path program 1 times [2019-01-13 05:27:57,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:57,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:57,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:57,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:57,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:57,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:57,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:57,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:27:57,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:27:57,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:27:57,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:27:57,562 INFO L87 Difference]: Start difference. First operand 4259 states and 11187 transitions. Second operand 6 states. [2019-01-13 05:27:57,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:57,899 INFO L93 Difference]: Finished difference Result 5737 states and 14773 transitions. [2019-01-13 05:27:57,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:27:57,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-13 05:27:57,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:57,908 INFO L225 Difference]: With dead ends: 5737 [2019-01-13 05:27:57,908 INFO L226 Difference]: Without dead ends: 5705 [2019-01-13 05:27:57,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:27:57,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5705 states. [2019-01-13 05:27:57,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5705 to 4600. [2019-01-13 05:27:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4600 states. [2019-01-13 05:27:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4600 states to 4600 states and 11989 transitions. [2019-01-13 05:27:57,970 INFO L78 Accepts]: Start accepts. Automaton has 4600 states and 11989 transitions. Word has length 91 [2019-01-13 05:27:57,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:57,970 INFO L480 AbstractCegarLoop]: Abstraction has 4600 states and 11989 transitions. [2019-01-13 05:27:57,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:27:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 4600 states and 11989 transitions. [2019-01-13 05:27:57,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:57,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:57,976 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] [2019-01-13 05:27:57,976 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:57,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:57,976 INFO L82 PathProgramCache]: Analyzing trace with hash -365992071, now seen corresponding path program 1 times [2019-01-13 05:27:57,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:57,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:57,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:57,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:57,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:58,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:58,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:58,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:27:58,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:27:58,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:27:58,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:27:58,335 INFO L87 Difference]: Start difference. First operand 4600 states and 11989 transitions. Second operand 7 states. [2019-01-13 05:27:58,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:58,791 INFO L93 Difference]: Finished difference Result 8360 states and 22331 transitions. [2019-01-13 05:27:58,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 05:27:58,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-01-13 05:27:58,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:58,804 INFO L225 Difference]: With dead ends: 8360 [2019-01-13 05:27:58,804 INFO L226 Difference]: Without dead ends: 8360 [2019-01-13 05:27:58,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-13 05:27:58,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8360 states. [2019-01-13 05:27:58,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8360 to 5036. [2019-01-13 05:27:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5036 states. [2019-01-13 05:27:58,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5036 states to 5036 states and 13135 transitions. [2019-01-13 05:27:58,876 INFO L78 Accepts]: Start accepts. Automaton has 5036 states and 13135 transitions. Word has length 91 [2019-01-13 05:27:58,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:58,877 INFO L480 AbstractCegarLoop]: Abstraction has 5036 states and 13135 transitions. [2019-01-13 05:27:58,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:27:58,877 INFO L276 IsEmpty]: Start isEmpty. Operand 5036 states and 13135 transitions. [2019-01-13 05:27:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:58,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:58,883 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] [2019-01-13 05:27:58,883 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:58,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:58,883 INFO L82 PathProgramCache]: Analyzing trace with hash 878772410, now seen corresponding path program 1 times [2019-01-13 05:27:58,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:58,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:58,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:58,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:58,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:59,374 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 6 [2019-01-13 05:27:59,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:59,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:59,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:27:59,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:27:59,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:27:59,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:27:59,520 INFO L87 Difference]: Start difference. First operand 5036 states and 13135 transitions. Second operand 6 states. [2019-01-13 05:27:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:27:59,596 INFO L93 Difference]: Finished difference Result 7806 states and 20863 transitions. [2019-01-13 05:27:59,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 05:27:59,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-13 05:27:59,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:27:59,607 INFO L225 Difference]: With dead ends: 7806 [2019-01-13 05:27:59,608 INFO L226 Difference]: Without dead ends: 7806 [2019-01-13 05:27:59,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:27:59,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7806 states. [2019-01-13 05:27:59,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7806 to 4716. [2019-01-13 05:27:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4716 states. [2019-01-13 05:27:59,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4716 states to 4716 states and 12277 transitions. [2019-01-13 05:27:59,678 INFO L78 Accepts]: Start accepts. Automaton has 4716 states and 12277 transitions. Word has length 91 [2019-01-13 05:27:59,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:27:59,678 INFO L480 AbstractCegarLoop]: Abstraction has 4716 states and 12277 transitions. [2019-01-13 05:27:59,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:27:59,678 INFO L276 IsEmpty]: Start isEmpty. Operand 4716 states and 12277 transitions. [2019-01-13 05:27:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:27:59,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:27:59,684 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] [2019-01-13 05:27:59,684 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:27:59,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:27:59,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1359488826, now seen corresponding path program 1 times [2019-01-13 05:27:59,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:27:59,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:27:59,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:59,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:27:59,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:27:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:27:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:27:59,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:27:59,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:27:59,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:27:59,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:27:59,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:27:59,904 INFO L87 Difference]: Start difference. First operand 4716 states and 12277 transitions. Second operand 6 states. [2019-01-13 05:28:00,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:00,159 INFO L93 Difference]: Finished difference Result 4076 states and 10405 transitions. [2019-01-13 05:28:00,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:28:00,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-13 05:28:00,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:00,166 INFO L225 Difference]: With dead ends: 4076 [2019-01-13 05:28:00,166 INFO L226 Difference]: Without dead ends: 4076 [2019-01-13 05:28:00,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:28:00,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2019-01-13 05:28:00,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 3489. [2019-01-13 05:28:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3489 states. [2019-01-13 05:28:00,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 9041 transitions. [2019-01-13 05:28:00,206 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 9041 transitions. Word has length 91 [2019-01-13 05:28:00,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:00,206 INFO L480 AbstractCegarLoop]: Abstraction has 3489 states and 9041 transitions. [2019-01-13 05:28:00,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:28:00,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 9041 transitions. [2019-01-13 05:28:00,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:28:00,211 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:00,211 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] [2019-01-13 05:28:00,211 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:00,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:00,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1413527866, now seen corresponding path program 1 times [2019-01-13 05:28:00,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:00,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:00,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:00,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:00,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:00,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:00,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:00,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:28:00,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:28:00,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:28:00,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:28:00,446 INFO L87 Difference]: Start difference. First operand 3489 states and 9041 transitions. Second operand 6 states. [2019-01-13 05:28:00,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:00,865 INFO L93 Difference]: Finished difference Result 3702 states and 9446 transitions. [2019-01-13 05:28:00,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:28:00,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-13 05:28:00,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:00,872 INFO L225 Difference]: With dead ends: 3702 [2019-01-13 05:28:00,872 INFO L226 Difference]: Without dead ends: 3657 [2019-01-13 05:28:00,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:28:00,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3657 states. [2019-01-13 05:28:00,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3657 to 3597. [2019-01-13 05:28:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3597 states. [2019-01-13 05:28:00,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 9246 transitions. [2019-01-13 05:28:00,910 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 9246 transitions. Word has length 93 [2019-01-13 05:28:00,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:00,910 INFO L480 AbstractCegarLoop]: Abstraction has 3597 states and 9246 transitions. [2019-01-13 05:28:00,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:28:00,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 9246 transitions. [2019-01-13 05:28:00,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:28:00,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:00,914 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] [2019-01-13 05:28:00,914 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:00,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:00,915 INFO L82 PathProgramCache]: Analyzing trace with hash -522132421, now seen corresponding path program 1 times [2019-01-13 05:28:00,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:00,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:00,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:00,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:00,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:01,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:01,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:28:01,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:28:01,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:28:01,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:28:01,497 INFO L87 Difference]: Start difference. First operand 3597 states and 9246 transitions. Second operand 7 states. [2019-01-13 05:28:03,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:03,574 INFO L93 Difference]: Finished difference Result 5508 states and 13847 transitions. [2019-01-13 05:28:03,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 05:28:03,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-13 05:28:03,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:03,586 INFO L225 Difference]: With dead ends: 5508 [2019-01-13 05:28:03,586 INFO L226 Difference]: Without dead ends: 5476 [2019-01-13 05:28:03,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-01-13 05:28:03,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5476 states. [2019-01-13 05:28:03,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5476 to 4226. [2019-01-13 05:28:03,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4226 states. [2019-01-13 05:28:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4226 states to 4226 states and 10779 transitions. [2019-01-13 05:28:03,665 INFO L78 Accepts]: Start accepts. Automaton has 4226 states and 10779 transitions. Word has length 93 [2019-01-13 05:28:03,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:03,666 INFO L480 AbstractCegarLoop]: Abstraction has 4226 states and 10779 transitions. [2019-01-13 05:28:03,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:28:03,666 INFO L276 IsEmpty]: Start isEmpty. Operand 4226 states and 10779 transitions. [2019-01-13 05:28:03,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:28:03,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:03,674 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] [2019-01-13 05:28:03,674 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:03,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:03,674 INFO L82 PathProgramCache]: Analyzing trace with hash 722632060, now seen corresponding path program 1 times [2019-01-13 05:28:03,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:03,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:03,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:03,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:03,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:03,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:03,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:03,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:28:03,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:28:03,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:28:03,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:28:03,952 INFO L87 Difference]: Start difference. First operand 4226 states and 10779 transitions. Second operand 6 states. [2019-01-13 05:28:04,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:04,104 INFO L93 Difference]: Finished difference Result 4301 states and 10863 transitions. [2019-01-13 05:28:04,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 05:28:04,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-13 05:28:04,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:04,111 INFO L225 Difference]: With dead ends: 4301 [2019-01-13 05:28:04,111 INFO L226 Difference]: Without dead ends: 4301 [2019-01-13 05:28:04,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 05:28:04,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4301 states. [2019-01-13 05:28:04,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4301 to 4171. [2019-01-13 05:28:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4171 states. [2019-01-13 05:28:04,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 10618 transitions. [2019-01-13 05:28:04,156 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 10618 transitions. Word has length 93 [2019-01-13 05:28:04,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:04,156 INFO L480 AbstractCegarLoop]: Abstraction has 4171 states and 10618 transitions. [2019-01-13 05:28:04,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:28:04,156 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 10618 transitions. [2019-01-13 05:28:04,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:28:04,161 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:04,161 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] [2019-01-13 05:28:04,161 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:04,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:04,161 INFO L82 PathProgramCache]: Analyzing trace with hash -192366660, now seen corresponding path program 1 times [2019-01-13 05:28:04,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:04,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:04,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:04,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:04,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:04,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:04,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:28:04,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:28:04,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:28:04,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:28:04,543 INFO L87 Difference]: Start difference. First operand 4171 states and 10618 transitions. Second operand 5 states. [2019-01-13 05:28:05,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:05,110 INFO L93 Difference]: Finished difference Result 4715 states and 11962 transitions. [2019-01-13 05:28:05,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:28:05,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-01-13 05:28:05,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:05,118 INFO L225 Difference]: With dead ends: 4715 [2019-01-13 05:28:05,118 INFO L226 Difference]: Without dead ends: 4683 [2019-01-13 05:28:05,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:28:05,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4683 states. [2019-01-13 05:28:05,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4683 to 3650. [2019-01-13 05:28:05,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3650 states. [2019-01-13 05:28:05,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 9341 transitions. [2019-01-13 05:28:05,163 INFO L78 Accepts]: Start accepts. Automaton has 3650 states and 9341 transitions. Word has length 93 [2019-01-13 05:28:05,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:05,163 INFO L480 AbstractCegarLoop]: Abstraction has 3650 states and 9341 transitions. [2019-01-13 05:28:05,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:28:05,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3650 states and 9341 transitions. [2019-01-13 05:28:05,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:28:05,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:05,168 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] [2019-01-13 05:28:05,169 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:05,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:05,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1052397821, now seen corresponding path program 1 times [2019-01-13 05:28:05,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:05,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:05,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:05,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:05,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:05,362 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 05:28:05,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:05,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:05,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:28:05,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:28:05,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:28:05,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:28:05,407 INFO L87 Difference]: Start difference. First operand 3650 states and 9341 transitions. Second operand 7 states. [2019-01-13 05:28:05,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:05,736 INFO L93 Difference]: Finished difference Result 5475 states and 14168 transitions. [2019-01-13 05:28:05,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:28:05,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-13 05:28:05,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:05,740 INFO L225 Difference]: With dead ends: 5475 [2019-01-13 05:28:05,741 INFO L226 Difference]: Without dead ends: 1974 [2019-01-13 05:28:05,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:28:05,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2019-01-13 05:28:05,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1974. [2019-01-13 05:28:05,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1974 states. [2019-01-13 05:28:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 5105 transitions. [2019-01-13 05:28:05,767 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 5105 transitions. Word has length 93 [2019-01-13 05:28:05,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:05,768 INFO L480 AbstractCegarLoop]: Abstraction has 1974 states and 5105 transitions. [2019-01-13 05:28:05,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:28:05,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 5105 transitions. [2019-01-13 05:28:05,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:28:05,771 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:05,771 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] [2019-01-13 05:28:05,771 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:05,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:05,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1042938802, now seen corresponding path program 1 times [2019-01-13 05:28:05,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:05,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:05,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:05,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:05,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:06,625 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-01-13 05:28:06,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:06,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:06,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:28:06,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:28:06,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:28:06,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:28:06,653 INFO L87 Difference]: Start difference. First operand 1974 states and 5105 transitions. Second operand 7 states. [2019-01-13 05:28:07,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:07,192 INFO L93 Difference]: Finished difference Result 1988 states and 5137 transitions. [2019-01-13 05:28:07,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:28:07,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-13 05:28:07,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:07,197 INFO L225 Difference]: With dead ends: 1988 [2019-01-13 05:28:07,197 INFO L226 Difference]: Without dead ends: 1988 [2019-01-13 05:28:07,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:28:07,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2019-01-13 05:28:07,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1950. [2019-01-13 05:28:07,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2019-01-13 05:28:07,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 5057 transitions. [2019-01-13 05:28:07,224 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 5057 transitions. Word has length 93 [2019-01-13 05:28:07,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:07,225 INFO L480 AbstractCegarLoop]: Abstraction has 1950 states and 5057 transitions. [2019-01-13 05:28:07,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:28:07,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 5057 transitions. [2019-01-13 05:28:07,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:28:07,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:07,228 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] [2019-01-13 05:28:07,228 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:07,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:07,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1157749772, now seen corresponding path program 2 times [2019-01-13 05:28:07,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:07,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:07,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:07,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:07,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:07,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:07,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:07,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 05:28:07,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 05:28:07,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 05:28:07,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:28:07,443 INFO L87 Difference]: Start difference. First operand 1950 states and 5057 transitions. Second operand 8 states. [2019-01-13 05:28:07,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:07,986 INFO L93 Difference]: Finished difference Result 2282 states and 5776 transitions. [2019-01-13 05:28:07,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 05:28:07,987 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2019-01-13 05:28:07,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:07,991 INFO L225 Difference]: With dead ends: 2282 [2019-01-13 05:28:07,991 INFO L226 Difference]: Without dead ends: 2253 [2019-01-13 05:28:07,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-13 05:28:07,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2019-01-13 05:28:08,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 1942. [2019-01-13 05:28:08,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-01-13 05:28:08,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 5031 transitions. [2019-01-13 05:28:08,014 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 5031 transitions. Word has length 93 [2019-01-13 05:28:08,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:08,014 INFO L480 AbstractCegarLoop]: Abstraction has 1942 states and 5031 transitions. [2019-01-13 05:28:08,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 05:28:08,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 5031 transitions. [2019-01-13 05:28:08,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:28:08,017 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:08,017 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] [2019-01-13 05:28:08,017 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:08,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:08,018 INFO L82 PathProgramCache]: Analyzing trace with hash -777910515, now seen corresponding path program 2 times [2019-01-13 05:28:08,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:08,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:08,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:08,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:28:08,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:08,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:08,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:08,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 05:28:08,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 05:28:08,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 05:28:08,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-13 05:28:08,290 INFO L87 Difference]: Start difference. First operand 1942 states and 5031 transitions. Second operand 12 states. [2019-01-13 05:28:08,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:08,926 INFO L93 Difference]: Finished difference Result 3699 states and 9678 transitions. [2019-01-13 05:28:08,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 05:28:08,927 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2019-01-13 05:28:08,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:08,932 INFO L225 Difference]: With dead ends: 3699 [2019-01-13 05:28:08,932 INFO L226 Difference]: Without dead ends: 2563 [2019-01-13 05:28:08,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2019-01-13 05:28:08,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2019-01-13 05:28:08,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2411. [2019-01-13 05:28:08,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2019-01-13 05:28:08,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 6104 transitions. [2019-01-13 05:28:08,963 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 6104 transitions. Word has length 93 [2019-01-13 05:28:08,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:08,964 INFO L480 AbstractCegarLoop]: Abstraction has 2411 states and 6104 transitions. [2019-01-13 05:28:08,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 05:28:08,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 6104 transitions. [2019-01-13 05:28:08,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:28:08,968 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:08,968 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] [2019-01-13 05:28:08,968 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:08,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:08,969 INFO L82 PathProgramCache]: Analyzing trace with hash 45507955, now seen corresponding path program 3 times [2019-01-13 05:28:08,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:08,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:08,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:08,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:28:08,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 05:28:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 05:28:09,066 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 05:28:09,283 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 05:28:09,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 05:28:09 BasicIcfg [2019-01-13 05:28:09,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 05:28:09,286 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 05:28:09,286 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 05:28:09,286 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 05:28:09,289 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:27:26" (3/4) ... [2019-01-13 05:28:09,294 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 05:28:09,506 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 05:28:09,507 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 05:28:09,508 INFO L168 Benchmark]: Toolchain (without parser) took 45026.77 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 950.0 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-01-13 05:28:09,512 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:28:09,512 INFO L168 Benchmark]: CACSL2BoogieTranslator took 930.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -179.5 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2019-01-13 05:28:09,512 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.68 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-01-13 05:28:09,513 INFO L168 Benchmark]: Boogie Preprocessor took 41.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:28:09,513 INFO L168 Benchmark]: RCFGBuilder took 1197.64 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: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. [2019-01-13 05:28:09,513 INFO L168 Benchmark]: TraceAbstraction took 42539.62 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 635.0 MB in the end (delta: 437.2 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-01-13 05:28:09,514 INFO L168 Benchmark]: Witness Printer took 220.81 ms. Allocated memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 39.3 MB). Free memory was 635.0 MB in the beginning and 2.5 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. [2019-01-13 05:28:09,520 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.54 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 930.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -179.5 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 90.68 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.58 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 1197.64 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: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42539.62 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 635.0 MB in the end (delta: 437.2 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 220.81 ms. Allocated memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 39.3 MB). Free memory was 635.0 MB in the beginning and 2.5 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.4 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] [L672] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L673] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L675] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L677] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L678] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L679] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L680] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L681] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L682] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L683] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L684] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L685] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L686] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=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] [L687] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=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}] [L688] -1 int y$w_buff0; VAL [__unbuffered_cnt=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] [L689] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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] [L690] -1 int y$w_buff1; VAL [__unbuffered_cnt=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] [L691] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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] [L692] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L693] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L753] -1 pthread_t t2479; VAL [__unbuffered_cnt=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] [L754] FCALL, FORK -1 pthread_create(&t2479, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L755] -1 pthread_t t2480; VAL [__unbuffered_cnt=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] [L756] FCALL, FORK -1 pthread_create(&t2480, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L697] 0 y$w_buff1 = y$w_buff0 [L698] 0 y$w_buff0 = 2 [L699] 0 y$w_buff1_used = y$w_buff0_used [L700] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=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] [L702] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L703] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L704] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L705] 0 y$r_buff0_thd1 = (_Bool)1 [L708] 0 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 x = 2 [L728] 1 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L712] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L712] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L731] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L731] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L714] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L718] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] -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) [L763] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L764] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] -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 [L765] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L766] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] -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 [L769] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L770] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L771] -1 y$flush_delayed = weak$$choice2 [L772] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] -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) [L774] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] -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)) [L775] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -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)) [L776] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] -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)) [L777] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -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)) [L778] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -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)) [L779] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -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)) [L780] -1 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y = y$flush_delayed ? y$mem_tmp : y [L782] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 178 locations, 3 error locations. UNSAFE Result, 42.4s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 21.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7075 SDtfs, 6296 SDslu, 16016 SDs, 0 SdLazy, 6614 SolverSat, 377 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 85 SyntacticMatches, 16 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43712occurred 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: 9.5s AutomataMinimizationTime, 30 MinimizatonAttempts, 92793 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 2453 NumberOfCodeBlocks, 2453 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2330 ConstructedInterpolants, 0 QuantifiedInterpolants, 460278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...