./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix048_rmo.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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/mix048_rmo.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68da3b538ab0b104fb53630070700dc628f5298d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-91b1670 [2018-11-28 20:10:50,983 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 20:10:50,985 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 20:10:51,006 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 20:10:51,007 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 20:10:51,008 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 20:10:51,011 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 20:10:51,013 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 20:10:51,015 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 20:10:51,016 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 20:10:51,017 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 20:10:51,017 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 20:10:51,018 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 20:10:51,019 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 20:10:51,020 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 20:10:51,021 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 20:10:51,022 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 20:10:51,023 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 20:10:51,026 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 20:10:51,027 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 20:10:51,028 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 20:10:51,029 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 20:10:51,032 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 20:10:51,032 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 20:10:51,032 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 20:10:51,033 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 20:10:51,034 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 20:10:51,035 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 20:10:51,036 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 20:10:51,037 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 20:10:51,037 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 20:10:51,038 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 20:10:51,038 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 20:10:51,038 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 20:10:51,043 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 20:10:51,043 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 20:10:51,046 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 20:10:51,073 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 20:10:51,073 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 20:10:51,074 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 20:10:51,074 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 20:10:51,075 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 20:10:51,075 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 20:10:51,075 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 20:10:51,076 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 20:10:51,076 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 20:10:51,076 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 20:10:51,076 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 20:10:51,076 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 20:10:51,077 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 20:10:51,077 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 20:10:51,077 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 20:10:51,077 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 20:10:51,077 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 20:10:51,077 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 20:10:51,078 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 20:10:51,078 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 20:10:51,078 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 20:10:51,078 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 20:10:51,078 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 20:10:51,078 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:10:51,079 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 20:10:51,079 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 20:10:51,079 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 20:10:51,079 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 20:10:51,079 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 20:10:51,080 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 20:10:51,080 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 -> 68da3b538ab0b104fb53630070700dc628f5298d [2018-11-28 20:10:51,115 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 20:10:51,130 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 20:10:51,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 20:10:51,136 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 20:10:51,137 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 20:10:51,138 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix048_rmo.oepc_false-unreach-call.i [2018-11-28 20:10:51,209 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8f6e1b23/b131b4561ab240bcb2174247fb6932f5/FLAG85af57a5c [2018-11-28 20:10:51,702 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 20:10:51,703 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix048_rmo.oepc_false-unreach-call.i [2018-11-28 20:10:51,722 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8f6e1b23/b131b4561ab240bcb2174247fb6932f5/FLAG85af57a5c [2018-11-28 20:10:51,999 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8f6e1b23/b131b4561ab240bcb2174247fb6932f5 [2018-11-28 20:10:52,003 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 20:10:52,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 20:10:52,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 20:10:52,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 20:10:52,011 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 20:10:52,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:10:52" (1/1) ... [2018-11-28 20:10:52,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1223999a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:52, skipping insertion in model container [2018-11-28 20:10:52,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:10:52" (1/1) ... [2018-11-28 20:10:52,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 20:10:52,092 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 20:10:52,643 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:10:52,674 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 20:10:52,838 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:10:52,916 INFO L195 MainTranslator]: Completed translation [2018-11-28 20:10:52,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:52 WrapperNode [2018-11-28 20:10:52,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 20:10:52,918 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 20:10:52,918 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 20:10:52,918 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 20:10:52,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:52" (1/1) ... [2018-11-28 20:10:52,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:52" (1/1) ... [2018-11-28 20:10:52,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 20:10:52,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 20:10:52,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 20:10:52,988 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 20:10:53,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:52" (1/1) ... [2018-11-28 20:10:53,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:52" (1/1) ... [2018-11-28 20:10:53,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:52" (1/1) ... [2018-11-28 20:10:53,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:52" (1/1) ... [2018-11-28 20:10:53,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:52" (1/1) ... [2018-11-28 20:10:53,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:52" (1/1) ... [2018-11-28 20:10:53,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:52" (1/1) ... [2018-11-28 20:10:53,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 20:10:53,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 20:10:53,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 20:10:53,054 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 20:10:53,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:10:53,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 20:10:53,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 20:10:53,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 20:10:53,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 20:10:53,134 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 20:10:53,134 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 20:10:53,134 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 20:10:53,135 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 20:10:53,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 20:10:53,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 20:10:53,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 20:10:53,136 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 20:10:54,288 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 20:10:54,288 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 20:10:54,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:10:54 BoogieIcfgContainer [2018-11-28 20:10:54,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 20:10:54,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 20:10:54,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 20:10:54,293 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 20:10:54,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:10:52" (1/3) ... [2018-11-28 20:10:54,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b548ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:10:54, skipping insertion in model container [2018-11-28 20:10:54,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:52" (2/3) ... [2018-11-28 20:10:54,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b548ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:10:54, skipping insertion in model container [2018-11-28 20:10:54,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:10:54" (3/3) ... [2018-11-28 20:10:54,300 INFO L112 eAbstractionObserver]: Analyzing ICFG mix048_rmo.oepc_false-unreach-call.i [2018-11-28 20:10:54,356 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,356 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,357 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,357 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,357 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,358 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,358 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,358 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,358 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,359 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,359 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,359 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,360 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,360 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,360 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,360 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,360 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,361 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,361 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,361 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,361 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,364 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,364 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,364 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,364 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,365 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,365 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,365 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,365 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,368 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,369 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,369 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,371 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,371 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,371 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,372 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,372 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,372 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,372 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,372 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,372 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,372 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,381 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,381 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,384 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,384 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,384 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,384 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,384 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,414 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,414 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,414 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,414 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,414 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,420 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,420 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,420 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,421 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,421 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,422 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,422 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:10:54,462 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 20:10:54,463 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 20:10:54,475 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 20:10:54,495 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 20:10:54,523 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 20:10:54,524 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 20:10:54,524 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 20:10:54,524 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 20:10:54,524 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 20:10:54,524 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 20:10:54,524 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 20:10:54,524 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 20:10:54,525 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 20:10:54,538 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-11-28 20:10:57,123 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-11-28 20:10:57,126 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-11-28 20:10:57,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 20:10:57,134 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:10:57,135 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] [2018-11-28 20:10:57,137 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:10:57,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:10:57,143 INFO L82 PathProgramCache]: Analyzing trace with hash -454041356, now seen corresponding path program 1 times [2018-11-28 20:10:57,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:10:57,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:10:57,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:57,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:10:57,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:10:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:10:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:10:57,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:10:57,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:10:57,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:10:57,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:10:57,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:10:57,563 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-11-28 20:10:59,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:10:59,062 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-11-28 20:10:59,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:10:59,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-11-28 20:10:59,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:10:59,447 INFO L225 Difference]: With dead ends: 60790 [2018-11-28 20:10:59,448 INFO L226 Difference]: Without dead ends: 44270 [2018-11-28 20:10:59,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:10:59,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-11-28 20:11:01,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-11-28 20:11:01,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-11-28 20:11:01,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-11-28 20:11:01,363 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-11-28 20:11:01,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:01,364 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-11-28 20:11:01,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:11:01,364 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-11-28 20:11:01,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 20:11:01,374 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:01,374 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:01,374 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:01,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:01,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1863363909, now seen corresponding path program 1 times [2018-11-28 20:11:01,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:01,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:01,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:01,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:01,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:01,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:01,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:01,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:11:01,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:11:01,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:11:01,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:11:01,514 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-11-28 20:11:01,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:01,842 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-11-28 20:11:01,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:11:01,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-28 20:11:01,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:01,889 INFO L225 Difference]: With dead ends: 8528 [2018-11-28 20:11:01,889 INFO L226 Difference]: Without dead ends: 7466 [2018-11-28 20:11:01,890 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 [2018-11-28 20:11:01,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-11-28 20:11:02,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-11-28 20:11:02,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-11-28 20:11:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-11-28 20:11:02,115 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-11-28 20:11:02,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:02,115 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-11-28 20:11:02,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:11:02,116 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-11-28 20:11:02,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 20:11:02,119 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:02,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:02,119 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:02,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:02,120 INFO L82 PathProgramCache]: Analyzing trace with hash 591681941, now seen corresponding path program 1 times [2018-11-28 20:11:02,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:02,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:02,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:02,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:02,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:02,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:02,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:11:02,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:11:02,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:11:02,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:11:02,447 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-11-28 20:11:04,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:04,248 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-11-28 20:11:04,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:11:04,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-28 20:11:04,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:04,308 INFO L225 Difference]: With dead ends: 13998 [2018-11-28 20:11:04,308 INFO L226 Difference]: Without dead ends: 13930 [2018-11-28 20:11:04,309 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 [2018-11-28 20:11:04,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-11-28 20:11:04,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-11-28 20:11:04,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-11-28 20:11:04,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-11-28 20:11:04,847 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-11-28 20:11:04,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:04,849 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-11-28 20:11:04,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:11:04,849 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-11-28 20:11:04,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 20:11:04,852 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:04,852 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] [2018-11-28 20:11:04,853 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:04,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:04,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1652121253, now seen corresponding path program 1 times [2018-11-28 20:11:04,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:04,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:04,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:04,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:04,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:04,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:04,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:04,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:11:04,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:11:04,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:11:04,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:11:04,958 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-11-28 20:11:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:05,202 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-11-28 20:11:05,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:11:05,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-28 20:11:05,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:05,248 INFO L225 Difference]: With dead ends: 13279 [2018-11-28 20:11:05,248 INFO L226 Difference]: Without dead ends: 13279 [2018-11-28 20:11:05,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:11:05,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-11-28 20:11:05,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-11-28 20:11:05,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-11-28 20:11:05,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-11-28 20:11:05,521 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-11-28 20:11:05,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:05,521 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-11-28 20:11:05,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:11:05,521 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-11-28 20:11:05,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 20:11:05,524 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:05,524 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] [2018-11-28 20:11:05,524 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:05,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:05,526 INFO L82 PathProgramCache]: Analyzing trace with hash -164023066, now seen corresponding path program 1 times [2018-11-28 20:11:05,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:05,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:05,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:05,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:05,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:05,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:05,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:05,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:11:05,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:11:05,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:11:05,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:11:05,745 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-11-28 20:11:07,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:07,139 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-11-28 20:11:07,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:11:07,140 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-11-28 20:11:07,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:07,170 INFO L225 Difference]: With dead ends: 12285 [2018-11-28 20:11:07,170 INFO L226 Difference]: Without dead ends: 12213 [2018-11-28 20:11:07,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-28 20:11:07,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-11-28 20:11:07,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-11-28 20:11:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-11-28 20:11:07,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-11-28 20:11:07,417 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-11-28 20:11:07,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:07,417 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-11-28 20:11:07,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:11:07,419 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-11-28 20:11:07,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 20:11:07,425 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:07,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:07,426 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:07,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:07,426 INFO L82 PathProgramCache]: Analyzing trace with hash 317195842, now seen corresponding path program 1 times [2018-11-28 20:11:07,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:07,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:07,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:07,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:07,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:07,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:07,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:11:07,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:11:07,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:11:07,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:11:07,654 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-11-28 20:11:07,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:07,917 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-11-28 20:11:07,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:11:07,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-11-28 20:11:07,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:07,945 INFO L225 Difference]: With dead ends: 12396 [2018-11-28 20:11:07,945 INFO L226 Difference]: Without dead ends: 12396 [2018-11-28 20:11:07,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:11:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-11-28 20:11:08,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-11-28 20:11:08,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-11-28 20:11:08,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-11-28 20:11:08,230 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-11-28 20:11:08,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:08,230 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-11-28 20:11:08,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:11:08,231 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-11-28 20:11:08,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 20:11:08,239 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:08,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:08,240 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:08,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:08,240 INFO L82 PathProgramCache]: Analyzing trace with hash 2060006177, now seen corresponding path program 1 times [2018-11-28 20:11:08,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:08,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:08,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:08,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:08,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:08,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:08,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:11:08,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:11:08,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:11:08,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:11:08,430 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-11-28 20:11:09,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:09,247 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-11-28 20:11:09,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:11:09,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-11-28 20:11:09,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:09,298 INFO L225 Difference]: With dead ends: 20969 [2018-11-28 20:11:09,299 INFO L226 Difference]: Without dead ends: 20898 [2018-11-28 20:11:09,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:11:09,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-11-28 20:11:09,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-11-28 20:11:09,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-11-28 20:11:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-11-28 20:11:09,953 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-11-28 20:11:09,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:09,954 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-11-28 20:11:09,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:11:09,954 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-11-28 20:11:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 20:11:09,971 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:09,972 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] [2018-11-28 20:11:09,972 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:09,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:09,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1699576415, now seen corresponding path program 1 times [2018-11-28 20:11:09,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:09,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:09,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:09,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:09,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:10,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:10,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:10,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:11:10,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:11:10,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:11:10,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:11:10,109 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-11-28 20:11:10,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:10,648 INFO L93 Difference]: Finished difference Result 17635 states and 54585 transitions. [2018-11-28 20:11:10,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:11:10,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-28 20:11:10,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:10,678 INFO L225 Difference]: With dead ends: 17635 [2018-11-28 20:11:10,678 INFO L226 Difference]: Without dead ends: 17635 [2018-11-28 20:11:10,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:11:10,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17635 states. [2018-11-28 20:11:10,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17635 to 15793. [2018-11-28 20:11:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15793 states. [2018-11-28 20:11:11,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15793 states to 15793 states and 49131 transitions. [2018-11-28 20:11:11,022 INFO L78 Accepts]: Start accepts. Automaton has 15793 states and 49131 transitions. Word has length 64 [2018-11-28 20:11:11,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:11,022 INFO L480 AbstractCegarLoop]: Abstraction has 15793 states and 49131 transitions. [2018-11-28 20:11:11,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:11:11,022 INFO L276 IsEmpty]: Start isEmpty. Operand 15793 states and 49131 transitions. [2018-11-28 20:11:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 20:11:11,037 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:11,037 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] [2018-11-28 20:11:11,037 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:11,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:11,038 INFO L82 PathProgramCache]: Analyzing trace with hash -377632928, now seen corresponding path program 1 times [2018-11-28 20:11:11,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:11,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:11,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:11,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:11,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:11,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:11,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:11,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:11:11,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:11:11,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:11:11,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:11:11,174 INFO L87 Difference]: Start difference. First operand 15793 states and 49131 transitions. Second operand 3 states. [2018-11-28 20:11:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:11,845 INFO L93 Difference]: Finished difference Result 16385 states and 50738 transitions. [2018-11-28 20:11:11,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:11:11,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-11-28 20:11:11,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:11,872 INFO L225 Difference]: With dead ends: 16385 [2018-11-28 20:11:11,872 INFO L226 Difference]: Without dead ends: 16385 [2018-11-28 20:11:11,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:11:11,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16385 states. [2018-11-28 20:11:12,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16385 to 16109. [2018-11-28 20:11:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16109 states. [2018-11-28 20:11:12,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16109 states to 16109 states and 49981 transitions. [2018-11-28 20:11:12,188 INFO L78 Accepts]: Start accepts. Automaton has 16109 states and 49981 transitions. Word has length 64 [2018-11-28 20:11:12,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:12,188 INFO L480 AbstractCegarLoop]: Abstraction has 16109 states and 49981 transitions. [2018-11-28 20:11:12,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:11:12,188 INFO L276 IsEmpty]: Start isEmpty. Operand 16109 states and 49981 transitions. [2018-11-28 20:11:12,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:11:12,203 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:12,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:12,204 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:12,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:12,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1938632710, now seen corresponding path program 1 times [2018-11-28 20:11:12,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:12,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:12,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:12,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:12,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:12,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:12,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:12,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:11:12,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:11:12,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:11:12,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:11:12,519 INFO L87 Difference]: Start difference. First operand 16109 states and 49981 transitions. Second operand 6 states. [2018-11-28 20:11:13,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:13,845 INFO L93 Difference]: Finished difference Result 19821 states and 60437 transitions. [2018-11-28 20:11:13,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:11:13,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-28 20:11:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:13,878 INFO L225 Difference]: With dead ends: 19821 [2018-11-28 20:11:13,879 INFO L226 Difference]: Without dead ends: 19821 [2018-11-28 20:11:13,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:11:13,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19821 states. [2018-11-28 20:11:14,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19821 to 18617. [2018-11-28 20:11:14,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18617 states. [2018-11-28 20:11:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 57217 transitions. [2018-11-28 20:11:14,428 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 57217 transitions. Word has length 66 [2018-11-28 20:11:14,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:14,429 INFO L480 AbstractCegarLoop]: Abstraction has 18617 states and 57217 transitions. [2018-11-28 20:11:14,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:11:14,429 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 57217 transitions. [2018-11-28 20:11:14,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:11:14,445 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:14,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:14,446 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:14,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:14,446 INFO L82 PathProgramCache]: Analyzing trace with hash -138576633, now seen corresponding path program 1 times [2018-11-28 20:11:14,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:14,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:14,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:14,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:14,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:14,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:14,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:14,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:11:14,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:11:14,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:11:14,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:11:14,746 INFO L87 Difference]: Start difference. First operand 18617 states and 57217 transitions. Second operand 6 states. [2018-11-28 20:11:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:15,322 INFO L93 Difference]: Finished difference Result 21449 states and 63626 transitions. [2018-11-28 20:11:15,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:11:15,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-28 20:11:15,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:15,360 INFO L225 Difference]: With dead ends: 21449 [2018-11-28 20:11:15,360 INFO L226 Difference]: Without dead ends: 21449 [2018-11-28 20:11:15,360 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 [2018-11-28 20:11:15,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21449 states. [2018-11-28 20:11:15,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21449 to 19133. [2018-11-28 20:11:15,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19133 states. [2018-11-28 20:11:15,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19133 states to 19133 states and 57764 transitions. [2018-11-28 20:11:15,684 INFO L78 Accepts]: Start accepts. Automaton has 19133 states and 57764 transitions. Word has length 66 [2018-11-28 20:11:15,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:15,684 INFO L480 AbstractCegarLoop]: Abstraction has 19133 states and 57764 transitions. [2018-11-28 20:11:15,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:11:15,684 INFO L276 IsEmpty]: Start isEmpty. Operand 19133 states and 57764 transitions. [2018-11-28 20:11:15,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:11:15,697 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:15,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:15,697 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:15,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:15,698 INFO L82 PathProgramCache]: Analyzing trace with hash 72774280, now seen corresponding path program 1 times [2018-11-28 20:11:15,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:15,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:15,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:15,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:15,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:16,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:16,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:16,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:11:16,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:11:16,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:11:16,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:11:16,090 INFO L87 Difference]: Start difference. First operand 19133 states and 57764 transitions. Second operand 5 states. [2018-11-28 20:11:17,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:17,231 INFO L93 Difference]: Finished difference Result 25024 states and 75018 transitions. [2018-11-28 20:11:17,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:11:17,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-28 20:11:17,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:17,280 INFO L225 Difference]: With dead ends: 25024 [2018-11-28 20:11:17,280 INFO L226 Difference]: Without dead ends: 25024 [2018-11-28 20:11:17,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:11:17,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25024 states. [2018-11-28 20:11:17,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25024 to 22709. [2018-11-28 20:11:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22709 states. [2018-11-28 20:11:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22709 states to 22709 states and 68032 transitions. [2018-11-28 20:11:17,745 INFO L78 Accepts]: Start accepts. Automaton has 22709 states and 68032 transitions. Word has length 66 [2018-11-28 20:11:17,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:17,745 INFO L480 AbstractCegarLoop]: Abstraction has 22709 states and 68032 transitions. [2018-11-28 20:11:17,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:11:17,745 INFO L276 IsEmpty]: Start isEmpty. Operand 22709 states and 68032 transitions. [2018-11-28 20:11:17,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:11:17,764 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:17,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:17,765 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:17,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:17,765 INFO L82 PathProgramCache]: Analyzing trace with hash -437759897, now seen corresponding path program 1 times [2018-11-28 20:11:17,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:17,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:17,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:17,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:17,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:17,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:17,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:17,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:11:17,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:11:17,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:11:17,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:11:17,900 INFO L87 Difference]: Start difference. First operand 22709 states and 68032 transitions. Second operand 4 states. [2018-11-28 20:11:18,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:18,640 INFO L93 Difference]: Finished difference Result 31689 states and 95699 transitions. [2018-11-28 20:11:18,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:11:18,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-28 20:11:18,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:18,697 INFO L225 Difference]: With dead ends: 31689 [2018-11-28 20:11:18,697 INFO L226 Difference]: Without dead ends: 31537 [2018-11-28 20:11:18,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:11:18,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31537 states. [2018-11-28 20:11:19,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31537 to 28553. [2018-11-28 20:11:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28553 states. [2018-11-28 20:11:19,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28553 states to 28553 states and 86263 transitions. [2018-11-28 20:11:19,300 INFO L78 Accepts]: Start accepts. Automaton has 28553 states and 86263 transitions. Word has length 66 [2018-11-28 20:11:19,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:19,301 INFO L480 AbstractCegarLoop]: Abstraction has 28553 states and 86263 transitions. [2018-11-28 20:11:19,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:11:19,301 INFO L276 IsEmpty]: Start isEmpty. Operand 28553 states and 86263 transitions. [2018-11-28 20:11:19,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:11:19,317 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:19,317 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:19,317 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:19,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:19,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1369694566, now seen corresponding path program 1 times [2018-11-28 20:11:19,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:19,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:19,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:19,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:19,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:19,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:19,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:19,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:11:19,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:11:19,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:11:19,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:11:19,747 INFO L87 Difference]: Start difference. First operand 28553 states and 86263 transitions. Second operand 5 states. [2018-11-28 20:11:20,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:20,645 INFO L93 Difference]: Finished difference Result 40195 states and 119844 transitions. [2018-11-28 20:11:20,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:11:20,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-28 20:11:20,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:20,711 INFO L225 Difference]: With dead ends: 40195 [2018-11-28 20:11:20,712 INFO L226 Difference]: Without dead ends: 39987 [2018-11-28 20:11:20,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:11:20,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39987 states. [2018-11-28 20:11:21,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39987 to 35807. [2018-11-28 20:11:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35807 states. [2018-11-28 20:11:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35807 states to 35807 states and 107399 transitions. [2018-11-28 20:11:21,225 INFO L78 Accepts]: Start accepts. Automaton has 35807 states and 107399 transitions. Word has length 66 [2018-11-28 20:11:21,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:21,225 INFO L480 AbstractCegarLoop]: Abstraction has 35807 states and 107399 transitions. [2018-11-28 20:11:21,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:11:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 35807 states and 107399 transitions. [2018-11-28 20:11:21,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:11:21,240 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:21,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:21,240 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:21,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:21,241 INFO L82 PathProgramCache]: Analyzing trace with hash 2060256040, now seen corresponding path program 1 times [2018-11-28 20:11:21,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:21,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:21,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:21,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:21,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:21,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:21,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:11:21,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:11:21,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:11:21,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:11:21,509 INFO L87 Difference]: Start difference. First operand 35807 states and 107399 transitions. Second operand 7 states. [2018-11-28 20:11:22,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:22,150 INFO L93 Difference]: Finished difference Result 31667 states and 90728 transitions. [2018-11-28 20:11:22,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:11:22,151 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-11-28 20:11:22,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:22,201 INFO L225 Difference]: With dead ends: 31667 [2018-11-28 20:11:22,201 INFO L226 Difference]: Without dead ends: 31667 [2018-11-28 20:11:22,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:11:22,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31667 states. [2018-11-28 20:11:22,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31667 to 25460. [2018-11-28 20:11:22,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25460 states. [2018-11-28 20:11:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25460 states to 25460 states and 73006 transitions. [2018-11-28 20:11:22,617 INFO L78 Accepts]: Start accepts. Automaton has 25460 states and 73006 transitions. Word has length 66 [2018-11-28 20:11:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:22,617 INFO L480 AbstractCegarLoop]: Abstraction has 25460 states and 73006 transitions. [2018-11-28 20:11:22,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:11:22,617 INFO L276 IsEmpty]: Start isEmpty. Operand 25460 states and 73006 transitions. [2018-11-28 20:11:22,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:11:22,631 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:22,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:22,631 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:22,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:22,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1347207575, now seen corresponding path program 1 times [2018-11-28 20:11:22,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:22,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:22,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:22,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:22,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:22,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:22,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:22,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:11:22,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:11:22,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:11:22,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:11:22,723 INFO L87 Difference]: Start difference. First operand 25460 states and 73006 transitions. Second operand 5 states. [2018-11-28 20:11:22,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:22,779 INFO L93 Difference]: Finished difference Result 7460 states and 17978 transitions. [2018-11-28 20:11:22,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:11:22,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-28 20:11:22,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:22,788 INFO L225 Difference]: With dead ends: 7460 [2018-11-28 20:11:22,788 INFO L226 Difference]: Without dead ends: 6135 [2018-11-28 20:11:22,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:11:22,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6135 states. [2018-11-28 20:11:22,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6135 to 5529. [2018-11-28 20:11:22,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5529 states. [2018-11-28 20:11:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5529 states to 5529 states and 12867 transitions. [2018-11-28 20:11:22,853 INFO L78 Accepts]: Start accepts. Automaton has 5529 states and 12867 transitions. Word has length 66 [2018-11-28 20:11:22,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:22,853 INFO L480 AbstractCegarLoop]: Abstraction has 5529 states and 12867 transitions. [2018-11-28 20:11:22,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:11:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand 5529 states and 12867 transitions. [2018-11-28 20:11:22,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:11:22,860 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:22,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:22,860 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:22,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:22,861 INFO L82 PathProgramCache]: Analyzing trace with hash 890203314, now seen corresponding path program 1 times [2018-11-28 20:11:22,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:22,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:22,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:22,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:22,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:22,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:22,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:22,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:11:22,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:11:22,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:11:22,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:11:22,933 INFO L87 Difference]: Start difference. First operand 5529 states and 12867 transitions. Second operand 3 states. [2018-11-28 20:11:23,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:23,177 INFO L93 Difference]: Finished difference Result 7165 states and 16473 transitions. [2018-11-28 20:11:23,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:11:23,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-28 20:11:23,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:23,190 INFO L225 Difference]: With dead ends: 7165 [2018-11-28 20:11:23,191 INFO L226 Difference]: Without dead ends: 7165 [2018-11-28 20:11:23,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:11:23,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7165 states. [2018-11-28 20:11:23,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7165 to 5468. [2018-11-28 20:11:23,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5468 states. [2018-11-28 20:11:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5468 states to 5468 states and 12407 transitions. [2018-11-28 20:11:23,297 INFO L78 Accepts]: Start accepts. Automaton has 5468 states and 12407 transitions. Word has length 66 [2018-11-28 20:11:23,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:23,298 INFO L480 AbstractCegarLoop]: Abstraction has 5468 states and 12407 transitions. [2018-11-28 20:11:23,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:11:23,298 INFO L276 IsEmpty]: Start isEmpty. Operand 5468 states and 12407 transitions. [2018-11-28 20:11:23,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 20:11:23,311 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:23,311 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] [2018-11-28 20:11:23,311 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:23,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:23,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1181781029, now seen corresponding path program 1 times [2018-11-28 20:11:23,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:23,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:23,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:23,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:23,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:23,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:23,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:23,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:11:23,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:11:23,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:11:23,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:11:23,630 INFO L87 Difference]: Start difference. First operand 5468 states and 12407 transitions. Second operand 5 states. [2018-11-28 20:11:23,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:23,810 INFO L93 Difference]: Finished difference Result 6622 states and 15012 transitions. [2018-11-28 20:11:23,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:11:23,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-11-28 20:11:23,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:23,819 INFO L225 Difference]: With dead ends: 6622 [2018-11-28 20:11:23,820 INFO L226 Difference]: Without dead ends: 6622 [2018-11-28 20:11:23,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:11:23,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6622 states. [2018-11-28 20:11:23,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6622 to 5912. [2018-11-28 20:11:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5912 states. [2018-11-28 20:11:23,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5912 states to 5912 states and 13411 transitions. [2018-11-28 20:11:23,886 INFO L78 Accepts]: Start accepts. Automaton has 5912 states and 13411 transitions. Word has length 72 [2018-11-28 20:11:23,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:23,887 INFO L480 AbstractCegarLoop]: Abstraction has 5912 states and 13411 transitions. [2018-11-28 20:11:23,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:11:23,887 INFO L276 IsEmpty]: Start isEmpty. Operand 5912 states and 13411 transitions. [2018-11-28 20:11:23,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 20:11:23,893 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:23,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:23,894 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:23,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:23,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1370375932, now seen corresponding path program 1 times [2018-11-28 20:11:23,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:23,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:23,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:23,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:23,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:24,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:24,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:11:24,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:11:24,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:11:24,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:11:24,136 INFO L87 Difference]: Start difference. First operand 5912 states and 13411 transitions. Second operand 9 states. [2018-11-28 20:11:24,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:24,876 INFO L93 Difference]: Finished difference Result 7374 states and 16560 transitions. [2018-11-28 20:11:24,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 20:11:24,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-11-28 20:11:24,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:24,885 INFO L225 Difference]: With dead ends: 7374 [2018-11-28 20:11:24,886 INFO L226 Difference]: Without dead ends: 7272 [2018-11-28 20:11:24,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-28 20:11:24,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7272 states. [2018-11-28 20:11:24,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7272 to 6009. [2018-11-28 20:11:24,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6009 states. [2018-11-28 20:11:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6009 states to 6009 states and 13504 transitions. [2018-11-28 20:11:24,995 INFO L78 Accepts]: Start accepts. Automaton has 6009 states and 13504 transitions. Word has length 72 [2018-11-28 20:11:24,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:24,995 INFO L480 AbstractCegarLoop]: Abstraction has 6009 states and 13504 transitions. [2018-11-28 20:11:24,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:11:24,995 INFO L276 IsEmpty]: Start isEmpty. Operand 6009 states and 13504 transitions. [2018-11-28 20:11:25,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:11:25,003 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:25,003 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] [2018-11-28 20:11:25,003 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:25,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:25,004 INFO L82 PathProgramCache]: Analyzing trace with hash 717362505, now seen corresponding path program 1 times [2018-11-28 20:11:25,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:25,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:25,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:25,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:25,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:25,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:25,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:11:25,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:11:25,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:11:25,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:11:25,221 INFO L87 Difference]: Start difference. First operand 6009 states and 13504 transitions. Second operand 7 states. [2018-11-28 20:11:27,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:27,419 INFO L93 Difference]: Finished difference Result 7489 states and 16833 transitions. [2018-11-28 20:11:27,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:11:27,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-11-28 20:11:27,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:27,429 INFO L225 Difference]: With dead ends: 7489 [2018-11-28 20:11:27,429 INFO L226 Difference]: Without dead ends: 7489 [2018-11-28 20:11:27,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:11:27,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7489 states. [2018-11-28 20:11:27,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7489 to 6149. [2018-11-28 20:11:27,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6149 states. [2018-11-28 20:11:27,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6149 states to 6149 states and 13892 transitions. [2018-11-28 20:11:27,508 INFO L78 Accepts]: Start accepts. Automaton has 6149 states and 13892 transitions. Word has length 93 [2018-11-28 20:11:27,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:27,508 INFO L480 AbstractCegarLoop]: Abstraction has 6149 states and 13892 transitions. [2018-11-28 20:11:27,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:11:27,508 INFO L276 IsEmpty]: Start isEmpty. Operand 6149 states and 13892 transitions. [2018-11-28 20:11:27,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:11:27,516 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:27,516 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] [2018-11-28 20:11:27,517 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:27,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:27,517 INFO L82 PathProgramCache]: Analyzing trace with hash -116879890, now seen corresponding path program 1 times [2018-11-28 20:11:27,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:27,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:27,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:27,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:27,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:27,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:27,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:11:27,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:11:27,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:11:27,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:11:27,734 INFO L87 Difference]: Start difference. First operand 6149 states and 13892 transitions. Second operand 4 states. [2018-11-28 20:11:27,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:27,858 INFO L93 Difference]: Finished difference Result 7316 states and 16390 transitions. [2018-11-28 20:11:27,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:11:27,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-28 20:11:27,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:27,867 INFO L225 Difference]: With dead ends: 7316 [2018-11-28 20:11:27,868 INFO L226 Difference]: Without dead ends: 7316 [2018-11-28 20:11:27,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:11:27,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7316 states. [2018-11-28 20:11:27,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7316 to 6506. [2018-11-28 20:11:27,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6506 states. [2018-11-28 20:11:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 14662 transitions. [2018-11-28 20:11:27,947 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 14662 transitions. Word has length 93 [2018-11-28 20:11:27,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:27,947 INFO L480 AbstractCegarLoop]: Abstraction has 6506 states and 14662 transitions. [2018-11-28 20:11:27,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:11:27,948 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 14662 transitions. [2018-11-28 20:11:27,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:11:27,955 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:27,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:27,956 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:27,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:27,956 INFO L82 PathProgramCache]: Analyzing trace with hash -371913804, now seen corresponding path program 1 times [2018-11-28 20:11:27,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:27,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:27,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:27,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:27,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:28,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:28,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:11:28,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:11:28,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:11:28,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:11:28,202 INFO L87 Difference]: Start difference. First operand 6506 states and 14662 transitions. Second operand 5 states. [2018-11-28 20:11:28,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:28,391 INFO L93 Difference]: Finished difference Result 7013 states and 15750 transitions. [2018-11-28 20:11:28,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:11:28,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-11-28 20:11:28,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:28,399 INFO L225 Difference]: With dead ends: 7013 [2018-11-28 20:11:28,400 INFO L226 Difference]: Without dead ends: 7013 [2018-11-28 20:11:28,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:11:28,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7013 states. [2018-11-28 20:11:28,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7013 to 5402. [2018-11-28 20:11:28,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5402 states. [2018-11-28 20:11:28,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 12178 transitions. [2018-11-28 20:11:28,462 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 12178 transitions. Word has length 95 [2018-11-28 20:11:28,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:28,463 INFO L480 AbstractCegarLoop]: Abstraction has 5402 states and 12178 transitions. [2018-11-28 20:11:28,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:11:28,463 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 12178 transitions. [2018-11-28 20:11:28,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:11:28,470 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:28,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:28,470 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:28,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:28,471 INFO L82 PathProgramCache]: Analyzing trace with hash -360597677, now seen corresponding path program 1 times [2018-11-28 20:11:28,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:28,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:28,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:28,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:28,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:28,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:28,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:28,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 20:11:28,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 20:11:28,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 20:11:28,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:11:28,770 INFO L87 Difference]: Start difference. First operand 5402 states and 12178 transitions. Second operand 11 states. [2018-11-28 20:11:30,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:30,479 INFO L93 Difference]: Finished difference Result 7780 states and 17289 transitions. [2018-11-28 20:11:30,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 20:11:30,480 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-11-28 20:11:30,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:30,489 INFO L225 Difference]: With dead ends: 7780 [2018-11-28 20:11:30,489 INFO L226 Difference]: Without dead ends: 7748 [2018-11-28 20:11:30,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2018-11-28 20:11:30,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7748 states. [2018-11-28 20:11:30,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7748 to 6075. [2018-11-28 20:11:30,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6075 states. [2018-11-28 20:11:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6075 states to 6075 states and 13575 transitions. [2018-11-28 20:11:30,569 INFO L78 Accepts]: Start accepts. Automaton has 6075 states and 13575 transitions. Word has length 95 [2018-11-28 20:11:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:30,569 INFO L480 AbstractCegarLoop]: Abstraction has 6075 states and 13575 transitions. [2018-11-28 20:11:30,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 20:11:30,570 INFO L276 IsEmpty]: Start isEmpty. Operand 6075 states and 13575 transitions. [2018-11-28 20:11:30,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:11:30,579 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:30,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:30,579 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:30,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:30,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1550303339, now seen corresponding path program 1 times [2018-11-28 20:11:30,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:30,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:30,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:30,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:30,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:30,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:30,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:11:30,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:11:30,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:11:30,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:11:30,879 INFO L87 Difference]: Start difference. First operand 6075 states and 13575 transitions. Second operand 9 states. [2018-11-28 20:11:31,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:31,601 INFO L93 Difference]: Finished difference Result 7670 states and 16959 transitions. [2018-11-28 20:11:31,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 20:11:31,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-11-28 20:11:31,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:31,611 INFO L225 Difference]: With dead ends: 7670 [2018-11-28 20:11:31,611 INFO L226 Difference]: Without dead ends: 7670 [2018-11-28 20:11:31,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-11-28 20:11:31,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7670 states. [2018-11-28 20:11:31,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7670 to 6328. [2018-11-28 20:11:31,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6328 states. [2018-11-28 20:11:31,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6328 states to 6328 states and 14116 transitions. [2018-11-28 20:11:31,683 INFO L78 Accepts]: Start accepts. Automaton has 6328 states and 14116 transitions. Word has length 95 [2018-11-28 20:11:31,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:31,684 INFO L480 AbstractCegarLoop]: Abstraction has 6328 states and 14116 transitions. [2018-11-28 20:11:31,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:11:31,684 INFO L276 IsEmpty]: Start isEmpty. Operand 6328 states and 14116 transitions. [2018-11-28 20:11:31,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:11:31,693 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:31,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:31,694 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:31,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:31,694 INFO L82 PathProgramCache]: Analyzing trace with hash 2068511189, now seen corresponding path program 1 times [2018-11-28 20:11:31,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:31,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:31,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:31,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:31,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:32,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:32,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:11:32,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:11:32,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:11:32,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:11:32,966 INFO L87 Difference]: Start difference. First operand 6328 states and 14116 transitions. Second operand 9 states. [2018-11-28 20:11:33,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:33,563 INFO L93 Difference]: Finished difference Result 7158 states and 15950 transitions. [2018-11-28 20:11:33,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 20:11:33,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-11-28 20:11:33,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:33,574 INFO L225 Difference]: With dead ends: 7158 [2018-11-28 20:11:33,574 INFO L226 Difference]: Without dead ends: 7121 [2018-11-28 20:11:33,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-11-28 20:11:33,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7121 states. [2018-11-28 20:11:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7121 to 6029. [2018-11-28 20:11:33,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6029 states. [2018-11-28 20:11:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6029 states to 6029 states and 13450 transitions. [2018-11-28 20:11:33,647 INFO L78 Accepts]: Start accepts. Automaton has 6029 states and 13450 transitions. Word has length 95 [2018-11-28 20:11:33,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:33,647 INFO L480 AbstractCegarLoop]: Abstraction has 6029 states and 13450 transitions. [2018-11-28 20:11:33,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:11:33,648 INFO L276 IsEmpty]: Start isEmpty. Operand 6029 states and 13450 transitions. [2018-11-28 20:11:33,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:11:33,654 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:33,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:33,655 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:33,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:33,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1338952426, now seen corresponding path program 1 times [2018-11-28 20:11:33,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:33,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:33,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:33,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:33,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:33,956 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 20:11:34,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:34,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:34,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 20:11:34,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 20:11:34,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 20:11:34,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:11:34,114 INFO L87 Difference]: Start difference. First operand 6029 states and 13450 transitions. Second operand 11 states. [2018-11-28 20:11:35,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:35,936 INFO L93 Difference]: Finished difference Result 11238 states and 25249 transitions. [2018-11-28 20:11:35,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 20:11:35,937 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-11-28 20:11:35,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:35,948 INFO L225 Difference]: With dead ends: 11238 [2018-11-28 20:11:35,948 INFO L226 Difference]: Without dead ends: 7673 [2018-11-28 20:11:35,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-11-28 20:11:35,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7673 states. [2018-11-28 20:11:36,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7673 to 5863. [2018-11-28 20:11:36,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5863 states. [2018-11-28 20:11:36,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5863 states to 5863 states and 13048 transitions. [2018-11-28 20:11:36,028 INFO L78 Accepts]: Start accepts. Automaton has 5863 states and 13048 transitions. Word has length 95 [2018-11-28 20:11:36,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:36,029 INFO L480 AbstractCegarLoop]: Abstraction has 5863 states and 13048 transitions. [2018-11-28 20:11:36,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 20:11:36,029 INFO L276 IsEmpty]: Start isEmpty. Operand 5863 states and 13048 transitions. [2018-11-28 20:11:36,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:11:36,038 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:36,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:36,038 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:36,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:36,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1071746382, now seen corresponding path program 1 times [2018-11-28 20:11:36,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:36,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:36,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:36,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:36,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:36,469 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 20:11:36,729 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-11-28 20:11:36,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:36,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:36,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:11:36,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:11:36,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:11:36,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:11:36,742 INFO L87 Difference]: Start difference. First operand 5863 states and 13048 transitions. Second operand 6 states. [2018-11-28 20:11:36,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:36,939 INFO L93 Difference]: Finished difference Result 6687 states and 14678 transitions. [2018-11-28 20:11:36,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:11:36,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-11-28 20:11:36,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:36,949 INFO L225 Difference]: With dead ends: 6687 [2018-11-28 20:11:36,949 INFO L226 Difference]: Without dead ends: 6630 [2018-11-28 20:11:36,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:11:36,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6630 states. [2018-11-28 20:11:37,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6630 to 5938. [2018-11-28 20:11:37,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5938 states. [2018-11-28 20:11:37,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5938 states to 5938 states and 13074 transitions. [2018-11-28 20:11:37,036 INFO L78 Accepts]: Start accepts. Automaton has 5938 states and 13074 transitions. Word has length 95 [2018-11-28 20:11:37,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:37,036 INFO L480 AbstractCegarLoop]: Abstraction has 5938 states and 13074 transitions. [2018-11-28 20:11:37,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:11:37,036 INFO L276 IsEmpty]: Start isEmpty. Operand 5938 states and 13074 transitions. [2018-11-28 20:11:37,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:11:37,043 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:37,043 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:37,044 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:37,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:37,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1408217134, now seen corresponding path program 2 times [2018-11-28 20:11:37,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:37,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:37,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:37,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:37,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:37,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:37,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:37,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:11:37,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:11:37,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:11:37,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:11:37,261 INFO L87 Difference]: Start difference. First operand 5938 states and 13074 transitions. Second operand 7 states. [2018-11-28 20:11:37,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:37,780 INFO L93 Difference]: Finished difference Result 8017 states and 17374 transitions. [2018-11-28 20:11:37,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 20:11:37,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-11-28 20:11:37,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:37,791 INFO L225 Difference]: With dead ends: 8017 [2018-11-28 20:11:37,791 INFO L226 Difference]: Without dead ends: 8017 [2018-11-28 20:11:37,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-28 20:11:37,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8017 states. [2018-11-28 20:11:37,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8017 to 6468. [2018-11-28 20:11:37,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6468 states. [2018-11-28 20:11:37,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6468 states to 6468 states and 14234 transitions. [2018-11-28 20:11:37,896 INFO L78 Accepts]: Start accepts. Automaton has 6468 states and 14234 transitions. Word has length 95 [2018-11-28 20:11:37,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:37,896 INFO L480 AbstractCegarLoop]: Abstraction has 6468 states and 14234 transitions. [2018-11-28 20:11:37,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:11:37,897 INFO L276 IsEmpty]: Start isEmpty. Operand 6468 states and 14234 transitions. [2018-11-28 20:11:37,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:11:37,906 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:37,906 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:37,906 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:37,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:37,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1196866221, now seen corresponding path program 1 times [2018-11-28 20:11:37,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:37,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:37,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:37,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:11:37,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:38,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:38,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:38,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:11:38,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:11:38,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:11:38,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:11:38,140 INFO L87 Difference]: Start difference. First operand 6468 states and 14234 transitions. Second operand 6 states. [2018-11-28 20:11:38,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:38,564 INFO L93 Difference]: Finished difference Result 6751 states and 14825 transitions. [2018-11-28 20:11:38,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:11:38,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-11-28 20:11:38,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:38,576 INFO L225 Difference]: With dead ends: 6751 [2018-11-28 20:11:38,576 INFO L226 Difference]: Without dead ends: 6751 [2018-11-28 20:11:38,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:11:38,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6751 states. [2018-11-28 20:11:38,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6751 to 6357. [2018-11-28 20:11:38,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6357 states. [2018-11-28 20:11:38,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6357 states to 6357 states and 13998 transitions. [2018-11-28 20:11:38,676 INFO L78 Accepts]: Start accepts. Automaton has 6357 states and 13998 transitions. Word has length 95 [2018-11-28 20:11:38,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:38,676 INFO L480 AbstractCegarLoop]: Abstraction has 6357 states and 13998 transitions. [2018-11-28 20:11:38,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:11:38,676 INFO L276 IsEmpty]: Start isEmpty. Operand 6357 states and 13998 transitions. [2018-11-28 20:11:38,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:11:38,686 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:38,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:38,686 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:38,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:38,687 INFO L82 PathProgramCache]: Analyzing trace with hash -741980621, now seen corresponding path program 2 times [2018-11-28 20:11:38,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:38,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:38,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:38,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:11:38,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:11:38,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:11:38,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:11:38,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:11:38,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:11:38,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:11:38,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:11:38,959 INFO L87 Difference]: Start difference. First operand 6357 states and 13998 transitions. Second operand 7 states. [2018-11-28 20:11:39,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:11:39,129 INFO L93 Difference]: Finished difference Result 8292 states and 18291 transitions. [2018-11-28 20:11:39,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:11:39,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-11-28 20:11:39,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:11:39,139 INFO L225 Difference]: With dead ends: 8292 [2018-11-28 20:11:39,140 INFO L226 Difference]: Without dead ends: 8292 [2018-11-28 20:11:39,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:11:39,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8292 states. [2018-11-28 20:11:39,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8292 to 5719. [2018-11-28 20:11:39,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5719 states. [2018-11-28 20:11:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5719 states to 5719 states and 12493 transitions. [2018-11-28 20:11:39,209 INFO L78 Accepts]: Start accepts. Automaton has 5719 states and 12493 transitions. Word has length 95 [2018-11-28 20:11:39,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:11:39,209 INFO L480 AbstractCegarLoop]: Abstraction has 5719 states and 12493 transitions. [2018-11-28 20:11:39,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:11:39,209 INFO L276 IsEmpty]: Start isEmpty. Operand 5719 states and 12493 transitions. [2018-11-28 20:11:39,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:11:39,216 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:11:39,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:11:39,216 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:11:39,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:11:39,217 INFO L82 PathProgramCache]: Analyzing trace with hash -530629708, now seen corresponding path program 2 times [2018-11-28 20:11:39,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:11:39,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:11:39,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:39,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:11:39,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:11:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:11:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:11:39,294 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 20:11:39,475 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 20:11:39,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:11:39 BasicIcfg [2018-11-28 20:11:39,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 20:11:39,480 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 20:11:39,480 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 20:11:39,480 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 20:11:39,481 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:10:54" (3/4) ... [2018-11-28 20:11:39,491 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 20:11:39,750 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 20:11:39,753 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 20:11:39,754 INFO L168 Benchmark]: Toolchain (without parser) took 47750.09 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 947.3 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 392.2 MB. Max. memory is 11.5 GB. [2018-11-28 20:11:39,754 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:11:39,755 INFO L168 Benchmark]: CACSL2BoogieTranslator took 911.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -131.8 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-11-28 20:11:39,755 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-28 20:11:39,755 INFO L168 Benchmark]: Boogie Preprocessor took 66.15 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:11:39,758 INFO L168 Benchmark]: RCFGBuilder took 1234.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. [2018-11-28 20:11:39,759 INFO L168 Benchmark]: TraceAbstraction took 45189.68 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 327.7 MB. Max. memory is 11.5 GB. [2018-11-28 20:11:39,759 INFO L168 Benchmark]: Witness Printer took 272.87 ms. Allocated memory is still 2.8 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. [2018-11-28 20:11:39,764 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 911.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -131.8 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.15 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1234.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 45189.68 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 327.7 MB. Max. memory is 11.5 GB. * Witness Printer took 272.87 ms. Allocated memory is still 2.8 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L770] -1 pthread_t t1291; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L771] FCALL, FORK -1 pthread_create(&t1291, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L701] 0 y$w_buff1 = y$w_buff0 [L702] 0 y$w_buff0 = 1 [L703] 0 y$w_buff1_used = y$w_buff0_used [L704] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] -1 pthread_t t1292; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] FCALL, FORK -1 pthread_create(&t1292, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L707] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L708] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L709] 0 y$r_buff0_thd1 = (_Bool)1 [L712] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] 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) [L744] 1 y = y$flush_delayed ? y$mem_tmp : y [L745] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L717] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 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 [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L719] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$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 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] 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) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_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] [L750] 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 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_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] [L752] 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 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -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) [L780] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L781] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -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 [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L783] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -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 [L786] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 44.9s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 23.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8363 SDtfs, 10155 SDslu, 20520 SDs, 0 SdLazy, 9453 SolverSat, 436 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 348 GetRequests, 78 SyntacticMatches, 41 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35807occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.8s AutomataMinimizationTime, 30 MinimizatonAttempts, 74875 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 2280 NumberOfCodeBlocks, 2280 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2155 ConstructedInterpolants, 0 QuantifiedInterpolants, 519740 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...