./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe029_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/safe029_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 a697edfe042240cd4f596c03e6214ca7451405ac ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:37:57,006 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 20:37:57,008 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 20:37:57,025 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 20:37:57,026 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 20:37:57,027 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 20:37:57,029 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 20:37:57,031 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 20:37:57,033 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 20:37:57,034 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 20:37:57,035 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 20:37:57,035 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 20:37:57,036 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 20:37:57,037 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 20:37:57,039 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 20:37:57,040 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 20:37:57,041 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 20:37:57,042 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 20:37:57,045 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 20:37:57,047 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 20:37:57,048 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 20:37:57,049 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 20:37:57,052 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 20:37:57,052 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 20:37:57,053 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 20:37:57,054 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 20:37:57,055 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 20:37:57,056 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 20:37:57,057 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 20:37:57,058 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 20:37:57,059 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 20:37:57,060 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 20:37:57,060 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 20:37:57,060 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 20:37:57,062 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 20:37:57,062 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 20:37:57,063 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:37:57,078 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 20:37:57,080 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 20:37:57,081 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 20:37:57,081 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 20:37:57,081 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 20:37:57,082 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 20:37:57,082 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 20:37:57,083 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 20:37:57,083 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 20:37:57,083 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 20:37:57,083 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 20:37:57,083 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 20:37:57,084 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 20:37:57,084 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 20:37:57,084 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 20:37:57,084 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 20:37:57,084 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 20:37:57,085 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 20:37:57,085 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 20:37:57,085 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 20:37:57,085 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 20:37:57,086 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 20:37:57,086 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 20:37:57,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:37:57,086 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 20:37:57,086 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 20:37:57,086 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 20:37:57,088 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 20:37:57,088 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 20:37:57,088 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 20:37:57,088 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 -> a697edfe042240cd4f596c03e6214ca7451405ac [2018-11-28 20:37:57,139 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 20:37:57,152 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 20:37:57,156 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 20:37:57,157 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 20:37:57,158 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 20:37:57,159 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe029_rmo.oepc_false-unreach-call.i [2018-11-28 20:37:57,221 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f13aa8d0/c780aa9614c9407981510e9e2cbe8e6e/FLAG0b665578a [2018-11-28 20:37:57,745 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 20:37:57,751 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe029_rmo.oepc_false-unreach-call.i [2018-11-28 20:37:57,773 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f13aa8d0/c780aa9614c9407981510e9e2cbe8e6e/FLAG0b665578a [2018-11-28 20:37:58,003 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f13aa8d0/c780aa9614c9407981510e9e2cbe8e6e [2018-11-28 20:37:58,007 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 20:37:58,009 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 20:37:58,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 20:37:58,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 20:37:58,015 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 20:37:58,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:37:58" (1/1) ... [2018-11-28 20:37:58,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc9f617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:58, skipping insertion in model container [2018-11-28 20:37:58,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:37:58" (1/1) ... [2018-11-28 20:37:58,031 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 20:37:58,103 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 20:37:58,618 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:37:58,637 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 20:37:58,812 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:37:58,891 INFO L195 MainTranslator]: Completed translation [2018-11-28 20:37:58,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:58 WrapperNode [2018-11-28 20:37:58,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 20:37:58,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 20:37:58,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 20:37:58,893 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 20:37:58,903 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:37:58" (1/1) ... [2018-11-28 20:37:58,931 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:37:58" (1/1) ... [2018-11-28 20:37:58,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 20:37:58,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 20:37:58,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 20:37:58,978 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 20:37:58,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:58" (1/1) ... [2018-11-28 20:37:58,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:58" (1/1) ... [2018-11-28 20:37:58,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:58" (1/1) ... [2018-11-28 20:37:58,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:58" (1/1) ... [2018-11-28 20:37:59,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:58" (1/1) ... [2018-11-28 20:37:59,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:58" (1/1) ... [2018-11-28 20:37:59,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:58" (1/1) ... [2018-11-28 20:37:59,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 20:37:59,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 20:37:59,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 20:37:59,022 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 20:37:59,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:58" (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:37:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 20:37:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 20:37:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 20:37:59,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 20:37:59,085 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 20:37:59,085 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 20:37:59,085 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 20:37:59,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 20:37:59,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 20:37:59,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 20:37:59,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 20:37:59,088 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:38:00,261 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 20:38:00,261 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 20:38:00,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:38:00 BoogieIcfgContainer [2018-11-28 20:38:00,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 20:38:00,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 20:38:00,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 20:38:00,267 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 20:38:00,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:37:58" (1/3) ... [2018-11-28 20:38:00,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b3abe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:38:00, skipping insertion in model container [2018-11-28 20:38:00,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:37:58" (2/3) ... [2018-11-28 20:38:00,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b3abe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:38:00, skipping insertion in model container [2018-11-28 20:38:00,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:38:00" (3/3) ... [2018-11-28 20:38:00,271 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_rmo.oepc_false-unreach-call.i [2018-11-28 20:38:00,316 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,316 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,316 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,316 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,316 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,317 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:38:00,317 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,317 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,318 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,318 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,318 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,318 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,319 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,319 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,319 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,319 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,320 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,320 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,320 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,320 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,321 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,321 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,321 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,321 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,322 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,322 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,322 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,322 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,322 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,323 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,323 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,323 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,323 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,323 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,324 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,324 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,324 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,324 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,325 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,325 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,325 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,325 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,326 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,326 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,326 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,326 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,326 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,327 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,327 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,327 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,327 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,328 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,328 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,328 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,328 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,328 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,329 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,329 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,329 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,329 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:38:00,362 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 20:38:00,362 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 20:38:00,372 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 20:38:00,391 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 20:38:00,416 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 20:38:00,416 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 20:38:00,416 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 20:38:00,417 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 20:38:00,417 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 20:38:00,417 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 20:38:00,417 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 20:38:00,417 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 20:38:00,417 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 20:38:00,431 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140places, 178 transitions [2018-11-28 20:38:02,137 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25102 states. [2018-11-28 20:38:02,140 INFO L276 IsEmpty]: Start isEmpty. Operand 25102 states. [2018-11-28 20:38:02,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 20:38:02,147 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:02,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:38:02,150 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:02,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:02,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2024635459, now seen corresponding path program 1 times [2018-11-28 20:38:02,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:02,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:02,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:02,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:02,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:02,578 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:38:02,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:02,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:38:02,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:38:02,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:38:02,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:38:02,602 INFO L87 Difference]: Start difference. First operand 25102 states. Second operand 4 states. [2018-11-28 20:38:03,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:03,801 INFO L93 Difference]: Finished difference Result 45394 states and 177648 transitions. [2018-11-28 20:38:03,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:38:03,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-11-28 20:38:03,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:04,142 INFO L225 Difference]: With dead ends: 45394 [2018-11-28 20:38:04,142 INFO L226 Difference]: Without dead ends: 40634 [2018-11-28 20:38:04,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:38:04,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40634 states. [2018-11-28 20:38:05,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40634 to 23668. [2018-11-28 20:38:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23668 states. [2018-11-28 20:38:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23668 states to 23668 states and 92565 transitions. [2018-11-28 20:38:05,892 INFO L78 Accepts]: Start accepts. Automaton has 23668 states and 92565 transitions. Word has length 31 [2018-11-28 20:38:05,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:05,895 INFO L480 AbstractCegarLoop]: Abstraction has 23668 states and 92565 transitions. [2018-11-28 20:38:05,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:38:05,896 INFO L276 IsEmpty]: Start isEmpty. Operand 23668 states and 92565 transitions. [2018-11-28 20:38:05,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-28 20:38:05,910 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:05,910 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] [2018-11-28 20:38:05,911 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:05,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:05,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1263924681, now seen corresponding path program 1 times [2018-11-28 20:38:05,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:05,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:05,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:05,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:05,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:06,088 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:38:06,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:06,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:38:06,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:38:06,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:38:06,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:38:06,092 INFO L87 Difference]: Start difference. First operand 23668 states and 92565 transitions. Second operand 5 states. [2018-11-28 20:38:09,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:09,314 INFO L93 Difference]: Finished difference Result 64836 states and 241395 transitions. [2018-11-28 20:38:09,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:38:09,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-28 20:38:09,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:09,658 INFO L225 Difference]: With dead ends: 64836 [2018-11-28 20:38:09,658 INFO L226 Difference]: Without dead ends: 64676 [2018-11-28 20:38:09,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:38:10,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64676 states. [2018-11-28 20:38:11,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64676 to 37148. [2018-11-28 20:38:11,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37148 states. [2018-11-28 20:38:11,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37148 states to 37148 states and 138310 transitions. [2018-11-28 20:38:11,537 INFO L78 Accepts]: Start accepts. Automaton has 37148 states and 138310 transitions. Word has length 42 [2018-11-28 20:38:11,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:11,540 INFO L480 AbstractCegarLoop]: Abstraction has 37148 states and 138310 transitions. [2018-11-28 20:38:11,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:38:11,540 INFO L276 IsEmpty]: Start isEmpty. Operand 37148 states and 138310 transitions. [2018-11-28 20:38:11,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 20:38:11,550 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:11,550 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] [2018-11-28 20:38:11,551 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:11,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:11,551 INFO L82 PathProgramCache]: Analyzing trace with hash 555727520, now seen corresponding path program 1 times [2018-11-28 20:38:11,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:11,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:11,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:11,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:11,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:11,757 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:38:11,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:11,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:38:11,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:38:11,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:38:11,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:38:11,759 INFO L87 Difference]: Start difference. First operand 37148 states and 138310 transitions. Second operand 4 states. [2018-11-28 20:38:11,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:11,907 INFO L93 Difference]: Finished difference Result 12370 states and 41203 transitions. [2018-11-28 20:38:11,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:38:11,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-11-28 20:38:11,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:11,935 INFO L225 Difference]: With dead ends: 12370 [2018-11-28 20:38:11,936 INFO L226 Difference]: Without dead ends: 11849 [2018-11-28 20:38:11,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:38:11,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2018-11-28 20:38:12,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 11849. [2018-11-28 20:38:12,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11849 states. [2018-11-28 20:38:12,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11849 states to 11849 states and 39648 transitions. [2018-11-28 20:38:12,202 INFO L78 Accepts]: Start accepts. Automaton has 11849 states and 39648 transitions. Word has length 43 [2018-11-28 20:38:12,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:12,203 INFO L480 AbstractCegarLoop]: Abstraction has 11849 states and 39648 transitions. [2018-11-28 20:38:12,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:38:12,203 INFO L276 IsEmpty]: Start isEmpty. Operand 11849 states and 39648 transitions. [2018-11-28 20:38:12,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 20:38:12,209 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:12,210 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] [2018-11-28 20:38:12,210 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:12,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:12,210 INFO L82 PathProgramCache]: Analyzing trace with hash -2022717967, now seen corresponding path program 1 times [2018-11-28 20:38:12,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:12,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:12,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:12,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:12,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:12,346 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:38:12,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:12,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:38:12,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:38:12,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:38:12,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:38:12,349 INFO L87 Difference]: Start difference. First operand 11849 states and 39648 transitions. Second operand 4 states. [2018-11-28 20:38:12,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:12,859 INFO L93 Difference]: Finished difference Result 17025 states and 55723 transitions. [2018-11-28 20:38:12,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:38:12,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-11-28 20:38:12,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:12,899 INFO L225 Difference]: With dead ends: 17025 [2018-11-28 20:38:12,900 INFO L226 Difference]: Without dead ends: 17025 [2018-11-28 20:38:12,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:38:12,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17025 states. [2018-11-28 20:38:13,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17025 to 12885. [2018-11-28 20:38:13,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12885 states. [2018-11-28 20:38:13,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12885 states to 12885 states and 42750 transitions. [2018-11-28 20:38:13,321 INFO L78 Accepts]: Start accepts. Automaton has 12885 states and 42750 transitions. Word has length 56 [2018-11-28 20:38:13,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:13,322 INFO L480 AbstractCegarLoop]: Abstraction has 12885 states and 42750 transitions. [2018-11-28 20:38:13,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:38:13,322 INFO L276 IsEmpty]: Start isEmpty. Operand 12885 states and 42750 transitions. [2018-11-28 20:38:13,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 20:38:13,332 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:13,332 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] [2018-11-28 20:38:13,332 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:13,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:13,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1977003375, now seen corresponding path program 1 times [2018-11-28 20:38:13,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:13,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:13,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:13,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:13,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:13,711 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-11-28 20:38:13,721 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:38:13,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:13,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:38:13,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:38:13,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:38:13,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:38:13,724 INFO L87 Difference]: Start difference. First operand 12885 states and 42750 transitions. Second operand 4 states. [2018-11-28 20:38:15,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:15,151 INFO L93 Difference]: Finished difference Result 18380 states and 60007 transitions. [2018-11-28 20:38:15,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:38:15,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-11-28 20:38:15,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:15,185 INFO L225 Difference]: With dead ends: 18380 [2018-11-28 20:38:15,186 INFO L226 Difference]: Without dead ends: 18380 [2018-11-28 20:38:15,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:38:15,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18380 states. [2018-11-28 20:38:15,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18380 to 16341. [2018-11-28 20:38:15,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16341 states. [2018-11-28 20:38:15,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16341 states to 16341 states and 53832 transitions. [2018-11-28 20:38:15,525 INFO L78 Accepts]: Start accepts. Automaton has 16341 states and 53832 transitions. Word has length 56 [2018-11-28 20:38:15,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:15,526 INFO L480 AbstractCegarLoop]: Abstraction has 16341 states and 53832 transitions. [2018-11-28 20:38:15,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:38:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand 16341 states and 53832 transitions. [2018-11-28 20:38:15,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 20:38:15,535 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:15,535 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] [2018-11-28 20:38:15,536 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:15,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:15,536 INFO L82 PathProgramCache]: Analyzing trace with hash -964654224, now seen corresponding path program 1 times [2018-11-28 20:38:15,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:15,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:15,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:15,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:15,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:15,762 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:38:15,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:15,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:15,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:15,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:15,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:15,764 INFO L87 Difference]: Start difference. First operand 16341 states and 53832 transitions. Second operand 6 states. [2018-11-28 20:38:16,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:16,356 INFO L93 Difference]: Finished difference Result 17857 states and 58003 transitions. [2018-11-28 20:38:16,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:38:16,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-11-28 20:38:16,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:16,389 INFO L225 Difference]: With dead ends: 17857 [2018-11-28 20:38:16,389 INFO L226 Difference]: Without dead ends: 17857 [2018-11-28 20:38:16,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:38:16,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17857 states. [2018-11-28 20:38:16,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17857 to 16903. [2018-11-28 20:38:16,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16903 states. [2018-11-28 20:38:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16903 states to 16903 states and 55361 transitions. [2018-11-28 20:38:16,688 INFO L78 Accepts]: Start accepts. Automaton has 16903 states and 55361 transitions. Word has length 56 [2018-11-28 20:38:16,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:16,688 INFO L480 AbstractCegarLoop]: Abstraction has 16903 states and 55361 transitions. [2018-11-28 20:38:16,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:16,688 INFO L276 IsEmpty]: Start isEmpty. Operand 16903 states and 55361 transitions. [2018-11-28 20:38:16,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 20:38:16,699 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:16,699 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] [2018-11-28 20:38:16,699 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:16,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:16,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1258057231, now seen corresponding path program 1 times [2018-11-28 20:38:16,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:16,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:16,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:16,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:16,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:16,961 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:38:16,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:16,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:16,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:16,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:16,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:16,963 INFO L87 Difference]: Start difference. First operand 16903 states and 55361 transitions. Second operand 6 states. [2018-11-28 20:38:17,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:17,896 INFO L93 Difference]: Finished difference Result 23475 states and 75946 transitions. [2018-11-28 20:38:17,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:38:17,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-11-28 20:38:17,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:17,939 INFO L225 Difference]: With dead ends: 23475 [2018-11-28 20:38:17,939 INFO L226 Difference]: Without dead ends: 23443 [2018-11-28 20:38:17,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-28 20:38:17,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23443 states. [2018-11-28 20:38:18,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23443 to 18807. [2018-11-28 20:38:18,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18807 states. [2018-11-28 20:38:18,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18807 states to 18807 states and 61305 transitions. [2018-11-28 20:38:18,635 INFO L78 Accepts]: Start accepts. Automaton has 18807 states and 61305 transitions. Word has length 56 [2018-11-28 20:38:18,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:18,636 INFO L480 AbstractCegarLoop]: Abstraction has 18807 states and 61305 transitions. [2018-11-28 20:38:18,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:18,636 INFO L276 IsEmpty]: Start isEmpty. Operand 18807 states and 61305 transitions. [2018-11-28 20:38:18,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 20:38:18,673 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:18,673 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] [2018-11-28 20:38:18,673 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:18,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:18,675 INFO L82 PathProgramCache]: Analyzing trace with hash -2076609247, now seen corresponding path program 1 times [2018-11-28 20:38:18,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:18,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:18,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:18,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:18,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:19,038 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:38:19,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:19,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:38:19,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:38:19,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:38:19,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:19,040 INFO L87 Difference]: Start difference. First operand 18807 states and 61305 transitions. Second operand 7 states. [2018-11-28 20:38:19,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:19,974 INFO L93 Difference]: Finished difference Result 24535 states and 79153 transitions. [2018-11-28 20:38:19,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 20:38:19,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-11-28 20:38:19,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:20,018 INFO L225 Difference]: With dead ends: 24535 [2018-11-28 20:38:20,019 INFO L226 Difference]: Without dead ends: 24471 [2018-11-28 20:38:20,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-11-28 20:38:20,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24471 states. [2018-11-28 20:38:20,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24471 to 20899. [2018-11-28 20:38:20,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20899 states. [2018-11-28 20:38:20,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20899 states to 20899 states and 67710 transitions. [2018-11-28 20:38:20,376 INFO L78 Accepts]: Start accepts. Automaton has 20899 states and 67710 transitions. Word has length 70 [2018-11-28 20:38:20,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:20,377 INFO L480 AbstractCegarLoop]: Abstraction has 20899 states and 67710 transitions. [2018-11-28 20:38:20,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:38:20,377 INFO L276 IsEmpty]: Start isEmpty. Operand 20899 states and 67710 transitions. [2018-11-28 20:38:20,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 20:38:20,411 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:20,411 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:38:20,412 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:20,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:20,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1643744653, now seen corresponding path program 1 times [2018-11-28 20:38:20,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:20,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:20,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:20,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:20,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:20,501 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:38:20,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:20,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:38:20,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:38:20,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:38:20,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:38:20,502 INFO L87 Difference]: Start difference. First operand 20899 states and 67710 transitions. Second operand 3 states. [2018-11-28 20:38:20,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:20,694 INFO L93 Difference]: Finished difference Result 24947 states and 79522 transitions. [2018-11-28 20:38:20,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:38:20,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-11-28 20:38:20,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:20,740 INFO L225 Difference]: With dead ends: 24947 [2018-11-28 20:38:20,740 INFO L226 Difference]: Without dead ends: 24947 [2018-11-28 20:38:20,740 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:38:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24947 states. [2018-11-28 20:38:21,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24947 to 22467. [2018-11-28 20:38:21,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22467 states. [2018-11-28 20:38:21,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22467 states to 22467 states and 72190 transitions. [2018-11-28 20:38:21,110 INFO L78 Accepts]: Start accepts. Automaton has 22467 states and 72190 transitions. Word has length 72 [2018-11-28 20:38:21,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:21,110 INFO L480 AbstractCegarLoop]: Abstraction has 22467 states and 72190 transitions. [2018-11-28 20:38:21,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:38:21,110 INFO L276 IsEmpty]: Start isEmpty. Operand 22467 states and 72190 transitions. [2018-11-28 20:38:21,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 20:38:21,136 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:21,136 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] [2018-11-28 20:38:21,136 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:21,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:21,137 INFO L82 PathProgramCache]: Analyzing trace with hash -671189007, now seen corresponding path program 1 times [2018-11-28 20:38:21,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:21,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:21,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:21,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:21,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:21,411 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:38:21,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:21,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:38:21,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:38:21,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:38:21,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:38:21,412 INFO L87 Difference]: Start difference. First operand 22467 states and 72190 transitions. Second operand 4 states. [2018-11-28 20:38:22,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:22,829 INFO L93 Difference]: Finished difference Result 34667 states and 110116 transitions. [2018-11-28 20:38:22,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:38:22,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-11-28 20:38:22,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:22,901 INFO L225 Difference]: With dead ends: 34667 [2018-11-28 20:38:22,902 INFO L226 Difference]: Without dead ends: 34471 [2018-11-28 20:38:22,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:38:22,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34471 states. [2018-11-28 20:38:23,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34471 to 29099. [2018-11-28 20:38:23,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29099 states. [2018-11-28 20:38:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29099 states to 29099 states and 93336 transitions. [2018-11-28 20:38:23,505 INFO L78 Accepts]: Start accepts. Automaton has 29099 states and 93336 transitions. Word has length 76 [2018-11-28 20:38:23,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:23,506 INFO L480 AbstractCegarLoop]: Abstraction has 29099 states and 93336 transitions. [2018-11-28 20:38:23,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:38:23,506 INFO L276 IsEmpty]: Start isEmpty. Operand 29099 states and 93336 transitions. [2018-11-28 20:38:23,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 20:38:23,545 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:23,545 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] [2018-11-28 20:38:23,545 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:23,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:23,546 INFO L82 PathProgramCache]: Analyzing trace with hash 573575474, now seen corresponding path program 1 times [2018-11-28 20:38:23,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:23,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:23,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:23,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:23,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:23,962 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:38:23,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:23,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:23,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:23,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:23,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:23,964 INFO L87 Difference]: Start difference. First operand 29099 states and 93336 transitions. Second operand 6 states. [2018-11-28 20:38:25,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:25,304 INFO L93 Difference]: Finished difference Result 52152 states and 164833 transitions. [2018-11-28 20:38:25,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:38:25,304 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2018-11-28 20:38:25,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:25,415 INFO L225 Difference]: With dead ends: 52152 [2018-11-28 20:38:25,415 INFO L226 Difference]: Without dead ends: 51912 [2018-11-28 20:38:25,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:38:25,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51912 states. [2018-11-28 20:38:26,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51912 to 43712. [2018-11-28 20:38:26,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43712 states. [2018-11-28 20:38:26,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43712 states to 43712 states and 140003 transitions. [2018-11-28 20:38:26,135 INFO L78 Accepts]: Start accepts. Automaton has 43712 states and 140003 transitions. Word has length 76 [2018-11-28 20:38:26,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:26,135 INFO L480 AbstractCegarLoop]: Abstraction has 43712 states and 140003 transitions. [2018-11-28 20:38:26,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:26,135 INFO L276 IsEmpty]: Start isEmpty. Operand 43712 states and 140003 transitions. [2018-11-28 20:38:26,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 20:38:26,181 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:26,181 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] [2018-11-28 20:38:26,181 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:26,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:26,182 INFO L82 PathProgramCache]: Analyzing trace with hash -270896397, now seen corresponding path program 1 times [2018-11-28 20:38:26,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:26,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:26,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:26,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:26,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:26,417 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:38:26,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:26,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:38:26,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:38:26,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:38:26,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:38:26,418 INFO L87 Difference]: Start difference. First operand 43712 states and 140003 transitions. Second operand 5 states. [2018-11-28 20:38:26,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:26,843 INFO L93 Difference]: Finished difference Result 5456 states and 14431 transitions. [2018-11-28 20:38:26,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:38:26,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-11-28 20:38:26,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:26,853 INFO L225 Difference]: With dead ends: 5456 [2018-11-28 20:38:26,853 INFO L226 Difference]: Without dead ends: 4832 [2018-11-28 20:38:26,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:26,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4832 states. [2018-11-28 20:38:26,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4832 to 4684. [2018-11-28 20:38:26,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4684 states. [2018-11-28 20:38:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 12409 transitions. [2018-11-28 20:38:26,927 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 12409 transitions. Word has length 76 [2018-11-28 20:38:26,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:26,927 INFO L480 AbstractCegarLoop]: Abstraction has 4684 states and 12409 transitions. [2018-11-28 20:38:26,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:38:26,928 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 12409 transitions. [2018-11-28 20:38:26,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-28 20:38:26,936 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:26,936 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] [2018-11-28 20:38:26,936 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:26,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:26,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1415378869, now seen corresponding path program 1 times [2018-11-28 20:38:26,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:26,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:26,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:26,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:26,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:27,123 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:38:27,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:27,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:38:27,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:38:27,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:38:27,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:38:27,124 INFO L87 Difference]: Start difference. First operand 4684 states and 12409 transitions. Second operand 5 states. [2018-11-28 20:38:27,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:27,432 INFO L93 Difference]: Finished difference Result 5468 states and 14247 transitions. [2018-11-28 20:38:27,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:38:27,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-11-28 20:38:27,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:27,442 INFO L225 Difference]: With dead ends: 5468 [2018-11-28 20:38:27,442 INFO L226 Difference]: Without dead ends: 5440 [2018-11-28 20:38:27,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:38:27,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2018-11-28 20:38:27,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5316. [2018-11-28 20:38:27,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5316 states. [2018-11-28 20:38:27,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 13901 transitions. [2018-11-28 20:38:27,502 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 13901 transitions. Word has length 89 [2018-11-28 20:38:27,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:27,503 INFO L480 AbstractCegarLoop]: Abstraction has 5316 states and 13901 transitions. [2018-11-28 20:38:27,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:38:27,503 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 13901 transitions. [2018-11-28 20:38:27,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-28 20:38:27,511 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:27,511 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] [2018-11-28 20:38:27,511 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:27,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:27,511 INFO L82 PathProgramCache]: Analyzing trace with hash -282188276, now seen corresponding path program 1 times [2018-11-28 20:38:27,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:27,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:27,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:27,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:27,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:27,627 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:38:27,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:27,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:38:27,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:38:27,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:38:27,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:38:27,629 INFO L87 Difference]: Start difference. First operand 5316 states and 13901 transitions. Second operand 3 states. [2018-11-28 20:38:27,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:27,790 INFO L93 Difference]: Finished difference Result 5440 states and 14174 transitions. [2018-11-28 20:38:27,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:38:27,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-11-28 20:38:27,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:27,799 INFO L225 Difference]: With dead ends: 5440 [2018-11-28 20:38:27,799 INFO L226 Difference]: Without dead ends: 5440 [2018-11-28 20:38:27,799 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:38:27,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2018-11-28 20:38:27,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5384. [2018-11-28 20:38:27,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5384 states. [2018-11-28 20:38:27,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 14051 transitions. [2018-11-28 20:38:27,860 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 14051 transitions. Word has length 89 [2018-11-28 20:38:27,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:27,860 INFO L480 AbstractCegarLoop]: Abstraction has 5384 states and 14051 transitions. [2018-11-28 20:38:27,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:38:27,860 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 14051 transitions. [2018-11-28 20:38:27,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:27,868 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:27,868 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] [2018-11-28 20:38:27,868 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:27,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:27,869 INFO L82 PathProgramCache]: Analyzing trace with hash -203880528, now seen corresponding path program 1 times [2018-11-28 20:38:27,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:27,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:27,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:27,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:27,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:27,952 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:38:27,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:27,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:38:27,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:38:27,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:38:27,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:38:27,953 INFO L87 Difference]: Start difference. First operand 5384 states and 14051 transitions. Second operand 4 states. [2018-11-28 20:38:28,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:28,134 INFO L93 Difference]: Finished difference Result 9734 states and 25760 transitions. [2018-11-28 20:38:28,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:38:28,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-11-28 20:38:28,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:28,150 INFO L225 Difference]: With dead ends: 9734 [2018-11-28 20:38:28,150 INFO L226 Difference]: Without dead ends: 9706 [2018-11-28 20:38:28,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:38:28,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9706 states. [2018-11-28 20:38:28,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9706 to 5140. [2018-11-28 20:38:28,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5140 states. [2018-11-28 20:38:28,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5140 states to 5140 states and 13376 transitions. [2018-11-28 20:38:28,235 INFO L78 Accepts]: Start accepts. Automaton has 5140 states and 13376 transitions. Word has length 91 [2018-11-28 20:38:28,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:28,235 INFO L480 AbstractCegarLoop]: Abstraction has 5140 states and 13376 transitions. [2018-11-28 20:38:28,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:38:28,235 INFO L276 IsEmpty]: Start isEmpty. Operand 5140 states and 13376 transitions. [2018-11-28 20:38:28,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:28,241 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:28,242 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] [2018-11-28 20:38:28,242 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:28,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:28,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1904621007, now seen corresponding path program 1 times [2018-11-28 20:38:28,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:28,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:28,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:28,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:28,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:28,487 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:38:28,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:28,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:28,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:28,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:28,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:28,489 INFO L87 Difference]: Start difference. First operand 5140 states and 13376 transitions. Second operand 6 states. [2018-11-28 20:38:28,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:28,830 INFO L93 Difference]: Finished difference Result 5643 states and 14543 transitions. [2018-11-28 20:38:28,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:38:28,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-11-28 20:38:28,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:28,839 INFO L225 Difference]: With dead ends: 5643 [2018-11-28 20:38:28,839 INFO L226 Difference]: Without dead ends: 5643 [2018-11-28 20:38:28,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:28,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2018-11-28 20:38:28,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5222. [2018-11-28 20:38:28,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5222 states. [2018-11-28 20:38:28,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 13576 transitions. [2018-11-28 20:38:28,916 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 13576 transitions. Word has length 91 [2018-11-28 20:38:28,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:28,916 INFO L480 AbstractCegarLoop]: Abstraction has 5222 states and 13576 transitions. [2018-11-28 20:38:28,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:28,916 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 13576 transitions. [2018-11-28 20:38:28,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:28,922 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:28,923 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] [2018-11-28 20:38:28,923 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:28,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:28,923 INFO L82 PathProgramCache]: Analyzing trace with hash -935039984, now seen corresponding path program 1 times [2018-11-28 20:38:28,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:28,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:28,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:28,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:28,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:29,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:38:29,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:29,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:38:29,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:38:29,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:38:29,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:29,135 INFO L87 Difference]: Start difference. First operand 5222 states and 13576 transitions. Second operand 7 states. [2018-11-28 20:38:29,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:29,500 INFO L93 Difference]: Finished difference Result 5203 states and 13406 transitions. [2018-11-28 20:38:29,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:38:29,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-11-28 20:38:29,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:29,509 INFO L225 Difference]: With dead ends: 5203 [2018-11-28 20:38:29,509 INFO L226 Difference]: Without dead ends: 5178 [2018-11-28 20:38:29,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:38:29,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5178 states. [2018-11-28 20:38:29,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5178 to 4801. [2018-11-28 20:38:29,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4801 states. [2018-11-28 20:38:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4801 states to 4801 states and 12542 transitions. [2018-11-28 20:38:29,564 INFO L78 Accepts]: Start accepts. Automaton has 4801 states and 12542 transitions. Word has length 91 [2018-11-28 20:38:29,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:29,565 INFO L480 AbstractCegarLoop]: Abstraction has 4801 states and 12542 transitions. [2018-11-28 20:38:29,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:38:29,565 INFO L276 IsEmpty]: Start isEmpty. Operand 4801 states and 12542 transitions. [2018-11-28 20:38:29,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:29,570 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:29,571 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] [2018-11-28 20:38:29,571 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:29,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:29,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1383736623, now seen corresponding path program 1 times [2018-11-28 20:38:29,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:29,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:29,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:29,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:29,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:29,757 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:38:29,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:29,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:29,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:29,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:29,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:29,758 INFO L87 Difference]: Start difference. First operand 4801 states and 12542 transitions. Second operand 6 states. [2018-11-28 20:38:30,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:30,021 INFO L93 Difference]: Finished difference Result 4393 states and 11483 transitions. [2018-11-28 20:38:30,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:38:30,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-11-28 20:38:30,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:30,030 INFO L225 Difference]: With dead ends: 4393 [2018-11-28 20:38:30,068 INFO L226 Difference]: Without dead ends: 4393 [2018-11-28 20:38:30,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:38:30,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2018-11-28 20:38:30,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 4259. [2018-11-28 20:38:30,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4259 states. [2018-11-28 20:38:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4259 states to 4259 states and 11187 transitions. [2018-11-28 20:38:30,117 INFO L78 Accepts]: Start accepts. Automaton has 4259 states and 11187 transitions. Word has length 91 [2018-11-28 20:38:30,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:30,117 INFO L480 AbstractCegarLoop]: Abstraction has 4259 states and 11187 transitions. [2018-11-28 20:38:30,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:30,117 INFO L276 IsEmpty]: Start isEmpty. Operand 4259 states and 11187 transitions. [2018-11-28 20:38:30,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:30,122 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:30,123 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] [2018-11-28 20:38:30,123 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:30,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:30,123 INFO L82 PathProgramCache]: Analyzing trace with hash -82841607, now seen corresponding path program 1 times [2018-11-28 20:38:30,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:30,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:30,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:30,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:30,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:30,327 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:38:30,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:30,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:30,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:30,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:30,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:30,329 INFO L87 Difference]: Start difference. First operand 4259 states and 11187 transitions. Second operand 6 states. [2018-11-28 20:38:30,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:30,647 INFO L93 Difference]: Finished difference Result 5737 states and 14773 transitions. [2018-11-28 20:38:30,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:38:30,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-11-28 20:38:30,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:30,655 INFO L225 Difference]: With dead ends: 5737 [2018-11-28 20:38:30,655 INFO L226 Difference]: Without dead ends: 5705 [2018-11-28 20:38:30,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:30,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5705 states. [2018-11-28 20:38:30,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5705 to 4600. [2018-11-28 20:38:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4600 states. [2018-11-28 20:38:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4600 states to 4600 states and 11989 transitions. [2018-11-28 20:38:30,711 INFO L78 Accepts]: Start accepts. Automaton has 4600 states and 11989 transitions. Word has length 91 [2018-11-28 20:38:30,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:30,712 INFO L480 AbstractCegarLoop]: Abstraction has 4600 states and 11989 transitions. [2018-11-28 20:38:30,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 4600 states and 11989 transitions. [2018-11-28 20:38:30,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:30,717 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:30,717 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] [2018-11-28 20:38:30,717 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:30,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:30,718 INFO L82 PathProgramCache]: Analyzing trace with hash -365992071, now seen corresponding path program 1 times [2018-11-28 20:38:30,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:30,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:30,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:30,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:30,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:30,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:30,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:30,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:38:30,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:38:30,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:38:30,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:30,909 INFO L87 Difference]: Start difference. First operand 4600 states and 11989 transitions. Second operand 7 states. [2018-11-28 20:38:31,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:31,327 INFO L93 Difference]: Finished difference Result 8360 states and 22331 transitions. [2018-11-28 20:38:31,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:38:31,328 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-11-28 20:38:31,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:31,340 INFO L225 Difference]: With dead ends: 8360 [2018-11-28 20:38:31,340 INFO L226 Difference]: Without dead ends: 8360 [2018-11-28 20:38:31,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:38:31,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8360 states. [2018-11-28 20:38:31,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8360 to 5036. [2018-11-28 20:38:31,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5036 states. [2018-11-28 20:38:31,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5036 states to 5036 states and 13135 transitions. [2018-11-28 20:38:31,412 INFO L78 Accepts]: Start accepts. Automaton has 5036 states and 13135 transitions. Word has length 91 [2018-11-28 20:38:31,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:31,412 INFO L480 AbstractCegarLoop]: Abstraction has 5036 states and 13135 transitions. [2018-11-28 20:38:31,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:38:31,413 INFO L276 IsEmpty]: Start isEmpty. Operand 5036 states and 13135 transitions. [2018-11-28 20:38:31,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:31,418 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:31,418 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] [2018-11-28 20:38:31,418 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:31,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:31,420 INFO L82 PathProgramCache]: Analyzing trace with hash 878772410, now seen corresponding path program 1 times [2018-11-28 20:38:31,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:31,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:31,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:31,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:31,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:31,871 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 6 [2018-11-28 20:38:32,088 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 6 [2018-11-28 20:38:32,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:38:32,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:32,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:32,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:32,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:32,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:32,099 INFO L87 Difference]: Start difference. First operand 5036 states and 13135 transitions. Second operand 6 states. [2018-11-28 20:38:32,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:32,788 INFO L93 Difference]: Finished difference Result 7806 states and 20863 transitions. [2018-11-28 20:38:32,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:38:32,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-11-28 20:38:32,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:32,804 INFO L225 Difference]: With dead ends: 7806 [2018-11-28 20:38:32,805 INFO L226 Difference]: Without dead ends: 7806 [2018-11-28 20:38:32,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:32,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7806 states. [2018-11-28 20:38:32,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7806 to 4716. [2018-11-28 20:38:32,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4716 states. [2018-11-28 20:38:32,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4716 states to 4716 states and 12277 transitions. [2018-11-28 20:38:32,877 INFO L78 Accepts]: Start accepts. Automaton has 4716 states and 12277 transitions. Word has length 91 [2018-11-28 20:38:32,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:32,877 INFO L480 AbstractCegarLoop]: Abstraction has 4716 states and 12277 transitions. [2018-11-28 20:38:32,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:32,877 INFO L276 IsEmpty]: Start isEmpty. Operand 4716 states and 12277 transitions. [2018-11-28 20:38:32,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:38:32,883 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:32,884 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] [2018-11-28 20:38:32,885 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:32,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:32,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1359488826, now seen corresponding path program 1 times [2018-11-28 20:38:32,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:32,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:32,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:32,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:32,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:33,298 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 20:38:33,337 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:38:33,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:33,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:33,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:33,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:33,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:33,339 INFO L87 Difference]: Start difference. First operand 4716 states and 12277 transitions. Second operand 6 states. [2018-11-28 20:38:33,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:33,574 INFO L93 Difference]: Finished difference Result 4076 states and 10405 transitions. [2018-11-28 20:38:33,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:38:33,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-11-28 20:38:33,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:33,581 INFO L225 Difference]: With dead ends: 4076 [2018-11-28 20:38:33,581 INFO L226 Difference]: Without dead ends: 4076 [2018-11-28 20:38:33,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:38:33,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2018-11-28 20:38:33,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 3489. [2018-11-28 20:38:33,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3489 states. [2018-11-28 20:38:33,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 9041 transitions. [2018-11-28 20:38:33,624 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 9041 transitions. Word has length 91 [2018-11-28 20:38:33,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:33,624 INFO L480 AbstractCegarLoop]: Abstraction has 3489 states and 9041 transitions. [2018-11-28 20:38:33,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:33,624 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 9041 transitions. [2018-11-28 20:38:33,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:33,629 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:33,629 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:38:33,629 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:33,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:33,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1413527866, now seen corresponding path program 1 times [2018-11-28 20:38:33,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:33,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:33,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:33,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:33,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:33,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:38:33,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:33,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:33,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:33,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:33,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:33,746 INFO L87 Difference]: Start difference. First operand 3489 states and 9041 transitions. Second operand 6 states. [2018-11-28 20:38:34,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:34,171 INFO L93 Difference]: Finished difference Result 3702 states and 9446 transitions. [2018-11-28 20:38:34,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:38:34,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-28 20:38:34,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:34,178 INFO L225 Difference]: With dead ends: 3702 [2018-11-28 20:38:34,178 INFO L226 Difference]: Without dead ends: 3657 [2018-11-28 20:38:34,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:34,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3657 states. [2018-11-28 20:38:34,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3657 to 3597. [2018-11-28 20:38:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3597 states. [2018-11-28 20:38:34,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 9246 transitions. [2018-11-28 20:38:34,219 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 9246 transitions. Word has length 93 [2018-11-28 20:38:34,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:34,219 INFO L480 AbstractCegarLoop]: Abstraction has 3597 states and 9246 transitions. [2018-11-28 20:38:34,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:34,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 9246 transitions. [2018-11-28 20:38:34,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:34,222 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:34,223 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:38:34,223 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:34,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:34,223 INFO L82 PathProgramCache]: Analyzing trace with hash -522132421, now seen corresponding path program 1 times [2018-11-28 20:38:34,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:34,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:34,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:34,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:34,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:34,527 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:38:34,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:34,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:38:34,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:38:34,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:38:34,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:34,528 INFO L87 Difference]: Start difference. First operand 3597 states and 9246 transitions. Second operand 7 states. [2018-11-28 20:38:36,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:36,176 INFO L93 Difference]: Finished difference Result 5508 states and 13847 transitions. [2018-11-28 20:38:36,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:38:36,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-11-28 20:38:36,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:36,185 INFO L225 Difference]: With dead ends: 5508 [2018-11-28 20:38:36,185 INFO L226 Difference]: Without dead ends: 5476 [2018-11-28 20:38:36,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-28 20:38:36,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5476 states. [2018-11-28 20:38:36,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5476 to 4226. [2018-11-28 20:38:36,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4226 states. [2018-11-28 20:38:36,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4226 states to 4226 states and 10779 transitions. [2018-11-28 20:38:36,242 INFO L78 Accepts]: Start accepts. Automaton has 4226 states and 10779 transitions. Word has length 93 [2018-11-28 20:38:36,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:36,242 INFO L480 AbstractCegarLoop]: Abstraction has 4226 states and 10779 transitions. [2018-11-28 20:38:36,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:38:36,243 INFO L276 IsEmpty]: Start isEmpty. Operand 4226 states and 10779 transitions. [2018-11-28 20:38:36,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:36,248 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:36,248 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:38:36,248 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:36,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:36,248 INFO L82 PathProgramCache]: Analyzing trace with hash 722632060, now seen corresponding path program 1 times [2018-11-28 20:38:36,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:36,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:36,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:36,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:36,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:36,670 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 20:38:36,729 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:38:36,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:36,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:38:36,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:38:36,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:38:36,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:38:36,731 INFO L87 Difference]: Start difference. First operand 4226 states and 10779 transitions. Second operand 6 states. [2018-11-28 20:38:36,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:36,880 INFO L93 Difference]: Finished difference Result 4301 states and 10863 transitions. [2018-11-28 20:38:36,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:38:36,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-28 20:38:36,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:36,886 INFO L225 Difference]: With dead ends: 4301 [2018-11-28 20:38:36,886 INFO L226 Difference]: Without dead ends: 4301 [2018-11-28 20:38:36,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:38:36,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4301 states. [2018-11-28 20:38:36,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4301 to 4171. [2018-11-28 20:38:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4171 states. [2018-11-28 20:38:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 10618 transitions. [2018-11-28 20:38:36,933 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 10618 transitions. Word has length 93 [2018-11-28 20:38:36,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:36,934 INFO L480 AbstractCegarLoop]: Abstraction has 4171 states and 10618 transitions. [2018-11-28 20:38:36,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:38:36,934 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 10618 transitions. [2018-11-28 20:38:36,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:36,939 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:36,939 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:38:36,939 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:36,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:36,940 INFO L82 PathProgramCache]: Analyzing trace with hash -192366660, now seen corresponding path program 1 times [2018-11-28 20:38:36,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:36,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:36,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:36,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:36,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:37,311 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:38:37,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:37,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:38:37,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:38:37,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:38:37,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:38:37,313 INFO L87 Difference]: Start difference. First operand 4171 states and 10618 transitions. Second operand 5 states. [2018-11-28 20:38:38,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:38,248 INFO L93 Difference]: Finished difference Result 4715 states and 11962 transitions. [2018-11-28 20:38:38,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:38:38,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-28 20:38:38,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:38,256 INFO L225 Difference]: With dead ends: 4715 [2018-11-28 20:38:38,256 INFO L226 Difference]: Without dead ends: 4683 [2018-11-28 20:38:38,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:38,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4683 states. [2018-11-28 20:38:38,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4683 to 3650. [2018-11-28 20:38:38,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3650 states. [2018-11-28 20:38:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 9341 transitions. [2018-11-28 20:38:38,306 INFO L78 Accepts]: Start accepts. Automaton has 3650 states and 9341 transitions. Word has length 93 [2018-11-28 20:38:38,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:38,306 INFO L480 AbstractCegarLoop]: Abstraction has 3650 states and 9341 transitions. [2018-11-28 20:38:38,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:38:38,306 INFO L276 IsEmpty]: Start isEmpty. Operand 3650 states and 9341 transitions. [2018-11-28 20:38:38,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:38,311 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:38,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, 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:38:38,312 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:38,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:38,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1052397821, now seen corresponding path program 1 times [2018-11-28 20:38:38,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:38,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:38,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:38,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:38,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:38,498 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:38:38,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:38,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:38:38,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:38:38,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:38:38,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:38,499 INFO L87 Difference]: Start difference. First operand 3650 states and 9341 transitions. Second operand 7 states. [2018-11-28 20:38:38,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:38,827 INFO L93 Difference]: Finished difference Result 5475 states and 14168 transitions. [2018-11-28 20:38:38,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:38:38,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-11-28 20:38:38,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:38,831 INFO L225 Difference]: With dead ends: 5475 [2018-11-28 20:38:38,832 INFO L226 Difference]: Without dead ends: 1974 [2018-11-28 20:38:38,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:38:38,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2018-11-28 20:38:38,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1974. [2018-11-28 20:38:38,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1974 states. [2018-11-28 20:38:38,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 5105 transitions. [2018-11-28 20:38:38,854 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 5105 transitions. Word has length 93 [2018-11-28 20:38:38,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:38,855 INFO L480 AbstractCegarLoop]: Abstraction has 1974 states and 5105 transitions. [2018-11-28 20:38:38,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:38:38,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 5105 transitions. [2018-11-28 20:38:38,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:38,857 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:38,857 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:38:38,858 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:38,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:38,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1073077806, now seen corresponding path program 1 times [2018-11-28 20:38:38,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:38,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:38,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:38,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:38,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:39,436 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:38:39,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:39,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:38:39,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:38:39,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:38:39,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:39,437 INFO L87 Difference]: Start difference. First operand 1974 states and 5105 transitions. Second operand 7 states. [2018-11-28 20:38:39,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:39,613 INFO L93 Difference]: Finished difference Result 1988 states and 5137 transitions. [2018-11-28 20:38:39,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:38:39,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-11-28 20:38:39,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:39,618 INFO L225 Difference]: With dead ends: 1988 [2018-11-28 20:38:39,618 INFO L226 Difference]: Without dead ends: 1988 [2018-11-28 20:38:39,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:38:39,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2018-11-28 20:38:39,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1950. [2018-11-28 20:38:39,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2018-11-28 20:38:39,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 5057 transitions. [2018-11-28 20:38:39,640 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 5057 transitions. Word has length 93 [2018-11-28 20:38:39,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:39,641 INFO L480 AbstractCegarLoop]: Abstraction has 1950 states and 5057 transitions. [2018-11-28 20:38:39,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:38:39,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 5057 transitions. [2018-11-28 20:38:39,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:39,643 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:39,643 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:38:39,644 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:39,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:39,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1021200916, now seen corresponding path program 2 times [2018-11-28 20:38:39,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:39,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:39,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:39,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:38:39,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:39,827 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:38:39,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:39,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 20:38:39,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 20:38:39,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 20:38:39,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:38:39,829 INFO L87 Difference]: Start difference. First operand 1950 states and 5057 transitions. Second operand 8 states. [2018-11-28 20:38:40,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:40,404 INFO L93 Difference]: Finished difference Result 2282 states and 5776 transitions. [2018-11-28 20:38:40,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 20:38:40,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-11-28 20:38:40,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:40,410 INFO L225 Difference]: With dead ends: 2282 [2018-11-28 20:38:40,410 INFO L226 Difference]: Without dead ends: 2253 [2018-11-28 20:38:40,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-28 20:38:40,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2018-11-28 20:38:40,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 1942. [2018-11-28 20:38:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2018-11-28 20:38:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 5031 transitions. [2018-11-28 20:38:40,435 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 5031 transitions. Word has length 93 [2018-11-28 20:38:40,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:40,436 INFO L480 AbstractCegarLoop]: Abstraction has 1942 states and 5031 transitions. [2018-11-28 20:38:40,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 20:38:40,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 5031 transitions. [2018-11-28 20:38:40,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:40,439 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:40,440 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:38:40,440 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:40,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:40,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1338106093, now seen corresponding path program 2 times [2018-11-28 20:38:40,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:40,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:40,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:40,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:38:40,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:38:40,697 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 20:38:40,804 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:38:40,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:38:40,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 20:38:40,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 20:38:40,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 20:38:40,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:38:40,806 INFO L87 Difference]: Start difference. First operand 1942 states and 5031 transitions. Second operand 12 states. [2018-11-28 20:38:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:38:41,461 INFO L93 Difference]: Finished difference Result 3699 states and 9678 transitions. [2018-11-28 20:38:41,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 20:38:41,462 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2018-11-28 20:38:41,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:38:41,466 INFO L225 Difference]: With dead ends: 3699 [2018-11-28 20:38:41,466 INFO L226 Difference]: Without dead ends: 2563 [2018-11-28 20:38:41,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-11-28 20:38:41,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2018-11-28 20:38:41,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2411. [2018-11-28 20:38:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2018-11-28 20:38:41,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 6104 transitions. [2018-11-28 20:38:41,495 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 6104 transitions. Word has length 93 [2018-11-28 20:38:41,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:38:41,495 INFO L480 AbstractCegarLoop]: Abstraction has 2411 states and 6104 transitions. [2018-11-28 20:38:41,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 20:38:41,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 6104 transitions. [2018-11-28 20:38:41,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:38:41,499 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:38:41,499 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:38:41,499 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:38:41,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:38:41,500 INFO L82 PathProgramCache]: Analyzing trace with hash 45507955, now seen corresponding path program 3 times [2018-11-28 20:38:41,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:38:41,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:38:41,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:41,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:38:41,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:38:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:38:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:38:41,577 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 20:38:41,750 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 20:38:41,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:38:41 BasicIcfg [2018-11-28 20:38:41,755 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 20:38:41,755 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 20:38:41,755 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 20:38:41,755 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 20:38:41,758 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:38:00" (3/4) ... [2018-11-28 20:38:41,762 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 20:38:41,976 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 20:38:41,981 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 20:38:41,982 INFO L168 Benchmark]: Toolchain (without parser) took 43973.91 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -237.4 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-11-28 20:38:41,984 INFO L168 Benchmark]: CDTParser took 0.16 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:38:41,984 INFO L168 Benchmark]: CACSL2BoogieTranslator took 882.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -171.5 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2018-11-28 20:38:41,984 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 20:38:41,986 INFO L168 Benchmark]: Boogie Preprocessor took 43.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:38:41,986 INFO L168 Benchmark]: RCFGBuilder took 1240.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. [2018-11-28 20:38:41,986 INFO L168 Benchmark]: TraceAbstraction took 41491.74 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -122.6 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-11-28 20:38:41,987 INFO L168 Benchmark]: Witness Printer took 225.65 ms. Allocated memory is still 3.0 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:38:41,991 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.16 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 882.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -171.5 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1240.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41491.74 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -122.6 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 225.65 ms. Allocated memory is still 3.0 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L672] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L673] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L675] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L677] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L678] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L679] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L680] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L681] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L682] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L683] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L684] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L685] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L686] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L687] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L688] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L689] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L690] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L691] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L692] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L693] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L753] -1 pthread_t t2483; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L754] FCALL, FORK -1 pthread_create(&t2483, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] -1 pthread_t t2484; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L756] FCALL, FORK -1 pthread_create(&t2484, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] 0 y$w_buff1 = y$w_buff0 [L698] 0 y$w_buff0 = 2 [L699] 0 y$w_buff1_used = y$w_buff0_used [L700] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L702] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L703] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L704] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L705] 0 y$r_buff0_thd1 = (_Bool)1 [L708] 0 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 x = 2 [L728] 1 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L712] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L712] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L731] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L731] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L713] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L714] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L718] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L763] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L764] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L765] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L766] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L769] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L770] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L771] -1 y$flush_delayed = weak$$choice2 [L772] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L774] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L775] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L776] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L777] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L778] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L779] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] -1 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y = y$flush_delayed ? y$mem_tmp : y [L782] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 178 locations, 3 error locations. UNSAFE Result, 41.3s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 21.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7076 SDtfs, 6292 SDslu, 16018 SDs, 0 SdLazy, 6614 SolverSat, 377 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 86 SyntacticMatches, 16 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43712occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.6s AutomataMinimizationTime, 30 MinimizatonAttempts, 92793 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 2453 NumberOfCodeBlocks, 2453 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2330 ConstructedInterpolants, 0 QuantifiedInterpolants, 460094 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...