./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix054_pso.opt_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/mix054_pso.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 98be72c950df5c9f21ba93d5244e9546239a88fe ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:15:11,967 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 20:15:11,969 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 20:15:11,988 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 20:15:11,989 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 20:15:11,991 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 20:15:11,993 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 20:15:11,995 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 20:15:11,999 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 20:15:12,001 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 20:15:12,004 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 20:15:12,005 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 20:15:12,006 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 20:15:12,009 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 20:15:12,017 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 20:15:12,018 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 20:15:12,020 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 20:15:12,025 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 20:15:12,028 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 20:15:12,032 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 20:15:12,035 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 20:15:12,039 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 20:15:12,043 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 20:15:12,044 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 20:15:12,045 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 20:15:12,046 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 20:15:12,049 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 20:15:12,050 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 20:15:12,051 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 20:15:12,054 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 20:15:12,055 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 20:15:12,055 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 20:15:12,056 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 20:15:12,056 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 20:15:12,059 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 20:15:12,060 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 20:15:12,062 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:15:12,083 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 20:15:12,083 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 20:15:12,084 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 20:15:12,084 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 20:15:12,085 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 20:15:12,085 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 20:15:12,085 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 20:15:12,085 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 20:15:12,085 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 20:15:12,087 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 20:15:12,087 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 20:15:12,087 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 20:15:12,087 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 20:15:12,087 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 20:15:12,087 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 20:15:12,088 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 20:15:12,088 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 20:15:12,088 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 20:15:12,088 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 20:15:12,088 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 20:15:12,089 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 20:15:12,089 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 20:15:12,089 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 20:15:12,089 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:15:12,089 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 20:15:12,090 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 20:15:12,092 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 20:15:12,092 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 20:15:12,092 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 20:15:12,092 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 20:15:12,093 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 -> 98be72c950df5c9f21ba93d5244e9546239a88fe [2018-11-28 20:15:12,150 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 20:15:12,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 20:15:12,175 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 20:15:12,176 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 20:15:12,177 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 20:15:12,178 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix054_pso.opt_false-unreach-call.i [2018-11-28 20:15:12,241 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f89ccb64/e741c47547714f78be50974d2c73349c/FLAG36c381e6a [2018-11-28 20:15:12,778 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 20:15:12,779 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix054_pso.opt_false-unreach-call.i [2018-11-28 20:15:12,795 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f89ccb64/e741c47547714f78be50974d2c73349c/FLAG36c381e6a [2018-11-28 20:15:13,030 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f89ccb64/e741c47547714f78be50974d2c73349c [2018-11-28 20:15:13,034 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 20:15:13,036 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 20:15:13,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 20:15:13,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 20:15:13,041 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 20:15:13,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:15:13" (1/1) ... [2018-11-28 20:15:13,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@432e7b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:13, skipping insertion in model container [2018-11-28 20:15:13,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:15:13" (1/1) ... [2018-11-28 20:15:13,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 20:15:13,131 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 20:15:13,675 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:15:13,705 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 20:15:13,893 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:15:13,985 INFO L195 MainTranslator]: Completed translation [2018-11-28 20:15:13,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:13 WrapperNode [2018-11-28 20:15:13,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 20:15:13,987 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 20:15:13,987 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 20:15:13,987 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 20:15:13,998 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:15:13" (1/1) ... [2018-11-28 20:15:14,020 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:15:13" (1/1) ... [2018-11-28 20:15:14,059 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 20:15:14,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 20:15:14,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 20:15:14,059 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 20:15:14,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:13" (1/1) ... [2018-11-28 20:15:14,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:13" (1/1) ... [2018-11-28 20:15:14,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:13" (1/1) ... [2018-11-28 20:15:14,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:13" (1/1) ... [2018-11-28 20:15:14,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:13" (1/1) ... [2018-11-28 20:15:14,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:13" (1/1) ... [2018-11-28 20:15:14,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:13" (1/1) ... [2018-11-28 20:15:14,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 20:15:14,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 20:15:14,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 20:15:14,103 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 20:15:14,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:15:14,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 20:15:14,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 20:15:14,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 20:15:14,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 20:15:14,178 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 20:15:14,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 20:15:14,179 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 20:15:14,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 20:15:14,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 20:15:14,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 20:15:14,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 20:15:14,181 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:15:15,257 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 20:15:15,257 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 20:15:15,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:15:15 BoogieIcfgContainer [2018-11-28 20:15:15,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 20:15:15,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 20:15:15,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 20:15:15,266 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 20:15:15,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:15:13" (1/3) ... [2018-11-28 20:15:15,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7835555f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:15:15, skipping insertion in model container [2018-11-28 20:15:15,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:15:13" (2/3) ... [2018-11-28 20:15:15,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7835555f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:15:15, skipping insertion in model container [2018-11-28 20:15:15,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:15:15" (3/3) ... [2018-11-28 20:15:15,274 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_false-unreach-call.i [2018-11-28 20:15:15,324 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,325 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,325 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,326 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,326 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,327 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,327 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,327 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,327 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,327 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,328 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,328 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,328 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,328 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,329 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,329 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,329 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,329 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,331 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,331 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,331 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,331 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,332 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,332 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,332 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,332 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,332 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,332 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,333 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,333 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,334 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,334 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,334 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,334 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,334 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,335 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,335 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,335 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,335 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,336 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,336 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,336 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,336 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,338 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,338 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,338 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,338 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:15:15,366 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 20:15:15,367 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 20:15:15,376 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 20:15:15,395 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 20:15:15,423 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 20:15:15,424 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 20:15:15,424 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 20:15:15,424 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 20:15:15,425 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 20:15:15,425 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 20:15:15,425 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 20:15:15,425 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 20:15:15,425 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 20:15:15,439 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2018-11-28 20:15:17,160 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25087 states. [2018-11-28 20:15:17,163 INFO L276 IsEmpty]: Start isEmpty. Operand 25087 states. [2018-11-28 20:15:17,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 20:15:17,172 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:17,173 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] [2018-11-28 20:15:17,175 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:17,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:17,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1104590460, now seen corresponding path program 1 times [2018-11-28 20:15:17,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:17,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:17,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:17,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:17,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:17,603 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:15:17,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:17,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:15:17,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:15:17,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:15:17,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:17,632 INFO L87 Difference]: Start difference. First operand 25087 states. Second operand 4 states. [2018-11-28 20:15:18,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:18,753 INFO L93 Difference]: Finished difference Result 45387 states and 177625 transitions. [2018-11-28 20:15:18,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:15:18,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-28 20:15:18,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:19,116 INFO L225 Difference]: With dead ends: 45387 [2018-11-28 20:15:19,116 INFO L226 Difference]: Without dead ends: 40627 [2018-11-28 20:15:19,118 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:15:19,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40627 states. [2018-11-28 20:15:20,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40627 to 23661. [2018-11-28 20:15:20,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23661 states. [2018-11-28 20:15:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23661 states to 23661 states and 92542 transitions. [2018-11-28 20:15:20,658 INFO L78 Accepts]: Start accepts. Automaton has 23661 states and 92542 transitions. Word has length 36 [2018-11-28 20:15:20,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:20,659 INFO L480 AbstractCegarLoop]: Abstraction has 23661 states and 92542 transitions. [2018-11-28 20:15:20,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:15:20,659 INFO L276 IsEmpty]: Start isEmpty. Operand 23661 states and 92542 transitions. [2018-11-28 20:15:20,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 20:15:20,666 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:20,666 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:15:20,667 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:20,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:20,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1074635055, now seen corresponding path program 1 times [2018-11-28 20:15:20,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:20,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:20,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:20,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:20,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:21,030 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:15:21,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:21,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:21,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:21,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:21,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:21,034 INFO L87 Difference]: Start difference. First operand 23661 states and 92542 transitions. Second operand 5 states. [2018-11-28 20:15:24,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:24,505 INFO L93 Difference]: Finished difference Result 64829 states and 241368 transitions. [2018-11-28 20:15:24,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:15:24,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-28 20:15:24,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:24,937 INFO L225 Difference]: With dead ends: 64829 [2018-11-28 20:15:24,938 INFO L226 Difference]: Without dead ends: 64669 [2018-11-28 20:15:24,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:15:25,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64669 states. [2018-11-28 20:15:26,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64669 to 37141. [2018-11-28 20:15:26,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37141 states. [2018-11-28 20:15:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37141 states to 37141 states and 138283 transitions. [2018-11-28 20:15:26,792 INFO L78 Accepts]: Start accepts. Automaton has 37141 states and 138283 transitions. Word has length 43 [2018-11-28 20:15:26,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:26,795 INFO L480 AbstractCegarLoop]: Abstraction has 37141 states and 138283 transitions. [2018-11-28 20:15:26,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:26,796 INFO L276 IsEmpty]: Start isEmpty. Operand 37141 states and 138283 transitions. [2018-11-28 20:15:26,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 20:15:26,808 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:26,808 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] [2018-11-28 20:15:26,809 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:26,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:26,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1003362560, now seen corresponding path program 1 times [2018-11-28 20:15:26,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:26,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:26,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:26,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:26,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:27,015 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:15:27,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:27,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:15:27,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:15:27,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:15:27,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:27,018 INFO L87 Difference]: Start difference. First operand 37141 states and 138283 transitions. Second operand 4 states. [2018-11-28 20:15:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:27,337 INFO L93 Difference]: Finished difference Result 12363 states and 41176 transitions. [2018-11-28 20:15:27,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:15:27,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-28 20:15:27,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:27,367 INFO L225 Difference]: With dead ends: 12363 [2018-11-28 20:15:27,367 INFO L226 Difference]: Without dead ends: 11842 [2018-11-28 20:15:27,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:27,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2018-11-28 20:15:27,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 11842. [2018-11-28 20:15:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11842 states. [2018-11-28 20:15:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11842 states to 11842 states and 39621 transitions. [2018-11-28 20:15:27,648 INFO L78 Accepts]: Start accepts. Automaton has 11842 states and 39621 transitions. Word has length 44 [2018-11-28 20:15:27,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:27,649 INFO L480 AbstractCegarLoop]: Abstraction has 11842 states and 39621 transitions. [2018-11-28 20:15:27,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:15:27,649 INFO L276 IsEmpty]: Start isEmpty. Operand 11842 states and 39621 transitions. [2018-11-28 20:15:27,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 20:15:27,659 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:27,659 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] [2018-11-28 20:15:27,660 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:27,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:27,660 INFO L82 PathProgramCache]: Analyzing trace with hash -76351538, now seen corresponding path program 1 times [2018-11-28 20:15:27,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:27,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:27,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:27,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:27,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:27,872 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:15:27,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:27,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:15:27,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:15:27,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:15:27,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:27,873 INFO L87 Difference]: Start difference. First operand 11842 states and 39621 transitions. Second operand 4 states. [2018-11-28 20:15:28,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:28,256 INFO L93 Difference]: Finished difference Result 17018 states and 55692 transitions. [2018-11-28 20:15:28,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:15:28,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-11-28 20:15:28,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:28,293 INFO L225 Difference]: With dead ends: 17018 [2018-11-28 20:15:28,293 INFO L226 Difference]: Without dead ends: 17018 [2018-11-28 20:15:28,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:28,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17018 states. [2018-11-28 20:15:28,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17018 to 12878. [2018-11-28 20:15:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12878 states. [2018-11-28 20:15:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12878 states to 12878 states and 42719 transitions. [2018-11-28 20:15:28,615 INFO L78 Accepts]: Start accepts. Automaton has 12878 states and 42719 transitions. Word has length 57 [2018-11-28 20:15:28,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:28,616 INFO L480 AbstractCegarLoop]: Abstraction has 12878 states and 42719 transitions. [2018-11-28 20:15:28,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:15:28,616 INFO L276 IsEmpty]: Start isEmpty. Operand 12878 states and 42719 transitions. [2018-11-28 20:15:28,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 20:15:28,623 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:28,623 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] [2018-11-28 20:15:28,624 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:28,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:28,624 INFO L82 PathProgramCache]: Analyzing trace with hash 217321422, now seen corresponding path program 1 times [2018-11-28 20:15:28,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:28,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:28,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:28,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:28,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:28,777 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:15:28,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:28,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:28,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:28,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:28,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:28,780 INFO L87 Difference]: Start difference. First operand 12878 states and 42719 transitions. Second operand 5 states. [2018-11-28 20:15:28,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:28,869 INFO L93 Difference]: Finished difference Result 2522 states and 6736 transitions. [2018-11-28 20:15:28,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:15:28,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-11-28 20:15:28,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:28,874 INFO L225 Difference]: With dead ends: 2522 [2018-11-28 20:15:28,874 INFO L226 Difference]: Without dead ends: 2110 [2018-11-28 20:15:28,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:28,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2018-11-28 20:15:28,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 2007. [2018-11-28 20:15:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2018-11-28 20:15:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 5339 transitions. [2018-11-28 20:15:29,311 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 5339 transitions. Word has length 57 [2018-11-28 20:15:29,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:29,312 INFO L480 AbstractCegarLoop]: Abstraction has 2007 states and 5339 transitions. [2018-11-28 20:15:29,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:29,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 5339 transitions. [2018-11-28 20:15:29,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-28 20:15:29,318 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:29,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:29,318 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:29,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:29,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1229710074, now seen corresponding path program 1 times [2018-11-28 20:15:29,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:29,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:29,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:29,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:29,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:29,595 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:15:29,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:29,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:15:29,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:15:29,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:15:29,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:29,597 INFO L87 Difference]: Start difference. First operand 2007 states and 5339 transitions. Second operand 7 states. [2018-11-28 20:15:30,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:30,440 INFO L93 Difference]: Finished difference Result 2413 states and 6166 transitions. [2018-11-28 20:15:30,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:15:30,441 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2018-11-28 20:15:30,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:30,446 INFO L225 Difference]: With dead ends: 2413 [2018-11-28 20:15:30,446 INFO L226 Difference]: Without dead ends: 2329 [2018-11-28 20:15:30,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:15:30,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2018-11-28 20:15:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 2253. [2018-11-28 20:15:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2253 states. [2018-11-28 20:15:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 5861 transitions. [2018-11-28 20:15:30,474 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 5861 transitions. Word has length 90 [2018-11-28 20:15:30,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:30,474 INFO L480 AbstractCegarLoop]: Abstraction has 2253 states and 5861 transitions. [2018-11-28 20:15:30,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:15:30,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 5861 transitions. [2018-11-28 20:15:30,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-28 20:15:30,479 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:30,480 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] [2018-11-28 20:15:30,480 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:30,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:30,480 INFO L82 PathProgramCache]: Analyzing trace with hash -2095676199, now seen corresponding path program 1 times [2018-11-28 20:15:30,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:30,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:30,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:30,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:30,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:30,717 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:15:30,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:30,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:30,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:30,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:30,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:30,719 INFO L87 Difference]: Start difference. First operand 2253 states and 5861 transitions. Second operand 5 states. [2018-11-28 20:15:31,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:31,059 INFO L93 Difference]: Finished difference Result 2790 states and 7091 transitions. [2018-11-28 20:15:31,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:15:31,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2018-11-28 20:15:31,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:31,064 INFO L225 Difference]: With dead ends: 2790 [2018-11-28 20:15:31,064 INFO L226 Difference]: Without dead ends: 2751 [2018-11-28 20:15:31,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:15:31,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2751 states. [2018-11-28 20:15:31,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2751 to 2379. [2018-11-28 20:15:31,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2379 states. [2018-11-28 20:15:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 6127 transitions. [2018-11-28 20:15:31,101 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 6127 transitions. Word has length 90 [2018-11-28 20:15:31,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:31,101 INFO L480 AbstractCegarLoop]: Abstraction has 2379 states and 6127 transitions. [2018-11-28 20:15:31,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:31,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 6127 transitions. [2018-11-28 20:15:31,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-28 20:15:31,108 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:31,108 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] [2018-11-28 20:15:31,109 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:31,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:31,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1989063700, now seen corresponding path program 1 times [2018-11-28 20:15:31,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:31,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:31,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:31,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:31,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:31,194 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:15:31,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:31,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:15:31,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:15:31,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:15:31,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:15:31,195 INFO L87 Difference]: Start difference. First operand 2379 states and 6127 transitions. Second operand 3 states. [2018-11-28 20:15:31,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:31,367 INFO L93 Difference]: Finished difference Result 2489 states and 6361 transitions. [2018-11-28 20:15:31,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:15:31,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-11-28 20:15:31,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:31,372 INFO L225 Difference]: With dead ends: 2489 [2018-11-28 20:15:31,372 INFO L226 Difference]: Without dead ends: 2489 [2018-11-28 20:15:31,373 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:15:31,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2018-11-28 20:15:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2417. [2018-11-28 20:15:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2417 states. [2018-11-28 20:15:31,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2417 states and 6205 transitions. [2018-11-28 20:15:31,401 INFO L78 Accepts]: Start accepts. Automaton has 2417 states and 6205 transitions. Word has length 90 [2018-11-28 20:15:31,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:31,402 INFO L480 AbstractCegarLoop]: Abstraction has 2417 states and 6205 transitions. [2018-11-28 20:15:31,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:15:31,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 6205 transitions. [2018-11-28 20:15:31,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:31,408 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:31,408 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] [2018-11-28 20:15:31,409 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:31,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:31,409 INFO L82 PathProgramCache]: Analyzing trace with hash 353378826, now seen corresponding path program 1 times [2018-11-28 20:15:31,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:31,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:31,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:31,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:31,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:31,613 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:15:31,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:31,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:15:31,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:15:31,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:15:31,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:31,615 INFO L87 Difference]: Start difference. First operand 2417 states and 6205 transitions. Second operand 4 states. [2018-11-28 20:15:31,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:31,816 INFO L93 Difference]: Finished difference Result 4371 states and 11304 transitions. [2018-11-28 20:15:31,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:15:31,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-28 20:15:31,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:31,824 INFO L225 Difference]: With dead ends: 4371 [2018-11-28 20:15:31,824 INFO L226 Difference]: Without dead ends: 4371 [2018-11-28 20:15:31,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:31,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4371 states. [2018-11-28 20:15:31,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4371 to 2349. [2018-11-28 20:15:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2349 states. [2018-11-28 20:15:31,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 5959 transitions. [2018-11-28 20:15:31,870 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 5959 transitions. Word has length 92 [2018-11-28 20:15:31,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:31,871 INFO L480 AbstractCegarLoop]: Abstraction has 2349 states and 5959 transitions. [2018-11-28 20:15:31,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:15:31,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 5959 transitions. [2018-11-28 20:15:31,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:31,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:31,876 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] [2018-11-28 20:15:31,876 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:31,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:31,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1349001223, now seen corresponding path program 1 times [2018-11-28 20:15:31,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:31,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:31,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:31,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:31,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:32,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:15:32,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:32,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:15:32,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:15:32,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:15:32,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:32,125 INFO L87 Difference]: Start difference. First operand 2349 states and 5959 transitions. Second operand 4 states. [2018-11-28 20:15:32,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:32,276 INFO L93 Difference]: Finished difference Result 2685 states and 6879 transitions. [2018-11-28 20:15:32,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:15:32,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-28 20:15:32,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:32,281 INFO L225 Difference]: With dead ends: 2685 [2018-11-28 20:15:32,282 INFO L226 Difference]: Without dead ends: 2685 [2018-11-28 20:15:32,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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:15:32,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2018-11-28 20:15:32,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2653. [2018-11-28 20:15:32,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2653 states. [2018-11-28 20:15:32,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 6799 transitions. [2018-11-28 20:15:32,311 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 6799 transitions. Word has length 92 [2018-11-28 20:15:32,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:32,311 INFO L480 AbstractCegarLoop]: Abstraction has 2653 states and 6799 transitions. [2018-11-28 20:15:32,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:15:32,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 6799 transitions. [2018-11-28 20:15:32,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:32,316 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:32,316 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] [2018-11-28 20:15:32,317 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:32,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:32,317 INFO L82 PathProgramCache]: Analyzing trace with hash 868756730, now seen corresponding path program 1 times [2018-11-28 20:15:32,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:32,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:32,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:32,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:32,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:32,470 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:15:32,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:32,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:15:32,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:15:32,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:15:32,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:15:32,471 INFO L87 Difference]: Start difference. First operand 2653 states and 6799 transitions. Second operand 6 states. [2018-11-28 20:15:33,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:33,060 INFO L93 Difference]: Finished difference Result 3995 states and 10189 transitions. [2018-11-28 20:15:33,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:15:33,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-11-28 20:15:33,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:33,067 INFO L225 Difference]: With dead ends: 3995 [2018-11-28 20:15:33,067 INFO L226 Difference]: Without dead ends: 3963 [2018-11-28 20:15:33,068 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:15:33,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3963 states. [2018-11-28 20:15:33,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3963 to 3559. [2018-11-28 20:15:33,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3559 states. [2018-11-28 20:15:33,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3559 states to 3559 states and 9122 transitions. [2018-11-28 20:15:33,115 INFO L78 Accepts]: Start accepts. Automaton has 3559 states and 9122 transitions. Word has length 92 [2018-11-28 20:15:33,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:33,116 INFO L480 AbstractCegarLoop]: Abstraction has 3559 states and 9122 transitions. [2018-11-28 20:15:33,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:15:33,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3559 states and 9122 transitions. [2018-11-28 20:15:33,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:33,123 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:33,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, 1] [2018-11-28 20:15:33,123 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:33,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:33,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1830370747, now seen corresponding path program 1 times [2018-11-28 20:15:33,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:33,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:33,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:33,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:33,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:33,749 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:15:33,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:33,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:15:33,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:15:33,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:15:33,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:33,751 INFO L87 Difference]: Start difference. First operand 3559 states and 9122 transitions. Second operand 7 states. [2018-11-28 20:15:34,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:34,368 INFO L93 Difference]: Finished difference Result 7660 states and 19944 transitions. [2018-11-28 20:15:34,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 20:15:34,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-11-28 20:15:34,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:34,379 INFO L225 Difference]: With dead ends: 7660 [2018-11-28 20:15:34,380 INFO L226 Difference]: Without dead ends: 7660 [2018-11-28 20:15:34,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-28 20:15:34,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7660 states. [2018-11-28 20:15:34,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7660 to 4179. [2018-11-28 20:15:34,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4179 states. [2018-11-28 20:15:34,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4179 states to 4179 states and 10752 transitions. [2018-11-28 20:15:34,447 INFO L78 Accepts]: Start accepts. Automaton has 4179 states and 10752 transitions. Word has length 92 [2018-11-28 20:15:34,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:34,447 INFO L480 AbstractCegarLoop]: Abstraction has 4179 states and 10752 transitions. [2018-11-28 20:15:34,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:15:34,448 INFO L276 IsEmpty]: Start isEmpty. Operand 4179 states and 10752 transitions. [2018-11-28 20:15:34,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:34,454 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:34,454 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] [2018-11-28 20:15:34,454 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:34,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:34,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1219832068, now seen corresponding path program 1 times [2018-11-28 20:15:34,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:34,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:34,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:34,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:34,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:34,971 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:15:34,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:34,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:15:34,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:15:34,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:15:34,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:34,973 INFO L87 Difference]: Start difference. First operand 4179 states and 10752 transitions. Second operand 7 states. [2018-11-28 20:15:35,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:35,449 INFO L93 Difference]: Finished difference Result 3925 states and 10102 transitions. [2018-11-28 20:15:35,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:15:35,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-11-28 20:15:35,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:35,455 INFO L225 Difference]: With dead ends: 3925 [2018-11-28 20:15:35,456 INFO L226 Difference]: Without dead ends: 3925 [2018-11-28 20:15:35,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:15:35,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2018-11-28 20:15:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3771. [2018-11-28 20:15:35,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3771 states. [2018-11-28 20:15:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3771 states to 3771 states and 9774 transitions. [2018-11-28 20:15:35,504 INFO L78 Accepts]: Start accepts. Automaton has 3771 states and 9774 transitions. Word has length 92 [2018-11-28 20:15:35,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:35,504 INFO L480 AbstractCegarLoop]: Abstraction has 3771 states and 9774 transitions. [2018-11-28 20:15:35,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:15:35,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3771 states and 9774 transitions. [2018-11-28 20:15:35,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:35,511 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:35,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, 1, 1, 1] [2018-11-28 20:15:35,512 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:35,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:35,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1611236628, now seen corresponding path program 1 times [2018-11-28 20:15:35,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:35,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:35,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:35,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:35,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:36,068 WARN L180 SmtUtils]: Spent 457.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-28 20:15:36,637 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:15:36,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:36,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:15:36,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:15:36,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:15:36,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:36,638 INFO L87 Difference]: Start difference. First operand 3771 states and 9774 transitions. Second operand 7 states. [2018-11-28 20:15:37,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:37,249 INFO L93 Difference]: Finished difference Result 4019 states and 10380 transitions. [2018-11-28 20:15:37,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:15:37,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-11-28 20:15:37,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:37,255 INFO L225 Difference]: With dead ends: 4019 [2018-11-28 20:15:37,255 INFO L226 Difference]: Without dead ends: 4019 [2018-11-28 20:15:37,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:37,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4019 states. [2018-11-28 20:15:37,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4019 to 3753. [2018-11-28 20:15:37,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3753 states. [2018-11-28 20:15:37,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 9738 transitions. [2018-11-28 20:15:37,299 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 9738 transitions. Word has length 92 [2018-11-28 20:15:37,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:37,300 INFO L480 AbstractCegarLoop]: Abstraction has 3753 states and 9738 transitions. [2018-11-28 20:15:37,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:15:37,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 9738 transitions. [2018-11-28 20:15:37,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:37,306 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:37,306 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] [2018-11-28 20:15:37,306 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:37,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:37,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1500383371, now seen corresponding path program 1 times [2018-11-28 20:15:37,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:37,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:37,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:37,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:37,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:37,473 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:15:37,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:37,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:37,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:37,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:37,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:37,474 INFO L87 Difference]: Start difference. First operand 3753 states and 9738 transitions. Second operand 5 states. [2018-11-28 20:15:37,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:37,607 INFO L93 Difference]: Finished difference Result 3485 states and 9046 transitions. [2018-11-28 20:15:37,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:15:37,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-11-28 20:15:37,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:37,613 INFO L225 Difference]: With dead ends: 3485 [2018-11-28 20:15:37,613 INFO L226 Difference]: Without dead ends: 3485 [2018-11-28 20:15:37,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:15:37,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2018-11-28 20:15:37,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 3485. [2018-11-28 20:15:37,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3485 states. [2018-11-28 20:15:37,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 3485 states and 9046 transitions. [2018-11-28 20:15:37,652 INFO L78 Accepts]: Start accepts. Automaton has 3485 states and 9046 transitions. Word has length 92 [2018-11-28 20:15:37,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:37,653 INFO L480 AbstractCegarLoop]: Abstraction has 3485 states and 9046 transitions. [2018-11-28 20:15:37,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:37,653 INFO L276 IsEmpty]: Start isEmpty. Operand 3485 states and 9046 transitions. [2018-11-28 20:15:37,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:37,659 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:37,659 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] [2018-11-28 20:15:37,659 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:37,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:37,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1051686732, now seen corresponding path program 1 times [2018-11-28 20:15:37,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:37,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:37,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:37,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:37,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:38,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:15:38,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:38,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:15:38,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:15:38,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:15:38,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:15:38,040 INFO L87 Difference]: Start difference. First operand 3485 states and 9046 transitions. Second operand 6 states. [2018-11-28 20:15:38,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:38,231 INFO L93 Difference]: Finished difference Result 2877 states and 7206 transitions. [2018-11-28 20:15:38,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:15:38,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-11-28 20:15:38,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:38,236 INFO L225 Difference]: With dead ends: 2877 [2018-11-28 20:15:38,236 INFO L226 Difference]: Without dead ends: 2877 [2018-11-28 20:15:38,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:38,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2018-11-28 20:15:38,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 1898. [2018-11-28 20:15:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2018-11-28 20:15:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 4870 transitions. [2018-11-28 20:15:38,267 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 4870 transitions. Word has length 92 [2018-11-28 20:15:38,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:38,267 INFO L480 AbstractCegarLoop]: Abstraction has 1898 states and 4870 transitions. [2018-11-28 20:15:38,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:15:38,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 4870 transitions. [2018-11-28 20:15:38,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:15:38,271 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:38,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:38,272 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:38,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:38,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1789071189, now seen corresponding path program 1 times [2018-11-28 20:15:38,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:38,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:38,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:38,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:38,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:38,465 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:15:38,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:38,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:15:38,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:15:38,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:15:38,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:38,467 INFO L87 Difference]: Start difference. First operand 1898 states and 4870 transitions. Second operand 7 states. [2018-11-28 20:15:39,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:39,086 INFO L93 Difference]: Finished difference Result 2829 states and 7095 transitions. [2018-11-28 20:15:39,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 20:15:39,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-11-28 20:15:39,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:39,091 INFO L225 Difference]: With dead ends: 2829 [2018-11-28 20:15:39,091 INFO L226 Difference]: Without dead ends: 2829 [2018-11-28 20:15:39,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-28 20:15:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2018-11-28 20:15:39,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2248. [2018-11-28 20:15:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2018-11-28 20:15:39,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 5728 transitions. [2018-11-28 20:15:39,119 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 5728 transitions. Word has length 94 [2018-11-28 20:15:39,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:39,120 INFO L480 AbstractCegarLoop]: Abstraction has 2248 states and 5728 transitions. [2018-11-28 20:15:39,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:15:39,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 5728 transitions. [2018-11-28 20:15:39,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:15:39,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:39,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:39,124 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:39,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:39,124 INFO L82 PathProgramCache]: Analyzing trace with hash -544306708, now seen corresponding path program 1 times [2018-11-28 20:15:39,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:39,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:39,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:39,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:39,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:39,393 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:15:39,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:39,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:15:39,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:15:39,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:15:39,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:15:39,395 INFO L87 Difference]: Start difference. First operand 2248 states and 5728 transitions. Second operand 6 states. [2018-11-28 20:15:39,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:39,770 INFO L93 Difference]: Finished difference Result 2288 states and 5773 transitions. [2018-11-28 20:15:39,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:15:39,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-11-28 20:15:39,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:39,775 INFO L225 Difference]: With dead ends: 2288 [2018-11-28 20:15:39,775 INFO L226 Difference]: Without dead ends: 2288 [2018-11-28 20:15:39,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:15:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2288 states. [2018-11-28 20:15:39,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2288 to 2233. [2018-11-28 20:15:39,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2233 states. [2018-11-28 20:15:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 5666 transitions. [2018-11-28 20:15:39,799 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 5666 transitions. Word has length 94 [2018-11-28 20:15:39,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:39,800 INFO L480 AbstractCegarLoop]: Abstraction has 2233 states and 5666 transitions. [2018-11-28 20:15:39,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:15:39,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 5666 transitions. [2018-11-28 20:15:39,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:15:39,803 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:39,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:39,804 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:39,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:39,804 INFO L82 PathProgramCache]: Analyzing trace with hash 917273291, now seen corresponding path program 1 times [2018-11-28 20:15:39,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:39,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:39,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:39,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:39,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:40,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:15:40,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:40,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:15:40,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:15:40,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:15:40,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:15:40,136 INFO L87 Difference]: Start difference. First operand 2233 states and 5666 transitions. Second operand 6 states. [2018-11-28 20:15:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:40,480 INFO L93 Difference]: Finished difference Result 2309 states and 5831 transitions. [2018-11-28 20:15:40,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:15:40,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-11-28 20:15:40,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:40,484 INFO L225 Difference]: With dead ends: 2309 [2018-11-28 20:15:40,484 INFO L226 Difference]: Without dead ends: 2309 [2018-11-28 20:15:40,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:15:40,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2018-11-28 20:15:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2272. [2018-11-28 20:15:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2272 states. [2018-11-28 20:15:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 5758 transitions. [2018-11-28 20:15:40,506 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 5758 transitions. Word has length 94 [2018-11-28 20:15:40,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:40,506 INFO L480 AbstractCegarLoop]: Abstraction has 2272 states and 5758 transitions. [2018-11-28 20:15:40,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:15:40,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 5758 transitions. [2018-11-28 20:15:40,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:15:40,510 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:40,510 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:40,510 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:40,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:40,511 INFO L82 PathProgramCache]: Analyzing trace with hash 2274571, now seen corresponding path program 1 times [2018-11-28 20:15:40,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:40,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:40,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:40,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:40,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:40,626 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:15:40,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:40,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:40,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:40,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:40,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:40,628 INFO L87 Difference]: Start difference. First operand 2272 states and 5758 transitions. Second operand 5 states. [2018-11-28 20:15:40,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:40,868 INFO L93 Difference]: Finished difference Result 2592 states and 6558 transitions. [2018-11-28 20:15:40,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:15:40,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-11-28 20:15:40,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:40,872 INFO L225 Difference]: With dead ends: 2592 [2018-11-28 20:15:40,872 INFO L226 Difference]: Without dead ends: 2592 [2018-11-28 20:15:40,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:40,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2018-11-28 20:15:40,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2033. [2018-11-28 20:15:40,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2033 states. [2018-11-28 20:15:40,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 5159 transitions. [2018-11-28 20:15:40,897 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 5159 transitions. Word has length 94 [2018-11-28 20:15:40,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:40,898 INFO L480 AbstractCegarLoop]: Abstraction has 2033 states and 5159 transitions. [2018-11-28 20:15:40,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:40,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 5159 transitions. [2018-11-28 20:15:40,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:15:40,901 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:40,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:40,902 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:40,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:40,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1247039052, now seen corresponding path program 1 times [2018-11-28 20:15:40,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:40,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:40,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:40,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:40,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:41,164 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:15:41,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:41,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 20:15:41,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 20:15:41,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 20:15:41,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:15:41,166 INFO L87 Difference]: Start difference. First operand 2033 states and 5159 transitions. Second operand 10 states. [2018-11-28 20:15:41,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:41,743 INFO L93 Difference]: Finished difference Result 3753 states and 9690 transitions. [2018-11-28 20:15:41,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:15:41,744 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2018-11-28 20:15:41,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:41,747 INFO L225 Difference]: With dead ends: 3753 [2018-11-28 20:15:41,747 INFO L226 Difference]: Without dead ends: 1754 [2018-11-28 20:15:41,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-11-28 20:15:41,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2018-11-28 20:15:41,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1754. [2018-11-28 20:15:41,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2018-11-28 20:15:41,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 4578 transitions. [2018-11-28 20:15:41,766 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 4578 transitions. Word has length 94 [2018-11-28 20:15:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:41,766 INFO L480 AbstractCegarLoop]: Abstraction has 1754 states and 4578 transitions. [2018-11-28 20:15:41,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 20:15:41,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 4578 transitions. [2018-11-28 20:15:41,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:15:41,770 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:41,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:41,770 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:41,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:41,770 INFO L82 PathProgramCache]: Analyzing trace with hash 550053201, now seen corresponding path program 1 times [2018-11-28 20:15:41,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:41,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:41,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:41,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:41,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:42,082 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 20:15:42,128 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:15:42,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:42,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:15:42,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:15:42,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:15:42,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:15:42,129 INFO L87 Difference]: Start difference. First operand 1754 states and 4578 transitions. Second operand 6 states. [2018-11-28 20:15:42,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:42,280 INFO L93 Difference]: Finished difference Result 1840 states and 4742 transitions. [2018-11-28 20:15:42,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:15:42,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-11-28 20:15:42,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:42,284 INFO L225 Difference]: With dead ends: 1840 [2018-11-28 20:15:42,284 INFO L226 Difference]: Without dead ends: 1824 [2018-11-28 20:15:42,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:42,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2018-11-28 20:15:42,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1754. [2018-11-28 20:15:42,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2018-11-28 20:15:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 4570 transitions. [2018-11-28 20:15:42,303 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 4570 transitions. Word has length 94 [2018-11-28 20:15:42,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:42,304 INFO L480 AbstractCegarLoop]: Abstraction has 1754 states and 4570 transitions. [2018-11-28 20:15:42,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:15:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 4570 transitions. [2018-11-28 20:15:42,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:15:42,307 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:42,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:42,308 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:42,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:42,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1150687278, now seen corresponding path program 2 times [2018-11-28 20:15:42,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:42,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:42,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:42,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:42,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:15:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:15:42,393 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 20:15:42,548 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 20:15:42,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:15:42 BasicIcfg [2018-11-28 20:15:42,550 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 20:15:42,550 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 20:15:42,550 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 20:15:42,550 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 20:15:42,551 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:15:15" (3/4) ... [2018-11-28 20:15:42,554 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 20:15:42,757 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 20:15:42,758 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 20:15:42,763 INFO L168 Benchmark]: Toolchain (without parser) took 29728.01 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 947.3 MB in the beginning and 1.0 GB in the end (delta: -101.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-11-28 20:15:42,763 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:15:42,764 INFO L168 Benchmark]: CACSL2BoogieTranslator took 949.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-11-28 20:15:42,764 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.74 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 20:15:42,764 INFO L168 Benchmark]: Boogie Preprocessor took 43.75 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:15:42,766 INFO L168 Benchmark]: RCFGBuilder took 1156.29 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: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. [2018-11-28 20:15:42,767 INFO L168 Benchmark]: TraceAbstraction took 27289.45 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -7.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-28 20:15:42,767 INFO L168 Benchmark]: Witness Printer took 211.46 ms. Allocated memory is still 2.4 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-11-28 20:15:42,770 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 949.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.74 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.75 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 1156.29 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: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27289.45 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -7.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 211.46 ms. Allocated memory is still 2.4 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L674] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L675] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L677] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L678] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L679] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L680] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L681] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L682] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L683] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L684] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L685] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L686] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L687] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L688] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L689] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L690] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L691] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L693] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L694] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L695] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] -1 pthread_t t1449; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] FCALL, FORK -1 pthread_create(&t1449, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] -1 pthread_t t1450; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] FCALL, FORK -1 pthread_create(&t1450, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 x$w_buff1 = x$w_buff0 [L720] 0 x$w_buff0 = 2 [L721] 0 x$w_buff1_used = x$w_buff0_used [L722] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L725] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L726] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L727] 0 x$r_buff0_thd2 = (_Bool)1 [L730] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L699] 1 y = 1 [L702] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L705] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L705] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L706] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L706] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L733] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L707] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L733] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L734] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L735] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L735] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L736] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L737] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L740] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L708] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L708] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L709] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L712] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L765] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L765] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L766] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L766] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L767] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L767] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L768] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L771] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L772] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L773] -1 x$flush_delayed = weak$$choice2 [L774] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L776] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L777] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L777] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L778] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L778] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L779] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L780] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L781] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L781] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L782] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] -1 x = x$flush_delayed ? x$mem_tmp : x [L784] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 179 locations, 3 error locations. UNSAFE Result, 27.1s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 13.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4553 SDtfs, 4210 SDslu, 10004 SDs, 0 SdLazy, 3901 SolverSat, 240 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 55 SyntacticMatches, 13 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37141occurred in iteration=2, 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: 4.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 57897 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1901 NumberOfCodeBlocks, 1901 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1785 ConstructedInterpolants, 0 QuantifiedInterpolants, 366911 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...