./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe034_power.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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/safe034_power.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 966ff3b529f37ce66c3b00d371bdd2a6f0599798 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-2e94e6a [2019-01-01 00:44:58,978 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 00:44:58,980 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 00:44:58,997 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 00:44:58,998 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 00:44:58,999 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 00:44:59,003 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 00:44:59,008 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 00:44:59,010 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 00:44:59,010 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 00:44:59,014 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 00:44:59,014 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 00:44:59,015 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 00:44:59,017 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 00:44:59,018 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 00:44:59,019 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 00:44:59,020 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 00:44:59,022 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 00:44:59,031 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 00:44:59,033 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 00:44:59,039 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 00:44:59,041 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 00:44:59,046 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 00:44:59,046 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 00:44:59,047 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 00:44:59,048 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 00:44:59,054 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 00:44:59,055 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 00:44:59,056 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 00:44:59,059 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 00:44:59,060 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 00:44:59,060 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 00:44:59,061 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 00:44:59,061 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 00:44:59,063 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 00:44:59,064 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 00:44:59,064 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-01 00:44:59,080 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 00:44:59,080 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 00:44:59,082 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 00:44:59,082 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 00:44:59,082 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 00:44:59,083 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 00:44:59,083 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 00:44:59,083 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 00:44:59,083 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 00:44:59,084 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 00:44:59,084 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 00:44:59,084 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 00:44:59,084 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 00:44:59,084 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 00:44:59,084 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 00:44:59,085 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 00:44:59,085 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 00:44:59,085 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 00:44:59,085 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 00:44:59,086 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 00:44:59,088 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 00:44:59,088 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:44:59,088 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 00:44:59,088 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 00:44:59,089 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 00:44:59,089 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 00:44:59,091 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 00:44:59,091 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 00:44:59,091 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 -> 966ff3b529f37ce66c3b00d371bdd2a6f0599798 [2019-01-01 00:44:59,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 00:44:59,169 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 00:44:59,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 00:44:59,174 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 00:44:59,175 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 00:44:59,175 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe034_power.oepc_false-unreach-call.i [2019-01-01 00:44:59,239 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a150e2a33/275e3a6cad7848f2934410ca13151422/FLAG0d47c6a6b [2019-01-01 00:44:59,794 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 00:44:59,795 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe034_power.oepc_false-unreach-call.i [2019-01-01 00:44:59,813 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a150e2a33/275e3a6cad7848f2934410ca13151422/FLAG0d47c6a6b [2019-01-01 00:45:00,068 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a150e2a33/275e3a6cad7848f2934410ca13151422 [2019-01-01 00:45:00,075 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 00:45:00,077 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 00:45:00,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 00:45:00,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 00:45:00,087 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 00:45:00,088 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:45:00" (1/1) ... [2019-01-01 00:45:00,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dd9b2c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:00, skipping insertion in model container [2019-01-01 00:45:00,093 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:45:00" (1/1) ... [2019-01-01 00:45:00,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 00:45:00,182 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 00:45:00,671 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:45:00,689 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 00:45:00,854 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:45:00,947 INFO L195 MainTranslator]: Completed translation [2019-01-01 00:45:00,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:00 WrapperNode [2019-01-01 00:45:00,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 00:45:00,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 00:45:00,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 00:45:00,949 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 00:45:00,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:00" (1/1) ... [2019-01-01 00:45:00,987 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:00" (1/1) ... [2019-01-01 00:45:01,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 00:45:01,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 00:45:01,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 00:45:01,046 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 00:45:01,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:00" (1/1) ... [2019-01-01 00:45:01,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:00" (1/1) ... [2019-01-01 00:45:01,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:00" (1/1) ... [2019-01-01 00:45:01,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:00" (1/1) ... [2019-01-01 00:45:01,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:00" (1/1) ... [2019-01-01 00:45:01,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:00" (1/1) ... [2019-01-01 00:45:01,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:00" (1/1) ... [2019-01-01 00:45:01,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 00:45:01,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 00:45:01,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 00:45:01,105 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 00:45:01,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:00" (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-01 00:45:01,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 00:45:01,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-01 00:45:01,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 00:45:01,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 00:45:01,186 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-01 00:45:01,186 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-01 00:45:01,186 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-01 00:45:01,187 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-01 00:45:01,188 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-01-01 00:45:01,188 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-01-01 00:45:01,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-01 00:45:01,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 00:45:01,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 00:45:01,190 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-01 00:45:02,264 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 00:45:02,265 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 00:45:02,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:45:02 BoogieIcfgContainer [2019-01-01 00:45:02,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 00:45:02,267 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 00:45:02,267 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 00:45:02,270 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 00:45:02,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 12:45:00" (1/3) ... [2019-01-01 00:45:02,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5c8319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:45:02, skipping insertion in model container [2019-01-01 00:45:02,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:45:00" (2/3) ... [2019-01-01 00:45:02,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5c8319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:45:02, skipping insertion in model container [2019-01-01 00:45:02,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:45:02" (3/3) ... [2019-01-01 00:45:02,274 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc_false-unreach-call.i [2019-01-01 00:45:02,323 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,324 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,324 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,324 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,325 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,325 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,325 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,325 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,326 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,326 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,327 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,327 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,327 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,327 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,327 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,328 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,328 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,328 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,328 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,328 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,328 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,329 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,329 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,329 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,329 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,330 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,331 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,332 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,333 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,333 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,333 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,333 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,333 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,334 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,334 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,334 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,334 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,335 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,335 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,335 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,335 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,335 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,336 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,336 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,336 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,336 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,336 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,336 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,337 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,338 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,338 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,338 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,338 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,345 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,349 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,349 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,349 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,350 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,350 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,350 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,350 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,350 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,351 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,351 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,351 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,351 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,352 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,352 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,352 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,352 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,353 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,353 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,353 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,353 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,353 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,354 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,354 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,354 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,354 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,355 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,355 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,355 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,355 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,355 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,356 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,356 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,356 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,356 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,356 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,357 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,357 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,357 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:45:02,400 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-01 00:45:02,400 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 00:45:02,410 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-01 00:45:02,429 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-01 00:45:02,459 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 00:45:02,460 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 00:45:02,460 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 00:45:02,460 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 00:45:02,460 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 00:45:02,460 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 00:45:02,460 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 00:45:02,460 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 00:45:02,461 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 00:45:02,476 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 144places, 175 transitions [2019-01-01 00:45:34,643 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149043 states. [2019-01-01 00:45:34,646 INFO L276 IsEmpty]: Start isEmpty. Operand 149043 states. [2019-01-01 00:45:34,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-01 00:45:34,662 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:45:34,663 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] [2019-01-01 00:45:34,666 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:45:34,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:45:34,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1284724798, now seen corresponding path program 1 times [2019-01-01 00:45:34,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:45:34,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:45:34,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:45:34,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:45:34,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:45:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:45:35,083 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-01 00:45:35,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:45:35,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:45:35,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:45:35,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:45:35,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:45:35,115 INFO L87 Difference]: Start difference. First operand 149043 states. Second operand 4 states. [2019-01-01 00:45:45,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:45:45,345 INFO L93 Difference]: Finished difference Result 257063 states and 1188602 transitions. [2019-01-01 00:45:45,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:45:45,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-01-01 00:45:45,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:45:46,964 INFO L225 Difference]: With dead ends: 257063 [2019-01-01 00:45:46,964 INFO L226 Difference]: Without dead ends: 174813 [2019-01-01 00:45:46,966 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-01 00:45:48,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174813 states. [2019-01-01 00:45:52,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174813 to 110553. [2019-01-01 00:45:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110553 states. [2019-01-01 00:45:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110553 states to 110553 states and 511484 transitions. [2019-01-01 00:45:55,153 INFO L78 Accepts]: Start accepts. Automaton has 110553 states and 511484 transitions. Word has length 44 [2019-01-01 00:45:55,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:45:55,155 INFO L480 AbstractCegarLoop]: Abstraction has 110553 states and 511484 transitions. [2019-01-01 00:45:55,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:45:55,155 INFO L276 IsEmpty]: Start isEmpty. Operand 110553 states and 511484 transitions. [2019-01-01 00:45:55,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-01 00:45:55,182 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:45:55,182 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-01 00:45:55,183 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:45:55,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:45:55,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1885719038, now seen corresponding path program 1 times [2019-01-01 00:45:55,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:45:55,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:45:55,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:45:55,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:45:55,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:45:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:45:55,308 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-01 00:45:55,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:45:55,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 00:45:55,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 00:45:55,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 00:45:55,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:45:55,312 INFO L87 Difference]: Start difference. First operand 110553 states and 511484 transitions. Second operand 3 states. [2019-01-01 00:45:56,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:45:56,620 INFO L93 Difference]: Finished difference Result 110553 states and 511379 transitions. [2019-01-01 00:45:56,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 00:45:56,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-01-01 00:45:56,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:45:57,569 INFO L225 Difference]: With dead ends: 110553 [2019-01-01 00:45:57,569 INFO L226 Difference]: Without dead ends: 110553 [2019-01-01 00:45:57,570 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-01 00:45:58,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110553 states. [2019-01-01 00:46:02,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110553 to 110553. [2019-01-01 00:46:02,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110553 states. [2019-01-01 00:46:02,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110553 states to 110553 states and 511379 transitions. [2019-01-01 00:46:02,616 INFO L78 Accepts]: Start accepts. Automaton has 110553 states and 511379 transitions. Word has length 52 [2019-01-01 00:46:02,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:02,617 INFO L480 AbstractCegarLoop]: Abstraction has 110553 states and 511379 transitions. [2019-01-01 00:46:02,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 00:46:02,617 INFO L276 IsEmpty]: Start isEmpty. Operand 110553 states and 511379 transitions. [2019-01-01 00:46:02,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-01 00:46:02,632 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:02,632 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-01 00:46:02,632 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:02,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:02,634 INFO L82 PathProgramCache]: Analyzing trace with hash -142908703, now seen corresponding path program 1 times [2019-01-01 00:46:02,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:02,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:02,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:02,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:02,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:02,853 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-01 00:46:02,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:02,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:46:02,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:46:02,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:46:02,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:46:02,855 INFO L87 Difference]: Start difference. First operand 110553 states and 511379 transitions. Second operand 4 states. [2019-01-01 00:46:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:03,636 INFO L93 Difference]: Finished difference Result 99451 states and 448604 transitions. [2019-01-01 00:46:03,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:46:03,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-01-01 00:46:03,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:03,954 INFO L225 Difference]: With dead ends: 99451 [2019-01-01 00:46:03,954 INFO L226 Difference]: Without dead ends: 95221 [2019-01-01 00:46:03,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:46:04,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95221 states. [2019-01-01 00:46:06,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95221 to 95221. [2019-01-01 00:46:06,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95221 states. [2019-01-01 00:46:15,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95221 states to 95221 states and 432988 transitions. [2019-01-01 00:46:15,913 INFO L78 Accepts]: Start accepts. Automaton has 95221 states and 432988 transitions. Word has length 52 [2019-01-01 00:46:15,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:15,913 INFO L480 AbstractCegarLoop]: Abstraction has 95221 states and 432988 transitions. [2019-01-01 00:46:15,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:46:15,913 INFO L276 IsEmpty]: Start isEmpty. Operand 95221 states and 432988 transitions. [2019-01-01 00:46:15,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-01 00:46:15,926 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:15,926 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] [2019-01-01 00:46:15,926 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:15,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:15,927 INFO L82 PathProgramCache]: Analyzing trace with hash -805360345, now seen corresponding path program 1 times [2019-01-01 00:46:15,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:15,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:15,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:15,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:15,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:16,227 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-01 00:46:16,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:16,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:46:16,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:46:16,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:46:16,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:46:16,230 INFO L87 Difference]: Start difference. First operand 95221 states and 432988 transitions. Second operand 5 states. [2019-01-01 00:46:16,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:16,881 INFO L93 Difference]: Finished difference Result 30965 states and 124168 transitions. [2019-01-01 00:46:16,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:46:16,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-01-01 00:46:16,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:16,951 INFO L225 Difference]: With dead ends: 30965 [2019-01-01 00:46:16,951 INFO L226 Difference]: Without dead ends: 27337 [2019-01-01 00:46:16,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:46:17,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27337 states. [2019-01-01 00:46:17,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27337 to 26877. [2019-01-01 00:46:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26877 states. [2019-01-01 00:46:17,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26877 states to 26877 states and 107650 transitions. [2019-01-01 00:46:17,535 INFO L78 Accepts]: Start accepts. Automaton has 26877 states and 107650 transitions. Word has length 53 [2019-01-01 00:46:17,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:17,536 INFO L480 AbstractCegarLoop]: Abstraction has 26877 states and 107650 transitions. [2019-01-01 00:46:17,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:46:17,536 INFO L276 IsEmpty]: Start isEmpty. Operand 26877 states and 107650 transitions. [2019-01-01 00:46:17,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-01 00:46:17,541 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:17,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:46:17,541 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:17,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:17,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1570820033, now seen corresponding path program 1 times [2019-01-01 00:46:17,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:17,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:17,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:17,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:17,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:17,644 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-01 00:46:17,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:17,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:46:17,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:46:17,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:46:17,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:46:17,646 INFO L87 Difference]: Start difference. First operand 26877 states and 107650 transitions. Second operand 5 states. [2019-01-01 00:46:18,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:18,636 INFO L93 Difference]: Finished difference Result 51021 states and 201904 transitions. [2019-01-01 00:46:18,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:46:18,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-01-01 00:46:18,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:18,777 INFO L225 Difference]: With dead ends: 51021 [2019-01-01 00:46:18,777 INFO L226 Difference]: Without dead ends: 50646 [2019-01-01 00:46:18,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:46:18,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50646 states. [2019-01-01 00:46:19,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50646 to 35270. [2019-01-01 00:46:19,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35270 states. [2019-01-01 00:46:19,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35270 states to 35270 states and 138745 transitions. [2019-01-01 00:46:19,742 INFO L78 Accepts]: Start accepts. Automaton has 35270 states and 138745 transitions. Word has length 53 [2019-01-01 00:46:19,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:19,743 INFO L480 AbstractCegarLoop]: Abstraction has 35270 states and 138745 transitions. [2019-01-01 00:46:19,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:46:19,743 INFO L276 IsEmpty]: Start isEmpty. Operand 35270 states and 138745 transitions. [2019-01-01 00:46:19,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-01 00:46:19,749 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:19,749 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] [2019-01-01 00:46:19,749 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:19,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:19,751 INFO L82 PathProgramCache]: Analyzing trace with hash 2068992963, now seen corresponding path program 1 times [2019-01-01 00:46:19,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:19,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:19,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:19,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:19,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:19,864 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-01 00:46:19,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:19,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 00:46:19,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 00:46:19,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 00:46:19,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:46:19,866 INFO L87 Difference]: Start difference. First operand 35270 states and 138745 transitions. Second operand 3 states. [2019-01-01 00:46:20,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:20,205 INFO L93 Difference]: Finished difference Result 46810 states and 182037 transitions. [2019-01-01 00:46:20,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 00:46:20,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-01-01 00:46:20,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:20,341 INFO L225 Difference]: With dead ends: 46810 [2019-01-01 00:46:20,341 INFO L226 Difference]: Without dead ends: 46790 [2019-01-01 00:46:20,342 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-01 00:46:20,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46790 states. [2019-01-01 00:46:21,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46790 to 36252. [2019-01-01 00:46:21,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36252 states. [2019-01-01 00:46:21,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36252 states to 36252 states and 141452 transitions. [2019-01-01 00:46:21,210 INFO L78 Accepts]: Start accepts. Automaton has 36252 states and 141452 transitions. Word has length 55 [2019-01-01 00:46:21,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:21,211 INFO L480 AbstractCegarLoop]: Abstraction has 36252 states and 141452 transitions. [2019-01-01 00:46:21,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 00:46:21,211 INFO L276 IsEmpty]: Start isEmpty. Operand 36252 states and 141452 transitions. [2019-01-01 00:46:21,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-01 00:46:21,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:21,218 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] [2019-01-01 00:46:21,219 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:21,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:21,219 INFO L82 PathProgramCache]: Analyzing trace with hash -43565154, now seen corresponding path program 1 times [2019-01-01 00:46:21,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:21,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:21,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:21,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:21,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:21,588 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-01 00:46:21,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:21,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 00:46:21,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 00:46:21,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 00:46:21,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:46:21,590 INFO L87 Difference]: Start difference. First operand 36252 states and 141452 transitions. Second operand 8 states. [2019-01-01 00:46:22,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:22,858 INFO L93 Difference]: Finished difference Result 46960 states and 180450 transitions. [2019-01-01 00:46:22,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 00:46:22,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-01-01 00:46:22,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:22,980 INFO L225 Difference]: With dead ends: 46960 [2019-01-01 00:46:22,980 INFO L226 Difference]: Without dead ends: 46495 [2019-01-01 00:46:22,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-01-01 00:46:23,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46495 states. [2019-01-01 00:46:24,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46495 to 39286. [2019-01-01 00:46:24,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39286 states. [2019-01-01 00:46:24,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39286 states to 39286 states and 153148 transitions. [2019-01-01 00:46:24,478 INFO L78 Accepts]: Start accepts. Automaton has 39286 states and 153148 transitions. Word has length 59 [2019-01-01 00:46:24,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:24,478 INFO L480 AbstractCegarLoop]: Abstraction has 39286 states and 153148 transitions. [2019-01-01 00:46:24,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 00:46:24,478 INFO L276 IsEmpty]: Start isEmpty. Operand 39286 states and 153148 transitions. [2019-01-01 00:46:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-01 00:46:24,504 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:24,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:46:24,505 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:24,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:24,505 INFO L82 PathProgramCache]: Analyzing trace with hash -41019099, now seen corresponding path program 1 times [2019-01-01 00:46:24,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:24,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:24,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:24,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:24,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:24,724 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-01 00:46:24,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:24,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:46:24,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:46:24,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:46:24,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:46:24,727 INFO L87 Difference]: Start difference. First operand 39286 states and 153148 transitions. Second operand 4 states. [2019-01-01 00:46:25,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:25,237 INFO L93 Difference]: Finished difference Result 46099 states and 179011 transitions. [2019-01-01 00:46:25,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:46:25,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-01-01 00:46:25,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:25,361 INFO L225 Difference]: With dead ends: 46099 [2019-01-01 00:46:25,361 INFO L226 Difference]: Without dead ends: 46099 [2019-01-01 00:46:25,361 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-01 00:46:25,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46099 states. [2019-01-01 00:46:26,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46099 to 42131. [2019-01-01 00:46:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42131 states. [2019-01-01 00:46:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42131 states to 42131 states and 163843 transitions. [2019-01-01 00:46:26,218 INFO L78 Accepts]: Start accepts. Automaton has 42131 states and 163843 transitions. Word has length 70 [2019-01-01 00:46:26,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:26,218 INFO L480 AbstractCegarLoop]: Abstraction has 42131 states and 163843 transitions. [2019-01-01 00:46:26,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:46:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 42131 states and 163843 transitions. [2019-01-01 00:46:26,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-01 00:46:26,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:26,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:46:26,251 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:26,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:26,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1701791236, now seen corresponding path program 1 times [2019-01-01 00:46:26,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:26,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:26,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:26,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:26,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:26,394 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-01 00:46:26,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:26,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:46:26,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:46:26,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:46:26,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:46:26,396 INFO L87 Difference]: Start difference. First operand 42131 states and 163843 transitions. Second operand 6 states. [2019-01-01 00:46:26,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:26,553 INFO L93 Difference]: Finished difference Result 13811 states and 46067 transitions. [2019-01-01 00:46:26,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:46:26,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-01-01 00:46:26,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:26,577 INFO L225 Difference]: With dead ends: 13811 [2019-01-01 00:46:26,577 INFO L226 Difference]: Without dead ends: 11555 [2019-01-01 00:46:26,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:46:26,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11555 states. [2019-01-01 00:46:26,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11555 to 11015. [2019-01-01 00:46:26,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11015 states. [2019-01-01 00:46:26,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11015 states to 11015 states and 36159 transitions. [2019-01-01 00:46:26,760 INFO L78 Accepts]: Start accepts. Automaton has 11015 states and 36159 transitions. Word has length 70 [2019-01-01 00:46:26,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:26,760 INFO L480 AbstractCegarLoop]: Abstraction has 11015 states and 36159 transitions. [2019-01-01 00:46:26,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:46:26,760 INFO L276 IsEmpty]: Start isEmpty. Operand 11015 states and 36159 transitions. [2019-01-01 00:46:26,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:46:26,781 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:26,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:46:26,782 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:26,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:26,782 INFO L82 PathProgramCache]: Analyzing trace with hash 577239524, now seen corresponding path program 1 times [2019-01-01 00:46:26,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:26,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:26,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:26,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:26,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:26,911 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-01 00:46:26,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:26,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:46:26,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:46:26,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:46:26,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:46:26,912 INFO L87 Difference]: Start difference. First operand 11015 states and 36159 transitions. Second operand 4 states. [2019-01-01 00:46:27,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:27,208 INFO L93 Difference]: Finished difference Result 16578 states and 54793 transitions. [2019-01-01 00:46:27,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:46:27,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-01-01 00:46:27,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:27,246 INFO L225 Difference]: With dead ends: 16578 [2019-01-01 00:46:27,246 INFO L226 Difference]: Without dead ends: 16578 [2019-01-01 00:46:27,247 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-01 00:46:27,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16578 states. [2019-01-01 00:46:27,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16578 to 11143. [2019-01-01 00:46:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11143 states. [2019-01-01 00:46:27,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11143 states to 11143 states and 36575 transitions. [2019-01-01 00:46:27,458 INFO L78 Accepts]: Start accepts. Automaton has 11143 states and 36575 transitions. Word has length 89 [2019-01-01 00:46:27,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:27,458 INFO L480 AbstractCegarLoop]: Abstraction has 11143 states and 36575 transitions. [2019-01-01 00:46:27,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:46:27,458 INFO L276 IsEmpty]: Start isEmpty. Operand 11143 states and 36575 transitions. [2019-01-01 00:46:27,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:46:27,480 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:27,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:46:27,480 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:27,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:27,481 INFO L82 PathProgramCache]: Analyzing trace with hash 870642531, now seen corresponding path program 1 times [2019-01-01 00:46:27,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:27,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:27,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:27,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:27,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:27,919 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-01 00:46:27,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:27,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:46:27,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:46:27,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:46:27,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:46:27,922 INFO L87 Difference]: Start difference. First operand 11143 states and 36575 transitions. Second operand 5 states. [2019-01-01 00:46:28,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:28,712 INFO L93 Difference]: Finished difference Result 17252 states and 55296 transitions. [2019-01-01 00:46:28,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:46:28,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-01-01 00:46:28,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:28,747 INFO L225 Difference]: With dead ends: 17252 [2019-01-01 00:46:28,747 INFO L226 Difference]: Without dead ends: 17252 [2019-01-01 00:46:28,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:46:28,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17252 states. [2019-01-01 00:46:28,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17252 to 14130. [2019-01-01 00:46:28,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14130 states. [2019-01-01 00:46:28,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14130 states to 14130 states and 45599 transitions. [2019-01-01 00:46:28,978 INFO L78 Accepts]: Start accepts. Automaton has 14130 states and 45599 transitions. Word has length 89 [2019-01-01 00:46:28,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:28,978 INFO L480 AbstractCegarLoop]: Abstraction has 14130 states and 45599 transitions. [2019-01-01 00:46:28,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:46:28,978 INFO L276 IsEmpty]: Start isEmpty. Operand 14130 states and 45599 transitions. [2019-01-01 00:46:29,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:46:29,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:29,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:46:29,000 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:29,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:29,001 INFO L82 PathProgramCache]: Analyzing trace with hash 480272677, now seen corresponding path program 2 times [2019-01-01 00:46:29,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:29,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:29,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:29,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:29,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:29,142 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-01 00:46:29,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:29,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 00:46:29,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 00:46:29,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 00:46:29,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:46:29,145 INFO L87 Difference]: Start difference. First operand 14130 states and 45599 transitions. Second operand 3 states. [2019-01-01 00:46:29,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:29,848 INFO L93 Difference]: Finished difference Result 15240 states and 49052 transitions. [2019-01-01 00:46:29,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 00:46:29,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-01-01 00:46:29,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:29,877 INFO L225 Difference]: With dead ends: 15240 [2019-01-01 00:46:29,877 INFO L226 Difference]: Without dead ends: 15240 [2019-01-01 00:46:29,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:46:29,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15240 states. [2019-01-01 00:46:30,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15240 to 14740. [2019-01-01 00:46:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14740 states. [2019-01-01 00:46:30,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14740 states to 14740 states and 47507 transitions. [2019-01-01 00:46:30,128 INFO L78 Accepts]: Start accepts. Automaton has 14740 states and 47507 transitions. Word has length 89 [2019-01-01 00:46:30,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:30,129 INFO L480 AbstractCegarLoop]: Abstraction has 14740 states and 47507 transitions. [2019-01-01 00:46:30,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 00:46:30,129 INFO L276 IsEmpty]: Start isEmpty. Operand 14740 states and 47507 transitions. [2019-01-01 00:46:30,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:46:30,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:30,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:46:30,151 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:30,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:30,151 INFO L82 PathProgramCache]: Analyzing trace with hash -795426203, now seen corresponding path program 3 times [2019-01-01 00:46:30,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:30,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:30,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:30,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:46:30,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:30,306 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-01 00:46:30,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:30,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:46:30,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:46:30,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:46:30,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:46:30,308 INFO L87 Difference]: Start difference. First operand 14740 states and 47507 transitions. Second operand 4 states. [2019-01-01 00:46:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:30,493 INFO L93 Difference]: Finished difference Result 15572 states and 50275 transitions. [2019-01-01 00:46:30,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:46:30,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-01-01 00:46:30,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:30,524 INFO L225 Difference]: With dead ends: 15572 [2019-01-01 00:46:30,524 INFO L226 Difference]: Without dead ends: 15572 [2019-01-01 00:46:30,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:46:30,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15572 states. [2019-01-01 00:46:30,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15572 to 14996. [2019-01-01 00:46:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14996 states. [2019-01-01 00:46:31,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14996 states to 14996 states and 48403 transitions. [2019-01-01 00:46:31,072 INFO L78 Accepts]: Start accepts. Automaton has 14996 states and 48403 transitions. Word has length 89 [2019-01-01 00:46:31,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:31,072 INFO L480 AbstractCegarLoop]: Abstraction has 14996 states and 48403 transitions. [2019-01-01 00:46:31,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:46:31,073 INFO L276 IsEmpty]: Start isEmpty. Operand 14996 states and 48403 transitions. [2019-01-01 00:46:31,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:46:31,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:31,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:46:31,097 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:31,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:31,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1692086630, now seen corresponding path program 1 times [2019-01-01 00:46:31,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:31,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:31,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:31,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:46:31,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:31,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-01 00:46:31,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:31,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:46:31,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:46:31,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:46:31,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:46:31,445 INFO L87 Difference]: Start difference. First operand 14996 states and 48403 transitions. Second operand 6 states. [2019-01-01 00:46:32,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:32,278 INFO L93 Difference]: Finished difference Result 21841 states and 70084 transitions. [2019-01-01 00:46:32,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:46:32,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-01-01 00:46:32,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:32,321 INFO L225 Difference]: With dead ends: 21841 [2019-01-01 00:46:32,322 INFO L226 Difference]: Without dead ends: 21713 [2019-01-01 00:46:32,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:46:32,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21713 states. [2019-01-01 00:46:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21713 to 18566. [2019-01-01 00:46:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18566 states. [2019-01-01 00:46:32,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18566 states to 18566 states and 59850 transitions. [2019-01-01 00:46:32,663 INFO L78 Accepts]: Start accepts. Automaton has 18566 states and 59850 transitions. Word has length 89 [2019-01-01 00:46:32,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:32,664 INFO L480 AbstractCegarLoop]: Abstraction has 18566 states and 59850 transitions. [2019-01-01 00:46:32,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:46:32,664 INFO L276 IsEmpty]: Start isEmpty. Operand 18566 states and 59850 transitions. [2019-01-01 00:46:32,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:46:32,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:32,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:46:32,701 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:32,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:32,702 INFO L82 PathProgramCache]: Analyzing trace with hash -104864729, now seen corresponding path program 1 times [2019-01-01 00:46:32,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:32,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:32,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:32,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:32,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:33,105 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-01 00:46:33,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:33,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:46:33,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:46:33,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:46:33,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:46:33,107 INFO L87 Difference]: Start difference. First operand 18566 states and 59850 transitions. Second operand 7 states. [2019-01-01 00:46:33,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:33,986 INFO L93 Difference]: Finished difference Result 36185 states and 117319 transitions. [2019-01-01 00:46:33,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 00:46:33,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-01-01 00:46:33,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:34,062 INFO L225 Difference]: With dead ends: 36185 [2019-01-01 00:46:34,062 INFO L226 Difference]: Without dead ends: 36185 [2019-01-01 00:46:34,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-01 00:46:34,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36185 states. [2019-01-01 00:46:34,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36185 to 22484. [2019-01-01 00:46:34,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22484 states. [2019-01-01 00:46:34,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22484 states to 22484 states and 72983 transitions. [2019-01-01 00:46:34,559 INFO L78 Accepts]: Start accepts. Automaton has 22484 states and 72983 transitions. Word has length 89 [2019-01-01 00:46:34,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:34,560 INFO L480 AbstractCegarLoop]: Abstraction has 22484 states and 72983 transitions. [2019-01-01 00:46:34,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:46:34,560 INFO L276 IsEmpty]: Start isEmpty. Operand 22484 states and 72983 transitions. [2019-01-01 00:46:34,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:46:34,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:34,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:46:34,594 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:34,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:34,594 INFO L82 PathProgramCache]: Analyzing trace with hash 782638952, now seen corresponding path program 1 times [2019-01-01 00:46:34,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:34,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:34,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:34,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:34,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:34,766 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-01 00:46:34,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:34,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:46:34,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:46:34,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:46:34,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:46:34,768 INFO L87 Difference]: Start difference. First operand 22484 states and 72983 transitions. Second operand 6 states. [2019-01-01 00:46:35,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:35,574 INFO L93 Difference]: Finished difference Result 23682 states and 76064 transitions. [2019-01-01 00:46:35,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:46:35,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-01-01 00:46:35,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:35,621 INFO L225 Difference]: With dead ends: 23682 [2019-01-01 00:46:35,621 INFO L226 Difference]: Without dead ends: 23682 [2019-01-01 00:46:35,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:46:35,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23682 states. [2019-01-01 00:46:35,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23682 to 19210. [2019-01-01 00:46:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19210 states. [2019-01-01 00:46:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19210 states to 19210 states and 61462 transitions. [2019-01-01 00:46:35,975 INFO L78 Accepts]: Start accepts. Automaton has 19210 states and 61462 transitions. Word has length 89 [2019-01-01 00:46:35,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:35,975 INFO L480 AbstractCegarLoop]: Abstraction has 19210 states and 61462 transitions. [2019-01-01 00:46:35,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:46:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 19210 states and 61462 transitions. [2019-01-01 00:46:36,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:46:36,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:36,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:46:36,006 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:36,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:36,006 INFO L82 PathProgramCache]: Analyzing trace with hash 241225720, now seen corresponding path program 1 times [2019-01-01 00:46:36,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:36,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:36,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:36,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:36,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:36,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-01 00:46:36,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:36,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:46:36,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:46:36,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:46:36,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:46:36,182 INFO L87 Difference]: Start difference. First operand 19210 states and 61462 transitions. Second operand 6 states. [2019-01-01 00:46:36,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:36,961 INFO L93 Difference]: Finished difference Result 22660 states and 71632 transitions. [2019-01-01 00:46:36,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:46:36,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-01-01 00:46:36,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:37,005 INFO L225 Difference]: With dead ends: 22660 [2019-01-01 00:46:37,005 INFO L226 Difference]: Without dead ends: 22140 [2019-01-01 00:46:37,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-01 00:46:37,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22140 states. [2019-01-01 00:46:37,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22140 to 20895. [2019-01-01 00:46:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20895 states. [2019-01-01 00:46:37,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20895 states to 20895 states and 66615 transitions. [2019-01-01 00:46:37,367 INFO L78 Accepts]: Start accepts. Automaton has 20895 states and 66615 transitions. Word has length 89 [2019-01-01 00:46:37,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:37,367 INFO L480 AbstractCegarLoop]: Abstraction has 20895 states and 66615 transitions. [2019-01-01 00:46:37,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:46:37,368 INFO L276 IsEmpty]: Start isEmpty. Operand 20895 states and 66615 transitions. [2019-01-01 00:46:37,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:46:37,402 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:37,403 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:46:37,403 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:37,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:37,403 INFO L82 PathProgramCache]: Analyzing trace with hash -167762221, now seen corresponding path program 1 times [2019-01-01 00:46:37,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:37,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:37,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:37,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:37,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:38,204 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-01-01 00:46:38,211 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-01 00:46:38,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:38,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:46:38,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:46:38,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:46:38,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:46:38,212 INFO L87 Difference]: Start difference. First operand 20895 states and 66615 transitions. Second operand 7 states. [2019-01-01 00:46:39,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:39,017 INFO L93 Difference]: Finished difference Result 23643 states and 75314 transitions. [2019-01-01 00:46:39,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:46:39,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-01-01 00:46:39,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:39,064 INFO L225 Difference]: With dead ends: 23643 [2019-01-01 00:46:39,064 INFO L226 Difference]: Without dead ends: 23643 [2019-01-01 00:46:39,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:46:39,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23643 states. [2019-01-01 00:46:39,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23643 to 21045. [2019-01-01 00:46:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21045 states. [2019-01-01 00:46:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21045 states to 21045 states and 67255 transitions. [2019-01-01 00:46:39,424 INFO L78 Accepts]: Start accepts. Automaton has 21045 states and 67255 transitions. Word has length 89 [2019-01-01 00:46:39,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:39,424 INFO L480 AbstractCegarLoop]: Abstraction has 21045 states and 67255 transitions. [2019-01-01 00:46:39,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:46:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 21045 states and 67255 transitions. [2019-01-01 00:46:39,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:46:39,451 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:39,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:46:39,451 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:39,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:39,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1768878121, now seen corresponding path program 1 times [2019-01-01 00:46:39,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:39,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:39,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:39,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:39,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:39,749 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-01 00:46:39,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:39,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:46:39,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:46:39,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:46:39,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:46:39,750 INFO L87 Difference]: Start difference. First operand 21045 states and 67255 transitions. Second operand 6 states. [2019-01-01 00:46:40,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:40,288 INFO L93 Difference]: Finished difference Result 23210 states and 72517 transitions. [2019-01-01 00:46:40,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 00:46:40,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-01-01 00:46:40,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:40,331 INFO L225 Difference]: With dead ends: 23210 [2019-01-01 00:46:40,331 INFO L226 Difference]: Without dead ends: 23210 [2019-01-01 00:46:40,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:46:40,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23210 states. [2019-01-01 00:46:40,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23210 to 21470. [2019-01-01 00:46:40,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21470 states. [2019-01-01 00:46:40,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21470 states to 21470 states and 67415 transitions. [2019-01-01 00:46:40,667 INFO L78 Accepts]: Start accepts. Automaton has 21470 states and 67415 transitions. Word has length 89 [2019-01-01 00:46:40,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:40,667 INFO L480 AbstractCegarLoop]: Abstraction has 21470 states and 67415 transitions. [2019-01-01 00:46:40,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:46:40,667 INFO L276 IsEmpty]: Start isEmpty. Operand 21470 states and 67415 transitions. [2019-01-01 00:46:40,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:46:40,693 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:40,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:46:40,694 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:40,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:40,694 INFO L82 PathProgramCache]: Analyzing trace with hash -2023614666, now seen corresponding path program 1 times [2019-01-01 00:46:40,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:40,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:40,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:40,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:40,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:40,883 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-01 00:46:40,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:40,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:46:40,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:46:40,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:46:40,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:46:40,884 INFO L87 Difference]: Start difference. First operand 21470 states and 67415 transitions. Second operand 6 states. [2019-01-01 00:46:41,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:41,105 INFO L93 Difference]: Finished difference Result 19998 states and 61607 transitions. [2019-01-01 00:46:41,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:46:41,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-01-01 00:46:41,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:41,145 INFO L225 Difference]: With dead ends: 19998 [2019-01-01 00:46:41,146 INFO L226 Difference]: Without dead ends: 19998 [2019-01-01 00:46:41,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:46:41,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19998 states. [2019-01-01 00:46:41,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19998 to 12659. [2019-01-01 00:46:41,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12659 states. [2019-01-01 00:46:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12659 states to 12659 states and 38917 transitions. [2019-01-01 00:46:41,418 INFO L78 Accepts]: Start accepts. Automaton has 12659 states and 38917 transitions. Word has length 89 [2019-01-01 00:46:41,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:41,418 INFO L480 AbstractCegarLoop]: Abstraction has 12659 states and 38917 transitions. [2019-01-01 00:46:41,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:46:41,419 INFO L276 IsEmpty]: Start isEmpty. Operand 12659 states and 38917 transitions. [2019-01-01 00:46:41,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:46:41,439 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:41,439 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-01 00:46:41,439 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:41,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:41,440 INFO L82 PathProgramCache]: Analyzing trace with hash 368979928, now seen corresponding path program 1 times [2019-01-01 00:46:41,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:41,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:41,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:41,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:41,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:41,823 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-01 00:46:41,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:41,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:46:41,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:46:41,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:46:41,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:46:41,824 INFO L87 Difference]: Start difference. First operand 12659 states and 38917 transitions. Second operand 6 states. [2019-01-01 00:46:42,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:42,202 INFO L93 Difference]: Finished difference Result 14589 states and 44526 transitions. [2019-01-01 00:46:42,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:46:42,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-01 00:46:42,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:42,228 INFO L225 Difference]: With dead ends: 14589 [2019-01-01 00:46:42,228 INFO L226 Difference]: Without dead ends: 14299 [2019-01-01 00:46:42,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:46:42,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14299 states. [2019-01-01 00:46:42,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14299 to 11174. [2019-01-01 00:46:42,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11174 states. [2019-01-01 00:46:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11174 states to 11174 states and 34049 transitions. [2019-01-01 00:46:42,408 INFO L78 Accepts]: Start accepts. Automaton has 11174 states and 34049 transitions. Word has length 91 [2019-01-01 00:46:42,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:42,409 INFO L480 AbstractCegarLoop]: Abstraction has 11174 states and 34049 transitions. [2019-01-01 00:46:42,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:46:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 11174 states and 34049 transitions. [2019-01-01 00:46:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:46:42,423 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:42,423 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-01 00:46:42,424 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:42,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:42,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1708229415, now seen corresponding path program 1 times [2019-01-01 00:46:42,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:42,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:42,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:42,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:42,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:42,744 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-01 00:46:42,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:42,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 00:46:42,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 00:46:42,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 00:46:42,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:46:42,745 INFO L87 Difference]: Start difference. First operand 11174 states and 34049 transitions. Second operand 9 states. [2019-01-01 00:46:43,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:43,153 INFO L93 Difference]: Finished difference Result 13011 states and 39626 transitions. [2019-01-01 00:46:43,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 00:46:43,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-01-01 00:46:43,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:43,178 INFO L225 Difference]: With dead ends: 13011 [2019-01-01 00:46:43,178 INFO L226 Difference]: Without dead ends: 13011 [2019-01-01 00:46:43,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-01-01 00:46:43,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13011 states. [2019-01-01 00:46:43,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13011 to 12772. [2019-01-01 00:46:43,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12772 states. [2019-01-01 00:46:43,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12772 states to 12772 states and 38928 transitions. [2019-01-01 00:46:43,380 INFO L78 Accepts]: Start accepts. Automaton has 12772 states and 38928 transitions. Word has length 91 [2019-01-01 00:46:43,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:43,380 INFO L480 AbstractCegarLoop]: Abstraction has 12772 states and 38928 transitions. [2019-01-01 00:46:43,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 00:46:43,381 INFO L276 IsEmpty]: Start isEmpty. Operand 12772 states and 38928 transitions. [2019-01-01 00:46:43,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:46:43,402 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:43,402 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-01 00:46:43,402 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:43,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:43,403 INFO L82 PathProgramCache]: Analyzing trace with hash -820725734, now seen corresponding path program 1 times [2019-01-01 00:46:43,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:43,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:43,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:43,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:43,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:43,613 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-01 00:46:43,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:43,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:46:43,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:46:43,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:46:43,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:46:43,614 INFO L87 Difference]: Start difference. First operand 12772 states and 38928 transitions. Second operand 7 states. [2019-01-01 00:46:44,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:44,130 INFO L93 Difference]: Finished difference Result 22526 states and 68652 transitions. [2019-01-01 00:46:44,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:46:44,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-01-01 00:46:44,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:44,151 INFO L225 Difference]: With dead ends: 22526 [2019-01-01 00:46:44,152 INFO L226 Difference]: Without dead ends: 11514 [2019-01-01 00:46:44,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:46:44,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11514 states. [2019-01-01 00:46:44,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11514 to 10920. [2019-01-01 00:46:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10920 states. [2019-01-01 00:46:44,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10920 states to 10920 states and 33112 transitions. [2019-01-01 00:46:44,325 INFO L78 Accepts]: Start accepts. Automaton has 10920 states and 33112 transitions. Word has length 91 [2019-01-01 00:46:44,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:44,326 INFO L480 AbstractCegarLoop]: Abstraction has 10920 states and 33112 transitions. [2019-01-01 00:46:44,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:46:44,326 INFO L276 IsEmpty]: Start isEmpty. Operand 10920 states and 33112 transitions. [2019-01-01 00:46:44,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:46:44,341 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:44,342 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-01 00:46:44,342 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:44,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:44,342 INFO L82 PathProgramCache]: Analyzing trace with hash -148260104, now seen corresponding path program 2 times [2019-01-01 00:46:44,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:44,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:44,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:44,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:44,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:44,619 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 00:46:44,975 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-01 00:46:44,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:44,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-01 00:46:44,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 00:46:44,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 00:46:44,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-01 00:46:44,979 INFO L87 Difference]: Start difference. First operand 10920 states and 33112 transitions. Second operand 10 states. [2019-01-01 00:46:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:45,829 INFO L93 Difference]: Finished difference Result 18376 states and 55985 transitions. [2019-01-01 00:46:45,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 00:46:45,831 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-01-01 00:46:45,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:45,843 INFO L225 Difference]: With dead ends: 18376 [2019-01-01 00:46:45,843 INFO L226 Difference]: Without dead ends: 6510 [2019-01-01 00:46:45,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-01-01 00:46:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2019-01-01 00:46:45,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 6510. [2019-01-01 00:46:45,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6510 states. [2019-01-01 00:46:45,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6510 states to 6510 states and 19834 transitions. [2019-01-01 00:46:45,944 INFO L78 Accepts]: Start accepts. Automaton has 6510 states and 19834 transitions. Word has length 91 [2019-01-01 00:46:45,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:45,944 INFO L480 AbstractCegarLoop]: Abstraction has 6510 states and 19834 transitions. [2019-01-01 00:46:45,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 00:46:45,945 INFO L276 IsEmpty]: Start isEmpty. Operand 6510 states and 19834 transitions. [2019-01-01 00:46:45,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:46:45,954 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:45,954 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-01 00:46:45,954 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:45,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:45,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1100497526, now seen corresponding path program 1 times [2019-01-01 00:46:45,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:45,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:45,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:45,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:46:45,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:46:46,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:46:46,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:46:46,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:46:46,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:46:46,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:46:46,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:46:46,316 INFO L87 Difference]: Start difference. First operand 6510 states and 19834 transitions. Second operand 7 states. [2019-01-01 00:46:46,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:46:46,599 INFO L93 Difference]: Finished difference Result 7878 states and 24020 transitions. [2019-01-01 00:46:46,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 00:46:46,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-01-01 00:46:46,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:46:46,614 INFO L225 Difference]: With dead ends: 7878 [2019-01-01 00:46:46,615 INFO L226 Difference]: Without dead ends: 7878 [2019-01-01 00:46:46,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:46:46,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states. [2019-01-01 00:46:46,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 7814. [2019-01-01 00:46:46,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7814 states. [2019-01-01 00:46:46,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7814 states to 7814 states and 23812 transitions. [2019-01-01 00:46:46,738 INFO L78 Accepts]: Start accepts. Automaton has 7814 states and 23812 transitions. Word has length 91 [2019-01-01 00:46:46,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:46:46,738 INFO L480 AbstractCegarLoop]: Abstraction has 7814 states and 23812 transitions. [2019-01-01 00:46:46,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:46:46,738 INFO L276 IsEmpty]: Start isEmpty. Operand 7814 states and 23812 transitions. [2019-01-01 00:46:46,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:46:46,749 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:46:46,749 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-01 00:46:46,750 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:46:46,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:46:46,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1988001207, now seen corresponding path program 1 times [2019-01-01 00:46:46,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:46:46,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:46:46,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:46,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:46:46,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:46:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 00:46:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 00:46:46,845 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 00:46:47,052 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-01 00:46:47,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 12:46:47 BasicIcfg [2019-01-01 00:46:47,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 00:46:47,055 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 00:46:47,055 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 00:46:47,056 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 00:46:47,056 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:45:02" (3/4) ... [2019-01-01 00:46:47,061 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 00:46:47,259 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 00:46:47,262 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 00:46:47,263 INFO L168 Benchmark]: Toolchain (without parser) took 107187.81 ms. Allocated memory was 1.0 GB in the beginning and 6.5 GB in the end (delta: 5.5 GB). Free memory was 946.0 MB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2019-01-01 00:46:47,265 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:46:47,265 INFO L168 Benchmark]: CACSL2BoogieTranslator took 865.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2019-01-01 00:46:47,268 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 00:46:47,269 INFO L168 Benchmark]: Boogie Preprocessor took 57.86 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-01 00:46:47,269 INFO L168 Benchmark]: RCFGBuilder took 1161.66 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.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. [2019-01-01 00:46:47,269 INFO L168 Benchmark]: TraceAbstraction took 104787.83 ms. Allocated memory was 1.2 GB in the beginning and 6.5 GB in the end (delta: 5.4 GB). Free memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2019-01-01 00:46:47,270 INFO L168 Benchmark]: Witness Printer took 206.95 ms. Allocated memory is still 6.5 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. [2019-01-01 00:46:47,274 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 865.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.86 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 1161.66 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.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 104787.83 ms. Allocated memory was 1.2 GB in the beginning and 6.5 GB in the end (delta: 5.4 GB). Free memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. * Witness Printer took 206.95 ms. Allocated memory is still 6.5 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 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: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L678] -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] [L680] -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] [L682] -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] [L683] -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] [L684] -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] [L685] -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] [L686] -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] [L687] -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] [L688] -1 _Bool y$r_buff0_thd3; 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_buff0_thd3=0] [L689] -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_buff0_thd3=0, y$r_buff1_thd0=0] [L690] -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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L691] -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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L692] -1 _Bool y$r_buff1_thd3; 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L693] -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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L694] -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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L700] -1 int z = 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, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L701] -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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L702] -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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L790] -1 pthread_t t2579; 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L791] FCALL, FORK -1 pthread_create(&t2579, ((void *)0), P0, ((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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L792] -1 pthread_t t2580; 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L793] FCALL, FORK -1 pthread_create(&t2580, ((void *)0), P1, ((void *)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=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L794] -1 pthread_t t2581; 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=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L795] FCALL, FORK -1 pthread_create(&t2581, ((void *)0), P2, ((void *)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=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L753] 0 y$w_buff1 = y$w_buff0 [L754] 0 y$w_buff0 = 1 [L755] 0 y$w_buff1_used = y$w_buff0_used [L756] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) 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=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L758] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L759] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L760] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L761] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L762] 0 y$r_buff0_thd3 = (_Bool)1 [L765] 0 z = 1 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=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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L706] 1 z = 2 [L711] 1 __unbuffered_p0_EAX = x [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L723] 2 x = 1 [L728] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L729] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L730] 2 y$flush_delayed = weak$$choice2 [L731] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L732] EXPR 2 !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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L732] 2 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) [L733] EXPR 2 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L733] 2 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)) [L734] EXPR 2 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L734] 2 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)) [L735] EXPR 2 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L735] 2 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)) [L736] EXPR 2 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L736] 2 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)) [L737] EXPR 2 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L737] 2 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)) [L738] EXPR 2 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L738] 2 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)) [L739] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L740] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L740] 2 y = y$flush_delayed ? y$mem_tmp : y [L741] 2 y$flush_delayed = (_Bool)0 [L746] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L768] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L769] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L769] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L770] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L771] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L772] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L772] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L775] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L797] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L801] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L801] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L801] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L801] -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) [L802] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L802] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L803] -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 [L804] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L804] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L805] -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 [L808] -1 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 217 locations, 3 error locations. UNSAFE Result, 104.6s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 29.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6073 SDtfs, 7961 SDslu, 13684 SDs, 0 SdLazy, 5043 SolverSat, 291 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 64 SyntacticMatches, 15 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149043occurred 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: 34.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 150248 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 2033 NumberOfCodeBlocks, 2033 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1917 ConstructedInterpolants, 0 QuantifiedInterpolants, 409177 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...