./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix048_tso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix048_tso.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a33630d858f9e9d9dbe5753ab047ddfd5f5eb0e9 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 02:43:48,995 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 02:43:48,996 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 02:43:49,009 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 02:43:49,009 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 02:43:49,010 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 02:43:49,012 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 02:43:49,014 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 02:43:49,016 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 02:43:49,017 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 02:43:49,018 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 02:43:49,018 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 02:43:49,019 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 02:43:49,020 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 02:43:49,022 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 02:43:49,023 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 02:43:49,024 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 02:43:49,026 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 02:43:49,029 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 02:43:49,030 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 02:43:49,032 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 02:43:49,033 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 02:43:49,036 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 02:43:49,036 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 02:43:49,037 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 02:43:49,038 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 02:43:49,039 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 02:43:49,040 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 02:43:49,041 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 02:43:49,042 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 02:43:49,043 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 02:43:49,043 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 02:43:49,043 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 02:43:49,044 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 02:43:49,045 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 02:43:49,046 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 02:43:49,046 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 02:43:49,062 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 02:43:49,063 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 02:43:49,065 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 02:43:49,067 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 02:43:49,067 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 02:43:49,067 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 02:43:49,067 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 02:43:49,067 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 02:43:49,068 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 02:43:49,068 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 02:43:49,068 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 02:43:49,068 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 02:43:49,068 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 02:43:49,068 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 02:43:49,069 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 02:43:49,070 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 02:43:49,071 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 02:43:49,071 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 02:43:49,071 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 02:43:49,071 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 02:43:49,071 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 02:43:49,071 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 02:43:49,074 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 02:43:49,074 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 02:43:49,074 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 02:43:49,074 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 02:43:49,075 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 02:43:49,075 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 02:43:49,075 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 -> a33630d858f9e9d9dbe5753ab047ddfd5f5eb0e9 [2019-01-13 02:43:49,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 02:43:49,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 02:43:49,148 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 02:43:49,150 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 02:43:49,150 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 02:43:49,151 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix048_tso.oepc_false-unreach-call.i [2019-01-13 02:43:49,214 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e75ab2f5a/b2a9ecba8355480d9fbb78645171dcb6/FLAGa1f8913c7 [2019-01-13 02:43:49,804 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 02:43:49,805 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix048_tso.oepc_false-unreach-call.i [2019-01-13 02:43:49,824 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e75ab2f5a/b2a9ecba8355480d9fbb78645171dcb6/FLAGa1f8913c7 [2019-01-13 02:43:50,056 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e75ab2f5a/b2a9ecba8355480d9fbb78645171dcb6 [2019-01-13 02:43:50,060 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 02:43:50,062 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 02:43:50,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 02:43:50,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 02:43:50,068 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 02:43:50,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 02:43:50" (1/1) ... [2019-01-13 02:43:50,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37fb7911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:43:50, skipping insertion in model container [2019-01-13 02:43:50,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 02:43:50" (1/1) ... [2019-01-13 02:43:50,080 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 02:43:50,144 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 02:43:50,688 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 02:43:50,703 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 02:43:50,862 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 02:43:50,961 INFO L195 MainTranslator]: Completed translation [2019-01-13 02:43:50,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:43:50 WrapperNode [2019-01-13 02:43:50,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 02:43:50,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 02:43:50,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 02:43:50,962 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 02:43:50,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:43:50" (1/1) ... [2019-01-13 02:43:50,994 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:43:50" (1/1) ... [2019-01-13 02:43:51,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 02:43:51,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 02:43:51,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 02:43:51,047 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 02:43:51,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:43:50" (1/1) ... [2019-01-13 02:43:51,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:43:50" (1/1) ... [2019-01-13 02:43:51,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:43:50" (1/1) ... [2019-01-13 02:43:51,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:43:50" (1/1) ... [2019-01-13 02:43:51,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:43:50" (1/1) ... [2019-01-13 02:43:51,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:43:50" (1/1) ... [2019-01-13 02:43:51,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:43:50" (1/1) ... [2019-01-13 02:43:51,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 02:43:51,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 02:43:51,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 02:43:51,094 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 02:43:51,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:43:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 02:43:51,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 02:43:51,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 02:43:51,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 02:43:51,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 02:43:51,176 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 02:43:51,176 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 02:43:51,177 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 02:43:51,177 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 02:43:51,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 02:43:51,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 02:43:51,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 02:43:51,180 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 02:43:52,369 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 02:43:52,371 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 02:43:52,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 02:43:52 BoogieIcfgContainer [2019-01-13 02:43:52,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 02:43:52,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 02:43:52,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 02:43:52,378 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 02:43:52,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 02:43:50" (1/3) ... [2019-01-13 02:43:52,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3fe396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 02:43:52, skipping insertion in model container [2019-01-13 02:43:52,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:43:50" (2/3) ... [2019-01-13 02:43:52,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3fe396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 02:43:52, skipping insertion in model container [2019-01-13 02:43:52,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 02:43:52" (3/3) ... [2019-01-13 02:43:52,383 INFO L112 eAbstractionObserver]: Analyzing ICFG mix048_tso.oepc_false-unreach-call.i [2019-01-13 02:43:52,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,429 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,429 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,429 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,430 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,430 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,433 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,433 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,433 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,433 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,433 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,434 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,434 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,434 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,434 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,435 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,435 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,435 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,435 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,435 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,436 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,436 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,436 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,436 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,436 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,437 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,437 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,439 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,440 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,440 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,446 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,446 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,446 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,446 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,446 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,448 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,448 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,448 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,448 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,449 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,449 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,449 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,449 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,449 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,450 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,450 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,450 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,450 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,450 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,451 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,451 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,451 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,451 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:43:52,498 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 02:43:52,499 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 02:43:52,509 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 02:43:52,527 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 02:43:52,556 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 02:43:52,557 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 02:43:52,557 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 02:43:52,558 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 02:43:52,558 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 02:43:52,558 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 02:43:52,558 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 02:43:52,558 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 02:43:52,558 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 02:43:52,573 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2019-01-13 02:43:55,167 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2019-01-13 02:43:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2019-01-13 02:43:55,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-13 02:43:55,178 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:43:55,179 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] [2019-01-13 02:43:55,182 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:43:55,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:43:55,189 INFO L82 PathProgramCache]: Analyzing trace with hash -454041356, now seen corresponding path program 1 times [2019-01-13 02:43:55,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:43:55,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:43:55,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:43:55,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:43:55,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:43:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:43:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:43:55,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:43:55,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:43:55,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:43:55,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:43:55,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:43:55,548 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2019-01-13 02:43:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:43:57,366 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2019-01-13 02:43:57,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:43:57,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-01-13 02:43:57,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:43:57,716 INFO L225 Difference]: With dead ends: 60790 [2019-01-13 02:43:57,716 INFO L226 Difference]: Without dead ends: 44270 [2019-01-13 02:43:57,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:43:58,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2019-01-13 02:43:59,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2019-01-13 02:43:59,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2019-01-13 02:43:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2019-01-13 02:43:59,757 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2019-01-13 02:43:59,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:43:59,757 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2019-01-13 02:43:59,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:43:59,758 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2019-01-13 02:43:59,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 02:43:59,774 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:43:59,774 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] [2019-01-13 02:43:59,775 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:43:59,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:43:59,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1863363909, now seen corresponding path program 1 times [2019-01-13 02:43:59,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:43:59,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:43:59,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:43:59,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:43:59,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:43:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:43:59,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:43:59,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:43:59,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:43:59,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:43:59,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:43:59,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:43:59,960 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2019-01-13 02:44:00,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:00,327 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2019-01-13 02:44:00,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 02:44:00,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-01-13 02:44:00,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:00,366 INFO L225 Difference]: With dead ends: 8528 [2019-01-13 02:44:00,366 INFO L226 Difference]: Without dead ends: 7466 [2019-01-13 02:44:00,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:44:00,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2019-01-13 02:44:00,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2019-01-13 02:44:00,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2019-01-13 02:44:00,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2019-01-13 02:44:00,609 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2019-01-13 02:44:00,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:00,610 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2019-01-13 02:44:00,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:44:00,610 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2019-01-13 02:44:00,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-13 02:44:00,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:00,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:44:00,614 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:00,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:00,614 INFO L82 PathProgramCache]: Analyzing trace with hash 591681941, now seen corresponding path program 1 times [2019-01-13 02:44:00,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:00,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:00,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:00,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:00,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:00,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:00,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:44:00,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:44:00,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:44:00,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:44:00,954 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2019-01-13 02:44:02,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:02,912 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2019-01-13 02:44:02,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:44:02,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-01-13 02:44:02,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:02,972 INFO L225 Difference]: With dead ends: 13998 [2019-01-13 02:44:02,972 INFO L226 Difference]: Without dead ends: 13930 [2019-01-13 02:44:02,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:44:03,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2019-01-13 02:44:03,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2019-01-13 02:44:03,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2019-01-13 02:44:03,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2019-01-13 02:44:03,657 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2019-01-13 02:44:03,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:03,659 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2019-01-13 02:44:03,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:44:03,659 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2019-01-13 02:44:03,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-13 02:44:03,661 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:03,662 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] [2019-01-13 02:44:03,662 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:03,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:03,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1652121253, now seen corresponding path program 1 times [2019-01-13 02:44:03,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:03,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:03,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:03,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:03,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:03,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:03,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:03,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 02:44:03,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 02:44:03,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 02:44:03,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:44:03,737 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2019-01-13 02:44:03,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:03,904 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2019-01-13 02:44:03,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 02:44:03,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-01-13 02:44:03,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:03,974 INFO L225 Difference]: With dead ends: 13279 [2019-01-13 02:44:03,974 INFO L226 Difference]: Without dead ends: 13279 [2019-01-13 02:44:03,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:44:04,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2019-01-13 02:44:04,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2019-01-13 02:44:04,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2019-01-13 02:44:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2019-01-13 02:44:04,258 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2019-01-13 02:44:04,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:04,258 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2019-01-13 02:44:04,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 02:44:04,260 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2019-01-13 02:44:04,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-13 02:44:04,263 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:04,263 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] [2019-01-13 02:44:04,263 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:04,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:04,265 INFO L82 PathProgramCache]: Analyzing trace with hash -164023066, now seen corresponding path program 1 times [2019-01-13 02:44:04,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:04,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:04,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:04,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:04,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:04,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:04,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:04,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 02:44:04,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 02:44:04,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 02:44:04,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:44:04,527 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2019-01-13 02:44:05,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:05,526 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2019-01-13 02:44:05,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 02:44:05,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-01-13 02:44:05,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:05,562 INFO L225 Difference]: With dead ends: 12285 [2019-01-13 02:44:05,563 INFO L226 Difference]: Without dead ends: 12213 [2019-01-13 02:44:05,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-01-13 02:44:05,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2019-01-13 02:44:05,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2019-01-13 02:44:05,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2019-01-13 02:44:05,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2019-01-13 02:44:05,822 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2019-01-13 02:44:05,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:05,823 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2019-01-13 02:44:05,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 02:44:05,823 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2019-01-13 02:44:05,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-13 02:44:05,829 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:05,830 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] [2019-01-13 02:44:05,830 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:05,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:05,830 INFO L82 PathProgramCache]: Analyzing trace with hash 317195842, now seen corresponding path program 1 times [2019-01-13 02:44:05,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:05,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:05,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:05,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:05,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:06,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:06,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:06,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:44:06,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:44:06,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:44:06,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:44:06,061 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2019-01-13 02:44:06,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:06,329 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2019-01-13 02:44:06,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 02:44:06,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-01-13 02:44:06,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:06,362 INFO L225 Difference]: With dead ends: 12396 [2019-01-13 02:44:06,362 INFO L226 Difference]: Without dead ends: 12396 [2019-01-13 02:44:06,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:44:06,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2019-01-13 02:44:06,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2019-01-13 02:44:06,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2019-01-13 02:44:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2019-01-13 02:44:06,671 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2019-01-13 02:44:06,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:06,671 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2019-01-13 02:44:06,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:44:06,672 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2019-01-13 02:44:06,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-13 02:44:06,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:06,680 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] [2019-01-13 02:44:06,681 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:06,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:06,681 INFO L82 PathProgramCache]: Analyzing trace with hash 2060006177, now seen corresponding path program 1 times [2019-01-13 02:44:06,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:06,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:06,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:06,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:06,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:07,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:07,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:07,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:44:07,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:44:07,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:44:07,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:44:07,092 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2019-01-13 02:44:07,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:07,846 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2019-01-13 02:44:07,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 02:44:07,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-01-13 02:44:07,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:07,888 INFO L225 Difference]: With dead ends: 20969 [2019-01-13 02:44:07,888 INFO L226 Difference]: Without dead ends: 20898 [2019-01-13 02:44:07,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-13 02:44:07,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2019-01-13 02:44:08,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2019-01-13 02:44:08,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2019-01-13 02:44:08,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2019-01-13 02:44:08,773 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2019-01-13 02:44:08,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:08,773 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2019-01-13 02:44:08,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:44:08,774 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2019-01-13 02:44:08,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-13 02:44:08,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:08,787 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] [2019-01-13 02:44:08,787 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:08,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:08,788 INFO L82 PathProgramCache]: Analyzing trace with hash 553940321, now seen corresponding path program 1 times [2019-01-13 02:44:08,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:08,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:08,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:08,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:08,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:09,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:09,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:44:09,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:44:09,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:44:09,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:44:09,129 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2019-01-13 02:44:09,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:09,858 INFO L93 Difference]: Finished difference Result 17635 states and 54585 transitions. [2019-01-13 02:44:09,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:44:09,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-01-13 02:44:09,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:09,889 INFO L225 Difference]: With dead ends: 17635 [2019-01-13 02:44:09,889 INFO L226 Difference]: Without dead ends: 17635 [2019-01-13 02:44:09,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:44:09,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17635 states. [2019-01-13 02:44:10,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17635 to 15793. [2019-01-13 02:44:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15793 states. [2019-01-13 02:44:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15793 states to 15793 states and 49131 transitions. [2019-01-13 02:44:10,256 INFO L78 Accepts]: Start accepts. Automaton has 15793 states and 49131 transitions. Word has length 64 [2019-01-13 02:44:10,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:10,257 INFO L480 AbstractCegarLoop]: Abstraction has 15793 states and 49131 transitions. [2019-01-13 02:44:10,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:44:10,257 INFO L276 IsEmpty]: Start isEmpty. Operand 15793 states and 49131 transitions. [2019-01-13 02:44:10,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-13 02:44:10,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:10,277 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] [2019-01-13 02:44:10,278 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:10,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:10,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1523269022, now seen corresponding path program 1 times [2019-01-13 02:44:10,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:10,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:10,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:10,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:10,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:10,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:10,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 02:44:10,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 02:44:10,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 02:44:10,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:44:10,419 INFO L87 Difference]: Start difference. First operand 15793 states and 49131 transitions. Second operand 3 states. [2019-01-13 02:44:11,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:11,064 INFO L93 Difference]: Finished difference Result 16385 states and 50738 transitions. [2019-01-13 02:44:11,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 02:44:11,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-01-13 02:44:11,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:11,093 INFO L225 Difference]: With dead ends: 16385 [2019-01-13 02:44:11,093 INFO L226 Difference]: Without dead ends: 16385 [2019-01-13 02:44:11,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:44:11,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16385 states. [2019-01-13 02:44:11,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16385 to 16109. [2019-01-13 02:44:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16109 states. [2019-01-13 02:44:11,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16109 states to 16109 states and 49981 transitions. [2019-01-13 02:44:11,365 INFO L78 Accepts]: Start accepts. Automaton has 16109 states and 49981 transitions. Word has length 64 [2019-01-13 02:44:11,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:11,365 INFO L480 AbstractCegarLoop]: Abstraction has 16109 states and 49981 transitions. [2019-01-13 02:44:11,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 02:44:11,366 INFO L276 IsEmpty]: Start isEmpty. Operand 16109 states and 49981 transitions. [2019-01-13 02:44:11,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 02:44:11,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:11,380 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] [2019-01-13 02:44:11,380 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:11,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:11,380 INFO L82 PathProgramCache]: Analyzing trace with hash 493974152, now seen corresponding path program 1 times [2019-01-13 02:44:11,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:11,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:11,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:11,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:11,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:11,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:11,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:11,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:44:11,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:44:11,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:44:11,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:44:11,573 INFO L87 Difference]: Start difference. First operand 16109 states and 49981 transitions. Second operand 6 states. [2019-01-13 02:44:13,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:13,577 INFO L93 Difference]: Finished difference Result 19821 states and 60437 transitions. [2019-01-13 02:44:13,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:44:13,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-01-13 02:44:13,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:13,611 INFO L225 Difference]: With dead ends: 19821 [2019-01-13 02:44:13,611 INFO L226 Difference]: Without dead ends: 19821 [2019-01-13 02:44:13,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:44:13,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19821 states. [2019-01-13 02:44:13,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19821 to 18617. [2019-01-13 02:44:13,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18617 states. [2019-01-13 02:44:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 57217 transitions. [2019-01-13 02:44:13,922 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 57217 transitions. Word has length 66 [2019-01-13 02:44:13,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:13,923 INFO L480 AbstractCegarLoop]: Abstraction has 18617 states and 57217 transitions. [2019-01-13 02:44:13,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:44:13,923 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 57217 transitions. [2019-01-13 02:44:13,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 02:44:13,936 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:13,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:44:13,937 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:13,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:13,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1583235191, now seen corresponding path program 1 times [2019-01-13 02:44:13,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:13,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:13,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:13,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:13,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:14,365 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-13 02:44:14,757 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 9 [2019-01-13 02:44:14,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:14,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:14,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:44:14,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:44:14,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:44:14,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:44:14,770 INFO L87 Difference]: Start difference. First operand 18617 states and 57217 transitions. Second operand 6 states. [2019-01-13 02:44:15,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:15,722 INFO L93 Difference]: Finished difference Result 21449 states and 63626 transitions. [2019-01-13 02:44:15,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 02:44:15,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-01-13 02:44:15,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:15,757 INFO L225 Difference]: With dead ends: 21449 [2019-01-13 02:44:15,757 INFO L226 Difference]: Without dead ends: 21449 [2019-01-13 02:44:15,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 02:44:15,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21449 states. [2019-01-13 02:44:15,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21449 to 19133. [2019-01-13 02:44:15,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19133 states. [2019-01-13 02:44:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19133 states to 19133 states and 57764 transitions. [2019-01-13 02:44:16,041 INFO L78 Accepts]: Start accepts. Automaton has 19133 states and 57764 transitions. Word has length 66 [2019-01-13 02:44:16,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:16,042 INFO L480 AbstractCegarLoop]: Abstraction has 19133 states and 57764 transitions. [2019-01-13 02:44:16,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:44:16,042 INFO L276 IsEmpty]: Start isEmpty. Operand 19133 states and 57764 transitions. [2019-01-13 02:44:16,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 02:44:16,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:16,054 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] [2019-01-13 02:44:16,054 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:16,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:16,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1371884278, now seen corresponding path program 1 times [2019-01-13 02:44:16,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:16,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:16,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:16,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:16,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:16,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:16,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:44:16,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:44:16,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:44:16,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:44:16,481 INFO L87 Difference]: Start difference. First operand 19133 states and 57764 transitions. Second operand 5 states. [2019-01-13 02:44:17,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:17,113 INFO L93 Difference]: Finished difference Result 25024 states and 75018 transitions. [2019-01-13 02:44:17,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:44:17,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-01-13 02:44:17,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:17,155 INFO L225 Difference]: With dead ends: 25024 [2019-01-13 02:44:17,156 INFO L226 Difference]: Without dead ends: 25024 [2019-01-13 02:44:17,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:44:17,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25024 states. [2019-01-13 02:44:17,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25024 to 22709. [2019-01-13 02:44:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22709 states. [2019-01-13 02:44:17,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22709 states to 22709 states and 68032 transitions. [2019-01-13 02:44:17,505 INFO L78 Accepts]: Start accepts. Automaton has 22709 states and 68032 transitions. Word has length 66 [2019-01-13 02:44:17,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:17,505 INFO L480 AbstractCegarLoop]: Abstraction has 22709 states and 68032 transitions. [2019-01-13 02:44:17,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:44:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 22709 states and 68032 transitions. [2019-01-13 02:44:17,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 02:44:17,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:17,519 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] [2019-01-13 02:44:17,519 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:17,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:17,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1882418455, now seen corresponding path program 1 times [2019-01-13 02:44:17,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:17,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:17,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:17,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:17,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:17,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:17,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:17,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:44:17,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:44:17,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:44:17,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:44:17,758 INFO L87 Difference]: Start difference. First operand 22709 states and 68032 transitions. Second operand 5 states. [2019-01-13 02:44:17,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:17,824 INFO L93 Difference]: Finished difference Result 7837 states and 18946 transitions. [2019-01-13 02:44:17,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 02:44:17,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-01-13 02:44:17,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:17,833 INFO L225 Difference]: With dead ends: 7837 [2019-01-13 02:44:17,834 INFO L226 Difference]: Without dead ends: 6355 [2019-01-13 02:44:17,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:44:17,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6355 states. [2019-01-13 02:44:17,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6355 to 5703. [2019-01-13 02:44:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5703 states. [2019-01-13 02:44:17,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5703 states to 5703 states and 13364 transitions. [2019-01-13 02:44:17,899 INFO L78 Accepts]: Start accepts. Automaton has 5703 states and 13364 transitions. Word has length 66 [2019-01-13 02:44:17,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:17,900 INFO L480 AbstractCegarLoop]: Abstraction has 5703 states and 13364 transitions. [2019-01-13 02:44:17,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:44:17,900 INFO L276 IsEmpty]: Start isEmpty. Operand 5703 states and 13364 transitions. [2019-01-13 02:44:17,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 02:44:17,906 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:17,906 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:44:17,907 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:17,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:17,907 INFO L82 PathProgramCache]: Analyzing trace with hash 890203314, now seen corresponding path program 1 times [2019-01-13 02:44:17,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:17,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:17,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:17,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:17,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:17,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:17,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:17,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 02:44:17,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 02:44:17,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 02:44:17,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:44:17,996 INFO L87 Difference]: Start difference. First operand 5703 states and 13364 transitions. Second operand 3 states. [2019-01-13 02:44:18,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:18,209 INFO L93 Difference]: Finished difference Result 7505 states and 17450 transitions. [2019-01-13 02:44:18,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 02:44:18,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-01-13 02:44:18,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:18,219 INFO L225 Difference]: With dead ends: 7505 [2019-01-13 02:44:18,220 INFO L226 Difference]: Without dead ends: 7505 [2019-01-13 02:44:18,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:44:18,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7505 states. [2019-01-13 02:44:18,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7505 to 5642. [2019-01-13 02:44:18,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2019-01-13 02:44:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 12904 transitions. [2019-01-13 02:44:18,296 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 12904 transitions. Word has length 66 [2019-01-13 02:44:18,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:18,297 INFO L480 AbstractCegarLoop]: Abstraction has 5642 states and 12904 transitions. [2019-01-13 02:44:18,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 02:44:18,297 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 12904 transitions. [2019-01-13 02:44:18,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-13 02:44:18,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:18,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:44:18,305 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:18,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:18,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1181781029, now seen corresponding path program 1 times [2019-01-13 02:44:18,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:18,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:18,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:18,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:18,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:18,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:18,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:44:18,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:44:18,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:44:18,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:44:18,445 INFO L87 Difference]: Start difference. First operand 5642 states and 12904 transitions. Second operand 5 states. [2019-01-13 02:44:18,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:18,662 INFO L93 Difference]: Finished difference Result 6806 states and 15528 transitions. [2019-01-13 02:44:18,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 02:44:18,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-01-13 02:44:18,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:18,672 INFO L225 Difference]: With dead ends: 6806 [2019-01-13 02:44:18,672 INFO L226 Difference]: Without dead ends: 6806 [2019-01-13 02:44:18,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 02:44:18,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6806 states. [2019-01-13 02:44:18,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6806 to 6086. [2019-01-13 02:44:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6086 states. [2019-01-13 02:44:18,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6086 states to 6086 states and 13908 transitions. [2019-01-13 02:44:18,775 INFO L78 Accepts]: Start accepts. Automaton has 6086 states and 13908 transitions. Word has length 72 [2019-01-13 02:44:18,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:18,776 INFO L480 AbstractCegarLoop]: Abstraction has 6086 states and 13908 transitions. [2019-01-13 02:44:18,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:44:18,776 INFO L276 IsEmpty]: Start isEmpty. Operand 6086 states and 13908 transitions. [2019-01-13 02:44:18,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-13 02:44:18,785 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:18,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:44:18,785 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:18,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:18,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1370375932, now seen corresponding path program 1 times [2019-01-13 02:44:18,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:18,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:18,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:18,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:18,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:19,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:19,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:19,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 02:44:19,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 02:44:19,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 02:44:19,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-13 02:44:19,048 INFO L87 Difference]: Start difference. First operand 6086 states and 13908 transitions. Second operand 9 states. [2019-01-13 02:44:19,832 WARN L181 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-01-13 02:44:20,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:20,312 INFO L93 Difference]: Finished difference Result 8112 states and 18389 transitions. [2019-01-13 02:44:20,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 02:44:20,313 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-01-13 02:44:20,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:20,323 INFO L225 Difference]: With dead ends: 8112 [2019-01-13 02:44:20,323 INFO L226 Difference]: Without dead ends: 7993 [2019-01-13 02:44:20,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-01-13 02:44:20,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7993 states. [2019-01-13 02:44:20,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7993 to 6183. [2019-01-13 02:44:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6183 states. [2019-01-13 02:44:20,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6183 states to 6183 states and 14001 transitions. [2019-01-13 02:44:20,407 INFO L78 Accepts]: Start accepts. Automaton has 6183 states and 14001 transitions. Word has length 72 [2019-01-13 02:44:20,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:20,408 INFO L480 AbstractCegarLoop]: Abstraction has 6183 states and 14001 transitions. [2019-01-13 02:44:20,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 02:44:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 6183 states and 14001 transitions. [2019-01-13 02:44:20,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 02:44:20,422 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:20,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:44:20,422 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:20,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:20,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1666827177, now seen corresponding path program 1 times [2019-01-13 02:44:20,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:20,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:20,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:20,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:20,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:20,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:20,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:44:20,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:44:20,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:44:20,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:44:20,539 INFO L87 Difference]: Start difference. First operand 6183 states and 14001 transitions. Second operand 4 states. [2019-01-13 02:44:20,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:20,888 INFO L93 Difference]: Finished difference Result 9854 states and 22232 transitions. [2019-01-13 02:44:20,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:44:20,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-13 02:44:20,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:20,901 INFO L225 Difference]: With dead ends: 9854 [2019-01-13 02:44:20,901 INFO L226 Difference]: Without dead ends: 9854 [2019-01-13 02:44:20,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:44:20,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9854 states. [2019-01-13 02:44:20,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9854 to 7303. [2019-01-13 02:44:20,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7303 states. [2019-01-13 02:44:20,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 16335 transitions. [2019-01-13 02:44:20,994 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 16335 transitions. Word has length 91 [2019-01-13 02:44:20,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:20,994 INFO L480 AbstractCegarLoop]: Abstraction has 7303 states and 16335 transitions. [2019-01-13 02:44:20,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:44:20,995 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 16335 transitions. [2019-01-13 02:44:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 02:44:21,004 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:21,004 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:44:21,004 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:21,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:21,005 INFO L82 PathProgramCache]: Analyzing trace with hash 496143053, now seen corresponding path program 1 times [2019-01-13 02:44:21,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:21,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:21,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:21,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:21,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:21,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:21,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:21,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:44:21,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:44:21,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:44:21,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:44:21,109 INFO L87 Difference]: Start difference. First operand 7303 states and 16335 transitions. Second operand 4 states. [2019-01-13 02:44:21,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:21,229 INFO L93 Difference]: Finished difference Result 7805 states and 17493 transitions. [2019-01-13 02:44:21,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:44:21,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-13 02:44:21,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:21,238 INFO L225 Difference]: With dead ends: 7805 [2019-01-13 02:44:21,239 INFO L226 Difference]: Without dead ends: 7805 [2019-01-13 02:44:21,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:44:21,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7805 states. [2019-01-13 02:44:21,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7805 to 7209. [2019-01-13 02:44:21,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7209 states. [2019-01-13 02:44:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7209 states to 7209 states and 16230 transitions. [2019-01-13 02:44:21,317 INFO L78 Accepts]: Start accepts. Automaton has 7209 states and 16230 transitions. Word has length 91 [2019-01-13 02:44:21,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:21,318 INFO L480 AbstractCegarLoop]: Abstraction has 7209 states and 16230 transitions. [2019-01-13 02:44:21,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:44:21,318 INFO L276 IsEmpty]: Start isEmpty. Operand 7209 states and 16230 transitions. [2019-01-13 02:44:21,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 02:44:21,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:21,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:44:21,327 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:21,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:21,327 INFO L82 PathProgramCache]: Analyzing trace with hash -471503779, now seen corresponding path program 1 times [2019-01-13 02:44:21,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:21,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:21,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:21,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:21,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:21,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:21,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:21,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 02:44:21,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 02:44:21,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 02:44:21,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:44:21,480 INFO L87 Difference]: Start difference. First operand 7209 states and 16230 transitions. Second operand 7 states. [2019-01-13 02:44:22,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:22,385 INFO L93 Difference]: Finished difference Result 8986 states and 20184 transitions. [2019-01-13 02:44:22,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:44:22,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-13 02:44:22,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:22,398 INFO L225 Difference]: With dead ends: 8986 [2019-01-13 02:44:22,398 INFO L226 Difference]: Without dead ends: 8986 [2019-01-13 02:44:22,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:44:22,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8986 states. [2019-01-13 02:44:22,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8986 to 7321. [2019-01-13 02:44:22,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7321 states. [2019-01-13 02:44:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 16550 transitions. [2019-01-13 02:44:22,483 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 16550 transitions. Word has length 93 [2019-01-13 02:44:22,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:22,483 INFO L480 AbstractCegarLoop]: Abstraction has 7321 states and 16550 transitions. [2019-01-13 02:44:22,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 02:44:22,483 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 16550 transitions. [2019-01-13 02:44:22,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 02:44:22,491 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:22,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:44:22,492 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:22,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:22,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2034999584, now seen corresponding path program 1 times [2019-01-13 02:44:22,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:22,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:22,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:22,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:22,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:22,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:22,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:44:22,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:44:22,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:44:22,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:44:22,667 INFO L87 Difference]: Start difference. First operand 7321 states and 16550 transitions. Second operand 5 states. [2019-01-13 02:44:22,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:22,831 INFO L93 Difference]: Finished difference Result 8130 states and 18286 transitions. [2019-01-13 02:44:22,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:44:22,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-01-13 02:44:22,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:22,841 INFO L225 Difference]: With dead ends: 8130 [2019-01-13 02:44:22,841 INFO L226 Difference]: Without dead ends: 8130 [2019-01-13 02:44:22,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:44:22,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8130 states. [2019-01-13 02:44:22,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8130 to 6217. [2019-01-13 02:44:22,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2019-01-13 02:44:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 14069 transitions. [2019-01-13 02:44:22,914 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 14069 transitions. Word has length 93 [2019-01-13 02:44:22,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:22,915 INFO L480 AbstractCegarLoop]: Abstraction has 6217 states and 14069 transitions. [2019-01-13 02:44:22,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:44:22,915 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 14069 transitions. [2019-01-13 02:44:22,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 02:44:22,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:22,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:44:22,922 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:22,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:22,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2005231167, now seen corresponding path program 1 times [2019-01-13 02:44:22,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:22,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:22,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:22,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:22,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:23,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:23,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:44:23,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:44:23,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:44:23,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:44:23,061 INFO L87 Difference]: Start difference. First operand 6217 states and 14069 transitions. Second operand 5 states. [2019-01-13 02:44:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:23,608 INFO L93 Difference]: Finished difference Result 9852 states and 22424 transitions. [2019-01-13 02:44:23,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 02:44:23,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-01-13 02:44:23,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:23,621 INFO L225 Difference]: With dead ends: 9852 [2019-01-13 02:44:23,622 INFO L226 Difference]: Without dead ends: 9774 [2019-01-13 02:44:23,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 02:44:23,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9774 states. [2019-01-13 02:44:23,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9774 to 7358. [2019-01-13 02:44:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7358 states. [2019-01-13 02:44:23,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7358 states to 7358 states and 16716 transitions. [2019-01-13 02:44:23,717 INFO L78 Accepts]: Start accepts. Automaton has 7358 states and 16716 transitions. Word has length 93 [2019-01-13 02:44:23,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:23,717 INFO L480 AbstractCegarLoop]: Abstraction has 7358 states and 16716 transitions. [2019-01-13 02:44:23,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:44:23,717 INFO L276 IsEmpty]: Start isEmpty. Operand 7358 states and 16716 transitions. [2019-01-13 02:44:23,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 02:44:23,728 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:23,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:44:23,728 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:23,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:23,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1044971648, now seen corresponding path program 1 times [2019-01-13 02:44:23,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:23,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:23,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:23,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:23,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:24,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:24,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:24,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:44:24,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:44:24,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:44:24,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:44:24,019 INFO L87 Difference]: Start difference. First operand 7358 states and 16716 transitions. Second operand 6 states. [2019-01-13 02:44:25,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:25,012 INFO L93 Difference]: Finished difference Result 9349 states and 21078 transitions. [2019-01-13 02:44:25,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 02:44:25,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-13 02:44:25,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:25,025 INFO L225 Difference]: With dead ends: 9349 [2019-01-13 02:44:25,025 INFO L226 Difference]: Without dead ends: 9270 [2019-01-13 02:44:25,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-13 02:44:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9270 states. [2019-01-13 02:44:25,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9270 to 6928. [2019-01-13 02:44:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6928 states. [2019-01-13 02:44:25,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6928 states to 6928 states and 15763 transitions. [2019-01-13 02:44:25,110 INFO L78 Accepts]: Start accepts. Automaton has 6928 states and 15763 transitions. Word has length 93 [2019-01-13 02:44:25,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:25,111 INFO L480 AbstractCegarLoop]: Abstraction has 6928 states and 15763 transitions. [2019-01-13 02:44:25,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:44:25,111 INFO L276 IsEmpty]: Start isEmpty. Operand 6928 states and 15763 transitions. [2019-01-13 02:44:25,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 02:44:25,120 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:25,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:44:25,121 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:25,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:25,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1661415981, now seen corresponding path program 1 times [2019-01-13 02:44:25,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:25,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:25,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:25,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:25,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:25,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:25,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 02:44:25,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 02:44:25,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 02:44:25,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-13 02:44:25,617 INFO L87 Difference]: Start difference. First operand 6928 states and 15763 transitions. Second operand 9 states. [2019-01-13 02:44:26,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:26,377 INFO L93 Difference]: Finished difference Result 9639 states and 21910 transitions. [2019-01-13 02:44:26,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-13 02:44:26,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-01-13 02:44:26,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:26,391 INFO L225 Difference]: With dead ends: 9639 [2019-01-13 02:44:26,391 INFO L226 Difference]: Without dead ends: 9639 [2019-01-13 02:44:26,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-01-13 02:44:26,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9639 states. [2019-01-13 02:44:26,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9639 to 8631. [2019-01-13 02:44:26,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8631 states. [2019-01-13 02:44:26,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8631 states to 8631 states and 19631 transitions. [2019-01-13 02:44:26,488 INFO L78 Accepts]: Start accepts. Automaton has 8631 states and 19631 transitions. Word has length 93 [2019-01-13 02:44:26,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:26,489 INFO L480 AbstractCegarLoop]: Abstraction has 8631 states and 19631 transitions. [2019-01-13 02:44:26,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 02:44:26,489 INFO L276 IsEmpty]: Start isEmpty. Operand 8631 states and 19631 transitions. [2019-01-13 02:44:26,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 02:44:26,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:26,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:44:26,500 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:26,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:26,500 INFO L82 PathProgramCache]: Analyzing trace with hash 146038482, now seen corresponding path program 1 times [2019-01-13 02:44:26,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:26,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:26,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:26,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:26,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:26,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:26,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:26,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:44:26,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:44:26,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:44:26,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:44:26,608 INFO L87 Difference]: Start difference. First operand 8631 states and 19631 transitions. Second operand 4 states. [2019-01-13 02:44:26,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:26,755 INFO L93 Difference]: Finished difference Result 8903 states and 20327 transitions. [2019-01-13 02:44:26,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:44:26,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-01-13 02:44:26,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:26,768 INFO L225 Difference]: With dead ends: 8903 [2019-01-13 02:44:26,768 INFO L226 Difference]: Without dead ends: 8871 [2019-01-13 02:44:26,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:44:26,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8871 states. [2019-01-13 02:44:26,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8871 to 8727. [2019-01-13 02:44:26,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8727 states. [2019-01-13 02:44:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8727 states to 8727 states and 19887 transitions. [2019-01-13 02:44:26,980 INFO L78 Accepts]: Start accepts. Automaton has 8727 states and 19887 transitions. Word has length 93 [2019-01-13 02:44:26,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:26,981 INFO L480 AbstractCegarLoop]: Abstraction has 8727 states and 19887 transitions. [2019-01-13 02:44:26,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:44:26,981 INFO L276 IsEmpty]: Start isEmpty. Operand 8727 states and 19887 transitions. [2019-01-13 02:44:26,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 02:44:26,990 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:26,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:44:26,991 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:26,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:26,991 INFO L82 PathProgramCache]: Analyzing trace with hash 836599956, now seen corresponding path program 1 times [2019-01-13 02:44:26,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:26,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:26,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:26,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:26,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:27,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:27,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:27,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 02:44:27,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 02:44:27,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 02:44:27,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:44:27,818 INFO L87 Difference]: Start difference. First operand 8727 states and 19887 transitions. Second operand 8 states. [2019-01-13 02:44:28,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:28,766 INFO L93 Difference]: Finished difference Result 13198 states and 30502 transitions. [2019-01-13 02:44:28,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 02:44:28,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2019-01-13 02:44:28,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:28,784 INFO L225 Difference]: With dead ends: 13198 [2019-01-13 02:44:28,784 INFO L226 Difference]: Without dead ends: 13198 [2019-01-13 02:44:28,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-01-13 02:44:28,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13198 states. [2019-01-13 02:44:28,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13198 to 9365. [2019-01-13 02:44:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9365 states. [2019-01-13 02:44:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9365 states to 9365 states and 21554 transitions. [2019-01-13 02:44:28,907 INFO L78 Accepts]: Start accepts. Automaton has 9365 states and 21554 transitions. Word has length 93 [2019-01-13 02:44:28,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:28,908 INFO L480 AbstractCegarLoop]: Abstraction has 9365 states and 21554 transitions. [2019-01-13 02:44:28,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 02:44:28,908 INFO L276 IsEmpty]: Start isEmpty. Operand 9365 states and 21554 transitions. [2019-01-13 02:44:28,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 02:44:28,918 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:28,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:44:28,918 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:28,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:28,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1724103637, now seen corresponding path program 1 times [2019-01-13 02:44:28,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:28,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:28,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:28,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:28,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:29,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:29,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:29,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 02:44:29,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 02:44:29,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 02:44:29,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-13 02:44:29,182 INFO L87 Difference]: Start difference. First operand 9365 states and 21554 transitions. Second operand 10 states. [2019-01-13 02:44:30,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:30,110 INFO L93 Difference]: Finished difference Result 12545 states and 28910 transitions. [2019-01-13 02:44:30,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 02:44:30,111 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2019-01-13 02:44:30,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:30,127 INFO L225 Difference]: With dead ends: 12545 [2019-01-13 02:44:30,127 INFO L226 Difference]: Without dead ends: 12545 [2019-01-13 02:44:30,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2019-01-13 02:44:30,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12545 states. [2019-01-13 02:44:30,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12545 to 10501. [2019-01-13 02:44:30,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10501 states. [2019-01-13 02:44:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10501 states to 10501 states and 24012 transitions. [2019-01-13 02:44:30,251 INFO L78 Accepts]: Start accepts. Automaton has 10501 states and 24012 transitions. Word has length 93 [2019-01-13 02:44:30,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:30,251 INFO L480 AbstractCegarLoop]: Abstraction has 10501 states and 24012 transitions. [2019-01-13 02:44:30,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 02:44:30,251 INFO L276 IsEmpty]: Start isEmpty. Operand 10501 states and 24012 transitions. [2019-01-13 02:44:30,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 02:44:30,263 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:30,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:44:30,265 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:30,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:30,265 INFO L82 PathProgramCache]: Analyzing trace with hash -7871915, now seen corresponding path program 1 times [2019-01-13 02:44:30,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:30,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:30,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:30,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:30,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:30,678 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-13 02:44:30,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:30,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:30,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:44:30,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:44:30,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:44:30,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:44:30,792 INFO L87 Difference]: Start difference. First operand 10501 states and 24012 transitions. Second operand 6 states. [2019-01-13 02:44:30,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:30,972 INFO L93 Difference]: Finished difference Result 10133 states and 22836 transitions. [2019-01-13 02:44:30,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:44:30,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-13 02:44:30,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:30,987 INFO L225 Difference]: With dead ends: 10133 [2019-01-13 02:44:30,988 INFO L226 Difference]: Without dead ends: 10133 [2019-01-13 02:44:30,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:44:31,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10133 states. [2019-01-13 02:44:31,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10133 to 7136. [2019-01-13 02:44:31,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7136 states. [2019-01-13 02:44:31,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7136 states to 7136 states and 16093 transitions. [2019-01-13 02:44:31,091 INFO L78 Accepts]: Start accepts. Automaton has 7136 states and 16093 transitions. Word has length 93 [2019-01-13 02:44:31,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:31,091 INFO L480 AbstractCegarLoop]: Abstraction has 7136 states and 16093 transitions. [2019-01-13 02:44:31,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:44:31,092 INFO L276 IsEmpty]: Start isEmpty. Operand 7136 states and 16093 transitions. [2019-01-13 02:44:31,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 02:44:31,100 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:31,100 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:44:31,100 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:31,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:31,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1803035193, now seen corresponding path program 1 times [2019-01-13 02:44:31,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:31,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:31,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:31,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:31,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:31,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:31,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:31,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:44:31,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:44:31,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:44:31,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:44:31,343 INFO L87 Difference]: Start difference. First operand 7136 states and 16093 transitions. Second operand 5 states. [2019-01-13 02:44:31,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:31,398 INFO L93 Difference]: Finished difference Result 7136 states and 16077 transitions. [2019-01-13 02:44:31,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 02:44:31,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-01-13 02:44:31,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:31,410 INFO L225 Difference]: With dead ends: 7136 [2019-01-13 02:44:31,411 INFO L226 Difference]: Without dead ends: 7136 [2019-01-13 02:44:31,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:44:31,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7136 states. [2019-01-13 02:44:31,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7136 to 7136. [2019-01-13 02:44:31,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7136 states. [2019-01-13 02:44:31,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7136 states to 7136 states and 16077 transitions. [2019-01-13 02:44:31,491 INFO L78 Accepts]: Start accepts. Automaton has 7136 states and 16077 transitions. Word has length 95 [2019-01-13 02:44:31,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:31,492 INFO L480 AbstractCegarLoop]: Abstraction has 7136 states and 16077 transitions. [2019-01-13 02:44:31,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:44:31,492 INFO L276 IsEmpty]: Start isEmpty. Operand 7136 states and 16077 transitions. [2019-01-13 02:44:31,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 02:44:31,501 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:31,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:44:31,501 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:31,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:31,502 INFO L82 PathProgramCache]: Analyzing trace with hash -915531512, now seen corresponding path program 1 times [2019-01-13 02:44:31,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:31,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:31,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:31,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:31,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:31,813 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 02:44:31,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:31,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:31,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 02:44:31,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 02:44:31,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 02:44:31,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-13 02:44:31,957 INFO L87 Difference]: Start difference. First operand 7136 states and 16077 transitions. Second operand 11 states. [2019-01-13 02:44:33,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:33,688 INFO L93 Difference]: Finished difference Result 13009 states and 29370 transitions. [2019-01-13 02:44:33,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 02:44:33,689 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-01-13 02:44:33,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:33,703 INFO L225 Difference]: With dead ends: 13009 [2019-01-13 02:44:33,703 INFO L226 Difference]: Without dead ends: 9288 [2019-01-13 02:44:33,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-01-13 02:44:33,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9288 states. [2019-01-13 02:44:33,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9288 to 6975. [2019-01-13 02:44:33,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6975 states. [2019-01-13 02:44:33,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6975 states to 6975 states and 15659 transitions. [2019-01-13 02:44:33,798 INFO L78 Accepts]: Start accepts. Automaton has 6975 states and 15659 transitions. Word has length 95 [2019-01-13 02:44:33,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:33,798 INFO L480 AbstractCegarLoop]: Abstraction has 6975 states and 15659 transitions. [2019-01-13 02:44:33,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 02:44:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 6975 states and 15659 transitions. [2019-01-13 02:44:33,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 02:44:33,807 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:33,807 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:44:33,807 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:33,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:33,808 INFO L82 PathProgramCache]: Analyzing trace with hash 2034339057, now seen corresponding path program 1 times [2019-01-13 02:44:33,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:33,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:33,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:33,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:33,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:34,249 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-13 02:44:34,749 WARN L181 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2019-01-13 02:44:34,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:34,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:34,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:44:34,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:44:34,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:44:34,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:44:34,779 INFO L87 Difference]: Start difference. First operand 6975 states and 15659 transitions. Second operand 6 states. [2019-01-13 02:44:35,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:35,091 INFO L93 Difference]: Finished difference Result 7816 states and 17333 transitions. [2019-01-13 02:44:35,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:44:35,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-01-13 02:44:35,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:35,102 INFO L225 Difference]: With dead ends: 7816 [2019-01-13 02:44:35,102 INFO L226 Difference]: Without dead ends: 7783 [2019-01-13 02:44:35,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:44:35,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7783 states. [2019-01-13 02:44:35,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7783 to 6922. [2019-01-13 02:44:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6922 states. [2019-01-13 02:44:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6922 states to 6922 states and 15422 transitions. [2019-01-13 02:44:35,180 INFO L78 Accepts]: Start accepts. Automaton has 6922 states and 15422 transitions. Word has length 95 [2019-01-13 02:44:35,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:35,180 INFO L480 AbstractCegarLoop]: Abstraction has 6922 states and 15422 transitions. [2019-01-13 02:44:35,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:44:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 6922 states and 15422 transitions. [2019-01-13 02:44:35,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 02:44:35,188 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:35,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:44:35,188 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:35,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:35,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1442491535, now seen corresponding path program 2 times [2019-01-13 02:44:35,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:35,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:35,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:35,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:44:35,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:44:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 02:44:35,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:44:35,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:44:35,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:44:35,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:44:35,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:44:35,506 INFO L87 Difference]: Start difference. First operand 6922 states and 15422 transitions. Second operand 6 states. [2019-01-13 02:44:35,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:44:35,735 INFO L93 Difference]: Finished difference Result 7419 states and 16444 transitions. [2019-01-13 02:44:35,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 02:44:35,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-01-13 02:44:35,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:44:35,745 INFO L225 Difference]: With dead ends: 7419 [2019-01-13 02:44:35,745 INFO L226 Difference]: Without dead ends: 7419 [2019-01-13 02:44:35,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:44:35,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7419 states. [2019-01-13 02:44:35,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7419 to 6900. [2019-01-13 02:44:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6900 states. [2019-01-13 02:44:35,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6900 states to 6900 states and 15351 transitions. [2019-01-13 02:44:35,820 INFO L78 Accepts]: Start accepts. Automaton has 6900 states and 15351 transitions. Word has length 95 [2019-01-13 02:44:35,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:44:35,820 INFO L480 AbstractCegarLoop]: Abstraction has 6900 states and 15351 transitions. [2019-01-13 02:44:35,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:44:35,821 INFO L276 IsEmpty]: Start isEmpty. Operand 6900 states and 15351 transitions. [2019-01-13 02:44:35,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 02:44:35,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:44:35,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 02:44:35,828 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:44:35,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:44:35,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1930862478, now seen corresponding path program 2 times [2019-01-13 02:44:35,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:44:35,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:44:35,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:35,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 02:44:35,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:44:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 02:44:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 02:44:35,927 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 02:44:36,166 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 02:44:36,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 02:44:36 BasicIcfg [2019-01-13 02:44:36,170 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 02:44:36,171 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 02:44:36,171 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 02:44:36,171 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 02:44:36,172 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 02:43:52" (3/4) ... [2019-01-13 02:44:36,176 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 02:44:36,456 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 02:44:36,460 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 02:44:36,462 INFO L168 Benchmark]: Toolchain (without parser) took 46401.30 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 951.4 MB in the beginning and 966.7 MB in the end (delta: -15.3 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-01-13 02:44:36,463 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 02:44:36,464 INFO L168 Benchmark]: CACSL2BoogieTranslator took 898.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2019-01-13 02:44:36,464 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.20 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-13 02:44:36,464 INFO L168 Benchmark]: Boogie Preprocessor took 46.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 02:44:36,465 INFO L168 Benchmark]: RCFGBuilder took 1280.33 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: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2019-01-13 02:44:36,465 INFO L168 Benchmark]: TraceAbstraction took 43794.79 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.5 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-01-13 02:44:36,465 INFO L168 Benchmark]: Witness Printer took 289.74 ms. Allocated memory is still 2.9 GB. Free memory was 1.0 GB in the beginning and 966.7 MB in the end (delta: 36.5 MB). Peak memory consumption was 36.5 MB. Max. memory is 11.5 GB. [2019-01-13 02:44:36,471 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.17 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 898.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.20 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.46 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 1280.33 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: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 43794.79 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.5 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 289.74 ms. Allocated memory is still 2.9 GB. Free memory was 1.0 GB in the beginning and 966.7 MB in the end (delta: 36.5 MB). Peak memory consumption was 36.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] -1 pthread_t t1295; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] FCALL, FORK -1 pthread_create(&t1295, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L701] 0 y$w_buff1 = y$w_buff0 [L702] 0 y$w_buff0 = 1 [L703] 0 y$w_buff1_used = y$w_buff0_used [L704] 0 y$w_buff0_used = (_Bool)1 [L772] -1 pthread_t t1296; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] FCALL, FORK -1 pthread_create(&t1296, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L707] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L708] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L709] 0 y$r_buff0_thd1 = (_Bool)1 [L712] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] 1 y = y$flush_delayed ? y$mem_tmp : y [L745] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L780] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L781] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L783] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L786] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 43.6s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 22.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7804 SDtfs, 8701 SDslu, 18890 SDs, 0 SdLazy, 8468 SolverSat, 414 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 83 SyntacticMatches, 30 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34806occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 72589 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 2440 NumberOfCodeBlocks, 2440 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2314 ConstructedInterpolants, 0 QuantifiedInterpolants, 521229 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...