./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix048_rmo.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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/mix048_rmo.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68da3b538ab0b104fb53630070700dc628f5298d ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 21:48:56,029 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 21:48:56,031 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 21:48:56,044 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 21:48:56,044 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 21:48:56,045 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 21:48:56,047 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 21:48:56,049 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 21:48:56,050 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 21:48:56,051 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 21:48:56,052 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 21:48:56,053 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 21:48:56,054 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 21:48:56,055 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 21:48:56,056 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 21:48:56,056 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 21:48:56,057 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 21:48:56,059 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 21:48:56,062 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 21:48:56,064 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 21:48:56,065 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 21:48:56,066 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 21:48:56,072 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 21:48:56,072 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 21:48:56,073 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 21:48:56,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 21:48:56,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 21:48:56,076 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 21:48:56,082 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 21:48:56,084 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 21:48:56,084 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 21:48:56,087 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 21:48:56,087 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 21:48:56,087 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 21:48:56,089 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 21:48:56,089 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 21:48:56,094 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 21:48:56,126 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 21:48:56,127 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 21:48:56,128 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 21:48:56,128 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 21:48:56,128 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 21:48:56,129 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 21:48:56,129 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 21:48:56,129 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 21:48:56,129 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 21:48:56,129 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 21:48:56,129 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 21:48:56,130 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 21:48:56,130 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 21:48:56,130 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 21:48:56,130 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 21:48:56,130 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 21:48:56,130 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 21:48:56,131 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 21:48:56,131 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 21:48:56,131 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 21:48:56,131 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 21:48:56,131 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 21:48:56,132 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 21:48:56,132 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 21:48:56,132 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 21:48:56,132 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 21:48:56,132 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 21:48:56,133 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 21:48:56,133 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 68da3b538ab0b104fb53630070700dc628f5298d [2018-12-31 21:48:56,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 21:48:56,183 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 21:48:56,187 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 21:48:56,189 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 21:48:56,189 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 21:48:56,190 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix048_rmo.oepc_false-unreach-call.i [2018-12-31 21:48:56,251 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/342c68d82/142b71a7324948a19f0c649ea1478019/FLAGa11253801 [2018-12-31 21:48:56,882 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 21:48:56,883 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix048_rmo.oepc_false-unreach-call.i [2018-12-31 21:48:56,913 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/342c68d82/142b71a7324948a19f0c649ea1478019/FLAGa11253801 [2018-12-31 21:48:57,150 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/342c68d82/142b71a7324948a19f0c649ea1478019 [2018-12-31 21:48:57,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 21:48:57,156 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 21:48:57,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 21:48:57,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 21:48:57,162 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 21:48:57,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:48:57" (1/1) ... [2018-12-31 21:48:57,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9ed6eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:48:57, skipping insertion in model container [2018-12-31 21:48:57,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:48:57" (1/1) ... [2018-12-31 21:48:57,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 21:48:57,248 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 21:48:57,726 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 21:48:57,741 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 21:48:57,882 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 21:48:57,975 INFO L195 MainTranslator]: Completed translation [2018-12-31 21:48:57,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:48:57 WrapperNode [2018-12-31 21:48:57,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 21:48:57,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 21:48:57,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 21:48:57,977 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 21:48:57,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:48:57" (1/1) ... [2018-12-31 21:48:58,014 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:48:57" (1/1) ... [2018-12-31 21:48:58,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 21:48:58,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 21:48:58,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 21:48:58,054 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 21:48:58,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:48:57" (1/1) ... [2018-12-31 21:48:58,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:48:57" (1/1) ... [2018-12-31 21:48:58,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:48:57" (1/1) ... [2018-12-31 21:48:58,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:48:57" (1/1) ... [2018-12-31 21:48:58,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:48:57" (1/1) ... [2018-12-31 21:48:58,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:48:57" (1/1) ... [2018-12-31 21:48:58,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:48:57" (1/1) ... [2018-12-31 21:48:58,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 21:48:58,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 21:48:58,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 21:48:58,124 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 21:48:58,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:48:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 21:48:58,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 21:48:58,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 21:48:58,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 21:48:58,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 21:48:58,190 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 21:48:58,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 21:48:58,191 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 21:48:58,191 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 21:48:58,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 21:48:58,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 21:48:58,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 21:48:58,193 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 21:48:59,410 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 21:48:59,410 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 21:48:59,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:48:59 BoogieIcfgContainer [2018-12-31 21:48:59,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 21:48:59,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 21:48:59,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 21:48:59,417 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 21:48:59,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:48:57" (1/3) ... [2018-12-31 21:48:59,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30652120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:48:59, skipping insertion in model container [2018-12-31 21:48:59,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:48:57" (2/3) ... [2018-12-31 21:48:59,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30652120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:48:59, skipping insertion in model container [2018-12-31 21:48:59,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:48:59" (3/3) ... [2018-12-31 21:48:59,422 INFO L112 eAbstractionObserver]: Analyzing ICFG mix048_rmo.oepc_false-unreach-call.i [2018-12-31 21:48:59,471 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,471 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,472 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,472 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,472 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,472 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,473 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,473 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,473 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,473 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,474 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,474 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,474 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,474 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,475 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,475 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,475 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,475 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,476 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,476 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,476 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,476 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,477 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,477 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,477 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,477 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,477 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,478 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,478 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,478 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,478 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,479 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,479 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,479 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,479 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,479 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,480 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,480 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,481 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,481 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,481 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,481 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,482 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,482 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,482 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,482 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,482 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,482 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,483 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,483 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,483 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,483 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,484 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,484 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,484 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,484 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,485 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,485 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,485 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,485 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,486 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,486 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,486 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,486 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,486 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,487 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,487 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,487 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,487 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,488 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,488 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,488 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,488 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,488 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,489 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,489 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,489 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,489 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,489 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,492 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,492 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,492 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,492 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,492 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,495 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,495 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,495 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,495 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,496 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,496 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,496 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,496 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,499 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,499 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,499 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,499 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,501 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,501 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,501 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,501 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,501 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,502 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,502 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,502 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,502 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,502 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,503 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,503 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,503 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,503 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,504 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,505 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,506 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,507 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,508 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:48:59,532 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 21:48:59,532 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 21:48:59,541 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 21:48:59,560 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 21:48:59,591 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 21:48:59,591 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 21:48:59,592 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 21:48:59,592 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 21:48:59,592 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 21:48:59,592 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 21:48:59,592 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 21:48:59,592 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 21:48:59,593 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 21:48:59,608 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-12-31 21:49:02,211 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-12-31 21:49:02,214 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-12-31 21:49:02,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 21:49:02,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:02,224 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:02,227 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:02,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:02,235 INFO L82 PathProgramCache]: Analyzing trace with hash -454041356, now seen corresponding path program 1 times [2018-12-31 21:49:02,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:02,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:02,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:02,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:02,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:02,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:02,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:49:02,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:49:02,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:49:02,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:49:02,610 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-12-31 21:49:04,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:04,508 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-12-31 21:49:04,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:49:04,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-31 21:49:04,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:04,901 INFO L225 Difference]: With dead ends: 60790 [2018-12-31 21:49:04,901 INFO L226 Difference]: Without dead ends: 44270 [2018-12-31 21:49:04,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:49:05,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-12-31 21:49:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-12-31 21:49:06,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-12-31 21:49:06,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-12-31 21:49:06,957 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-12-31 21:49:06,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:06,959 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-12-31 21:49:06,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:49:06,960 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-12-31 21:49:06,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 21:49:06,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:06,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:06,977 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:06,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:06,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1863363909, now seen corresponding path program 1 times [2018-12-31 21:49:06,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:06,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:06,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:06,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:06,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:07,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:07,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:07,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:49:07,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:49:07,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:49:07,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:49:07,139 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-12-31 21:49:07,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:07,520 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-12-31 21:49:07,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 21:49:07,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-31 21:49:07,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:07,550 INFO L225 Difference]: With dead ends: 8528 [2018-12-31 21:49:07,550 INFO L226 Difference]: Without dead ends: 7466 [2018-12-31 21:49:07,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:49:07,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-12-31 21:49:07,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-12-31 21:49:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-12-31 21:49:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-12-31 21:49:07,732 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-12-31 21:49:07,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:07,732 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-12-31 21:49:07,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:49:07,732 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-12-31 21:49:07,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 21:49:07,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:07,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:07,735 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:07,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:07,735 INFO L82 PathProgramCache]: Analyzing trace with hash 591681941, now seen corresponding path program 1 times [2018-12-31 21:49:07,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:07,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:07,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:07,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:07,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:07,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:07,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:07,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:49:07,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:49:07,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:49:07,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:49:07,981 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-12-31 21:49:09,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:09,339 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-12-31 21:49:09,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:49:09,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-31 21:49:09,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:09,393 INFO L225 Difference]: With dead ends: 13998 [2018-12-31 21:49:09,393 INFO L226 Difference]: Without dead ends: 13930 [2018-12-31 21:49:09,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:49:09,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-31 21:49:09,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-12-31 21:49:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-31 21:49:09,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-12-31 21:49:09,913 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-12-31 21:49:09,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:09,915 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-12-31 21:49:09,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:49:09,915 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-12-31 21:49:09,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-31 21:49:09,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:09,921 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:09,921 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:09,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:09,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1652121253, now seen corresponding path program 1 times [2018-12-31 21:49:09,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:09,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:09,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:09,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:09,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:10,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:10,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:49:10,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:49:10,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:49:10,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:49:10,039 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-12-31 21:49:10,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:10,161 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-12-31 21:49:10,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:49:10,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-31 21:49:10,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:10,206 INFO L225 Difference]: With dead ends: 13279 [2018-12-31 21:49:10,206 INFO L226 Difference]: Without dead ends: 13279 [2018-12-31 21:49:10,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:49:10,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-12-31 21:49:10,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-12-31 21:49:10,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-12-31 21:49:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-12-31 21:49:10,473 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-12-31 21:49:10,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:10,474 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-12-31 21:49:10,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:49:10,474 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-12-31 21:49:10,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 21:49:10,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:10,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:10,477 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:10,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:10,477 INFO L82 PathProgramCache]: Analyzing trace with hash -164023066, now seen corresponding path program 1 times [2018-12-31 21:49:10,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:10,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:10,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:10,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:10,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:10,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:10,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:10,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 21:49:10,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 21:49:10,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 21:49:10,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:49:10,700 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-12-31 21:49:11,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:11,703 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-12-31 21:49:11,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 21:49:11,704 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-31 21:49:11,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:11,737 INFO L225 Difference]: With dead ends: 12285 [2018-12-31 21:49:11,737 INFO L226 Difference]: Without dead ends: 12213 [2018-12-31 21:49:11,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-31 21:49:11,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-12-31 21:49:11,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-12-31 21:49:11,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-12-31 21:49:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-12-31 21:49:12,007 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-12-31 21:49:12,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:12,008 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-12-31 21:49:12,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 21:49:12,008 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-12-31 21:49:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-31 21:49:12,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:12,022 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:12,022 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:12,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:12,022 INFO L82 PathProgramCache]: Analyzing trace with hash 317195842, now seen corresponding path program 1 times [2018-12-31 21:49:12,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:12,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:12,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:12,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:12,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:12,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:12,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:12,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:49:12,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:49:12,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:49:12,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:49:12,237 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-12-31 21:49:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:12,687 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-12-31 21:49:12,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 21:49:12,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-31 21:49:12,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:12,717 INFO L225 Difference]: With dead ends: 12396 [2018-12-31 21:49:12,717 INFO L226 Difference]: Without dead ends: 12396 [2018-12-31 21:49:12,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:49:12,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-12-31 21:49:12,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-12-31 21:49:12,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-12-31 21:49:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-12-31 21:49:13,026 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-12-31 21:49:13,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:13,027 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-12-31 21:49:13,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:49:13,027 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-12-31 21:49:13,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-31 21:49:13,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:13,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:13,035 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:13,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:13,036 INFO L82 PathProgramCache]: Analyzing trace with hash 2060006177, now seen corresponding path program 1 times [2018-12-31 21:49:13,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:13,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:13,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:13,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:13,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:13,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:13,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:13,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:49:13,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:49:13,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:49:13,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:49:13,163 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-12-31 21:49:13,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:13,899 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-12-31 21:49:13,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 21:49:13,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-31 21:49:13,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:13,945 INFO L225 Difference]: With dead ends: 20969 [2018-12-31 21:49:13,945 INFO L226 Difference]: Without dead ends: 20898 [2018-12-31 21:49:13,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-31 21:49:14,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-12-31 21:49:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-12-31 21:49:14,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-12-31 21:49:14,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-12-31 21:49:14,611 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-12-31 21:49:14,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:14,611 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-12-31 21:49:14,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:49:14,611 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-12-31 21:49:14,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 21:49:14,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:14,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:14,622 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:14,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:14,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1699576415, now seen corresponding path program 1 times [2018-12-31 21:49:14,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:14,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:14,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:14,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:14,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:14,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:14,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:14,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:49:14,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:49:14,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:49:14,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:49:14,760 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-12-31 21:49:15,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:15,352 INFO L93 Difference]: Finished difference Result 17635 states and 54585 transitions. [2018-12-31 21:49:15,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:49:15,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-31 21:49:15,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:15,386 INFO L225 Difference]: With dead ends: 17635 [2018-12-31 21:49:15,386 INFO L226 Difference]: Without dead ends: 17635 [2018-12-31 21:49:15,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:49:15,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17635 states. [2018-12-31 21:49:15,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17635 to 15793. [2018-12-31 21:49:15,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15793 states. [2018-12-31 21:49:15,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15793 states to 15793 states and 49131 transitions. [2018-12-31 21:49:15,749 INFO L78 Accepts]: Start accepts. Automaton has 15793 states and 49131 transitions. Word has length 64 [2018-12-31 21:49:15,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:15,749 INFO L480 AbstractCegarLoop]: Abstraction has 15793 states and 49131 transitions. [2018-12-31 21:49:15,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:49:15,749 INFO L276 IsEmpty]: Start isEmpty. Operand 15793 states and 49131 transitions. [2018-12-31 21:49:15,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 21:49:15,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:15,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:15,766 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:15,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:15,767 INFO L82 PathProgramCache]: Analyzing trace with hash -377632928, now seen corresponding path program 1 times [2018-12-31 21:49:15,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:15,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:15,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:15,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:15,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:15,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:15,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:15,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:49:15,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:49:15,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:49:15,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:49:15,914 INFO L87 Difference]: Start difference. First operand 15793 states and 49131 transitions. Second operand 3 states. [2018-12-31 21:49:16,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:16,563 INFO L93 Difference]: Finished difference Result 16385 states and 50738 transitions. [2018-12-31 21:49:16,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:49:16,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-12-31 21:49:16,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:16,594 INFO L225 Difference]: With dead ends: 16385 [2018-12-31 21:49:16,594 INFO L226 Difference]: Without dead ends: 16385 [2018-12-31 21:49:16,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:49:16,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16385 states. [2018-12-31 21:49:16,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16385 to 16109. [2018-12-31 21:49:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16109 states. [2018-12-31 21:49:16,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16109 states to 16109 states and 49981 transitions. [2018-12-31 21:49:16,888 INFO L78 Accepts]: Start accepts. Automaton has 16109 states and 49981 transitions. Word has length 64 [2018-12-31 21:49:16,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:16,888 INFO L480 AbstractCegarLoop]: Abstraction has 16109 states and 49981 transitions. [2018-12-31 21:49:16,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:49:16,888 INFO L276 IsEmpty]: Start isEmpty. Operand 16109 states and 49981 transitions. [2018-12-31 21:49:16,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 21:49:16,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:16,906 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:16,906 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:16,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:16,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1938632710, now seen corresponding path program 1 times [2018-12-31 21:49:16,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:16,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:16,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:16,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:16,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:17,072 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-31 21:49:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:17,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:17,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:49:17,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:49:17,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:49:17,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:49:17,332 INFO L87 Difference]: Start difference. First operand 16109 states and 49981 transitions. Second operand 6 states. [2018-12-31 21:49:18,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:18,961 INFO L93 Difference]: Finished difference Result 19821 states and 60437 transitions. [2018-12-31 21:49:18,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:49:18,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-31 21:49:18,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:18,998 INFO L225 Difference]: With dead ends: 19821 [2018-12-31 21:49:18,999 INFO L226 Difference]: Without dead ends: 19821 [2018-12-31 21:49:18,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:49:19,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19821 states. [2018-12-31 21:49:19,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19821 to 18617. [2018-12-31 21:49:19,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18617 states. [2018-12-31 21:49:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 57217 transitions. [2018-12-31 21:49:19,594 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 57217 transitions. Word has length 66 [2018-12-31 21:49:19,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:19,594 INFO L480 AbstractCegarLoop]: Abstraction has 18617 states and 57217 transitions. [2018-12-31 21:49:19,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:49:19,595 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 57217 transitions. [2018-12-31 21:49:19,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 21:49:19,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:19,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:19,625 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:19,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:19,625 INFO L82 PathProgramCache]: Analyzing trace with hash -138576633, now seen corresponding path program 1 times [2018-12-31 21:49:19,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:19,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:19,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:19,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:19,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:19,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:19,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:19,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:49:19,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:49:19,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:49:19,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:49:19,916 INFO L87 Difference]: Start difference. First operand 18617 states and 57217 transitions. Second operand 6 states. [2018-12-31 21:49:20,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:20,666 INFO L93 Difference]: Finished difference Result 21449 states and 63626 transitions. [2018-12-31 21:49:20,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 21:49:20,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-31 21:49:20,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:20,705 INFO L225 Difference]: With dead ends: 21449 [2018-12-31 21:49:20,706 INFO L226 Difference]: Without dead ends: 21449 [2018-12-31 21:49:20,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:49:20,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21449 states. [2018-12-31 21:49:21,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21449 to 19133. [2018-12-31 21:49:21,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19133 states. [2018-12-31 21:49:21,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19133 states to 19133 states and 57764 transitions. [2018-12-31 21:49:21,069 INFO L78 Accepts]: Start accepts. Automaton has 19133 states and 57764 transitions. Word has length 66 [2018-12-31 21:49:21,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:21,069 INFO L480 AbstractCegarLoop]: Abstraction has 19133 states and 57764 transitions. [2018-12-31 21:49:21,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:49:21,069 INFO L276 IsEmpty]: Start isEmpty. Operand 19133 states and 57764 transitions. [2018-12-31 21:49:21,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 21:49:21,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:21,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:21,086 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:21,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:21,086 INFO L82 PathProgramCache]: Analyzing trace with hash 72774280, now seen corresponding path program 1 times [2018-12-31 21:49:21,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:21,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:21,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:21,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:21,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:21,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:21,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:21,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:49:21,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:49:21,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:49:21,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:49:21,220 INFO L87 Difference]: Start difference. First operand 19133 states and 57764 transitions. Second operand 5 states. [2018-12-31 21:49:22,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:22,478 INFO L93 Difference]: Finished difference Result 25024 states and 75018 transitions. [2018-12-31 21:49:22,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:49:22,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-31 21:49:22,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:22,526 INFO L225 Difference]: With dead ends: 25024 [2018-12-31 21:49:22,526 INFO L226 Difference]: Without dead ends: 25024 [2018-12-31 21:49:22,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:49:22,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25024 states. [2018-12-31 21:49:22,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25024 to 22709. [2018-12-31 21:49:22,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22709 states. [2018-12-31 21:49:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22709 states to 22709 states and 68032 transitions. [2018-12-31 21:49:22,923 INFO L78 Accepts]: Start accepts. Automaton has 22709 states and 68032 transitions. Word has length 66 [2018-12-31 21:49:22,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:22,923 INFO L480 AbstractCegarLoop]: Abstraction has 22709 states and 68032 transitions. [2018-12-31 21:49:22,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:49:22,923 INFO L276 IsEmpty]: Start isEmpty. Operand 22709 states and 68032 transitions. [2018-12-31 21:49:22,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 21:49:22,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:22,940 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:22,941 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:22,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:22,941 INFO L82 PathProgramCache]: Analyzing trace with hash -437759897, now seen corresponding path program 1 times [2018-12-31 21:49:22,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:22,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:22,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:22,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:22,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:23,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:23,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:49:23,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:49:23,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:49:23,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:49:23,177 INFO L87 Difference]: Start difference. First operand 22709 states and 68032 transitions. Second operand 5 states. [2018-12-31 21:49:23,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:23,350 INFO L93 Difference]: Finished difference Result 7837 states and 18946 transitions. [2018-12-31 21:49:23,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 21:49:23,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-31 21:49:23,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:23,359 INFO L225 Difference]: With dead ends: 7837 [2018-12-31 21:49:23,360 INFO L226 Difference]: Without dead ends: 6355 [2018-12-31 21:49:23,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:49:23,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6355 states. [2018-12-31 21:49:23,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6355 to 5703. [2018-12-31 21:49:23,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5703 states. [2018-12-31 21:49:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5703 states to 5703 states and 13364 transitions. [2018-12-31 21:49:23,449 INFO L78 Accepts]: Start accepts. Automaton has 5703 states and 13364 transitions. Word has length 66 [2018-12-31 21:49:23,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:23,450 INFO L480 AbstractCegarLoop]: Abstraction has 5703 states and 13364 transitions. [2018-12-31 21:49:23,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:49:23,450 INFO L276 IsEmpty]: Start isEmpty. Operand 5703 states and 13364 transitions. [2018-12-31 21:49:23,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 21:49:23,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:23,458 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:23,458 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:23,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:23,458 INFO L82 PathProgramCache]: Analyzing trace with hash 890203314, now seen corresponding path program 1 times [2018-12-31 21:49:23,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:23,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:23,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:23,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:23,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:23,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:23,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:23,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:49:23,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:49:23,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:49:23,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:49:23,544 INFO L87 Difference]: Start difference. First operand 5703 states and 13364 transitions. Second operand 3 states. [2018-12-31 21:49:23,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:23,759 INFO L93 Difference]: Finished difference Result 7505 states and 17450 transitions. [2018-12-31 21:49:23,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:49:23,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-31 21:49:23,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:23,770 INFO L225 Difference]: With dead ends: 7505 [2018-12-31 21:49:23,770 INFO L226 Difference]: Without dead ends: 7505 [2018-12-31 21:49:23,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:49:23,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7505 states. [2018-12-31 21:49:23,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7505 to 5642. [2018-12-31 21:49:23,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2018-12-31 21:49:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 12904 transitions. [2018-12-31 21:49:23,849 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 12904 transitions. Word has length 66 [2018-12-31 21:49:23,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:23,849 INFO L480 AbstractCegarLoop]: Abstraction has 5642 states and 12904 transitions. [2018-12-31 21:49:23,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:49:23,849 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 12904 transitions. [2018-12-31 21:49:23,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 21:49:23,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:23,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:23,858 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:23,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:23,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1181781029, now seen corresponding path program 1 times [2018-12-31 21:49:23,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:23,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:23,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:23,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:23,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:24,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:24,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:24,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:49:24,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:49:24,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:49:24,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:49:24,149 INFO L87 Difference]: Start difference. First operand 5642 states and 12904 transitions. Second operand 5 states. [2018-12-31 21:49:24,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:24,367 INFO L93 Difference]: Finished difference Result 6806 states and 15528 transitions. [2018-12-31 21:49:24,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 21:49:24,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-31 21:49:24,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:24,378 INFO L225 Difference]: With dead ends: 6806 [2018-12-31 21:49:24,378 INFO L226 Difference]: Without dead ends: 6806 [2018-12-31 21:49:24,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:49:24,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6806 states. [2018-12-31 21:49:24,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6806 to 6086. [2018-12-31 21:49:24,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6086 states. [2018-12-31 21:49:24,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6086 states to 6086 states and 13908 transitions. [2018-12-31 21:49:24,476 INFO L78 Accepts]: Start accepts. Automaton has 6086 states and 13908 transitions. Word has length 72 [2018-12-31 21:49:24,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:24,476 INFO L480 AbstractCegarLoop]: Abstraction has 6086 states and 13908 transitions. [2018-12-31 21:49:24,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:49:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand 6086 states and 13908 transitions. [2018-12-31 21:49:24,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 21:49:24,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:24,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:24,487 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:24,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:24,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1370375932, now seen corresponding path program 1 times [2018-12-31 21:49:24,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:24,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:24,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:24,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:24,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:24,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:24,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:24,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 21:49:24,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 21:49:24,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 21:49:24,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:49:24,751 INFO L87 Difference]: Start difference. First operand 6086 states and 13908 transitions. Second operand 9 states. [2018-12-31 21:49:25,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:25,735 INFO L93 Difference]: Finished difference Result 8112 states and 18389 transitions. [2018-12-31 21:49:25,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 21:49:25,736 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-12-31 21:49:25,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:25,747 INFO L225 Difference]: With dead ends: 8112 [2018-12-31 21:49:25,747 INFO L226 Difference]: Without dead ends: 7993 [2018-12-31 21:49:25,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-12-31 21:49:25,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7993 states. [2018-12-31 21:49:25,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7993 to 6183. [2018-12-31 21:49:25,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6183 states. [2018-12-31 21:49:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6183 states to 6183 states and 14001 transitions. [2018-12-31 21:49:25,874 INFO L78 Accepts]: Start accepts. Automaton has 6183 states and 14001 transitions. Word has length 72 [2018-12-31 21:49:25,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:25,874 INFO L480 AbstractCegarLoop]: Abstraction has 6183 states and 14001 transitions. [2018-12-31 21:49:25,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 21:49:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand 6183 states and 14001 transitions. [2018-12-31 21:49:25,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 21:49:25,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:25,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:25,886 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:25,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:25,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1174333635, now seen corresponding path program 1 times [2018-12-31 21:49:25,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:25,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:25,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:25,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:25,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:26,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:26,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:49:26,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:49:26,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:49:26,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:49:26,162 INFO L87 Difference]: Start difference. First operand 6183 states and 14001 transitions. Second operand 4 states. [2018-12-31 21:49:26,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:26,529 INFO L93 Difference]: Finished difference Result 9854 states and 22232 transitions. [2018-12-31 21:49:26,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:49:26,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-31 21:49:26,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:26,543 INFO L225 Difference]: With dead ends: 9854 [2018-12-31 21:49:26,543 INFO L226 Difference]: Without dead ends: 9854 [2018-12-31 21:49:26,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:49:26,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9854 states. [2018-12-31 21:49:26,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9854 to 7303. [2018-12-31 21:49:26,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7303 states. [2018-12-31 21:49:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 16335 transitions. [2018-12-31 21:49:26,644 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 16335 transitions. Word has length 91 [2018-12-31 21:49:26,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:26,645 INFO L480 AbstractCegarLoop]: Abstraction has 7303 states and 16335 transitions. [2018-12-31 21:49:26,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:49:26,645 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 16335 transitions. [2018-12-31 21:49:26,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 21:49:26,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:26,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:26,656 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:26,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:26,657 INFO L82 PathProgramCache]: Analyzing trace with hash 39095599, now seen corresponding path program 1 times [2018-12-31 21:49:26,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:26,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:26,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:26,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:26,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:26,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:26,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:26,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:49:26,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:49:26,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:49:26,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:49:26,779 INFO L87 Difference]: Start difference. First operand 7303 states and 16335 transitions. Second operand 4 states. [2018-12-31 21:49:26,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:26,900 INFO L93 Difference]: Finished difference Result 7805 states and 17493 transitions. [2018-12-31 21:49:26,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:49:26,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-31 21:49:26,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:26,910 INFO L225 Difference]: With dead ends: 7805 [2018-12-31 21:49:26,911 INFO L226 Difference]: Without dead ends: 7805 [2018-12-31 21:49:26,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:49:26,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7805 states. [2018-12-31 21:49:26,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7805 to 7209. [2018-12-31 21:49:26,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7209 states. [2018-12-31 21:49:27,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7209 states to 7209 states and 16230 transitions. [2018-12-31 21:49:27,001 INFO L78 Accepts]: Start accepts. Automaton has 7209 states and 16230 transitions. Word has length 91 [2018-12-31 21:49:27,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:27,002 INFO L480 AbstractCegarLoop]: Abstraction has 7209 states and 16230 transitions. [2018-12-31 21:49:27,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:49:27,002 INFO L276 IsEmpty]: Start isEmpty. Operand 7209 states and 16230 transitions. [2018-12-31 21:49:27,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 21:49:27,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:27,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:27,011 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:27,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:27,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1715163703, now seen corresponding path program 1 times [2018-12-31 21:49:27,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:27,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:27,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:27,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:27,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:27,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:27,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 21:49:27,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 21:49:27,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 21:49:27,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:49:27,176 INFO L87 Difference]: Start difference. First operand 7209 states and 16230 transitions. Second operand 7 states. [2018-12-31 21:49:28,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:28,110 INFO L93 Difference]: Finished difference Result 8986 states and 20184 transitions. [2018-12-31 21:49:28,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:49:28,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-31 21:49:28,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:28,124 INFO L225 Difference]: With dead ends: 8986 [2018-12-31 21:49:28,124 INFO L226 Difference]: Without dead ends: 8986 [2018-12-31 21:49:28,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:49:28,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8986 states. [2018-12-31 21:49:28,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8986 to 7321. [2018-12-31 21:49:28,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7321 states. [2018-12-31 21:49:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 16550 transitions. [2018-12-31 21:49:28,221 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 16550 transitions. Word has length 93 [2018-12-31 21:49:28,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:28,221 INFO L480 AbstractCegarLoop]: Abstraction has 7321 states and 16550 transitions. [2018-12-31 21:49:28,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 21:49:28,221 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 16550 transitions. [2018-12-31 21:49:28,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 21:49:28,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:28,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:28,230 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:28,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:28,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1745561198, now seen corresponding path program 1 times [2018-12-31 21:49:28,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:28,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:28,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:28,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:28,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:28,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:28,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:49:28,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:49:28,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:49:28,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:49:28,439 INFO L87 Difference]: Start difference. First operand 7321 states and 16550 transitions. Second operand 5 states. [2018-12-31 21:49:28,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:28,570 INFO L93 Difference]: Finished difference Result 8130 states and 18286 transitions. [2018-12-31 21:49:28,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:49:28,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-31 21:49:28,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:28,584 INFO L225 Difference]: With dead ends: 8130 [2018-12-31 21:49:28,584 INFO L226 Difference]: Without dead ends: 8130 [2018-12-31 21:49:28,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:49:28,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8130 states. [2018-12-31 21:49:28,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8130 to 6217. [2018-12-31 21:49:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2018-12-31 21:49:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 14069 transitions. [2018-12-31 21:49:28,678 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 14069 transitions. Word has length 93 [2018-12-31 21:49:28,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:28,679 INFO L480 AbstractCegarLoop]: Abstraction has 6217 states and 14069 transitions. [2018-12-31 21:49:28,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:49:28,679 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 14069 transitions. [2018-12-31 21:49:28,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 21:49:28,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:28,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:28,687 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:28,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:28,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1490824653, now seen corresponding path program 1 times [2018-12-31 21:49:28,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:28,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:28,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:28,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:28,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:28,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:28,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:49:28,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:49:28,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:49:28,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:49:28,909 INFO L87 Difference]: Start difference. First operand 6217 states and 14069 transitions. Second operand 5 states. [2018-12-31 21:49:29,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:29,455 INFO L93 Difference]: Finished difference Result 9852 states and 22424 transitions. [2018-12-31 21:49:29,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 21:49:29,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-31 21:49:29,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:29,469 INFO L225 Difference]: With dead ends: 9852 [2018-12-31 21:49:29,470 INFO L226 Difference]: Without dead ends: 9774 [2018-12-31 21:49:29,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:49:29,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9774 states. [2018-12-31 21:49:29,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9774 to 7358. [2018-12-31 21:49:29,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7358 states. [2018-12-31 21:49:29,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7358 states to 7358 states and 16716 transitions. [2018-12-31 21:49:29,571 INFO L78 Accepts]: Start accepts. Automaton has 7358 states and 16716 transitions. Word has length 93 [2018-12-31 21:49:29,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:29,571 INFO L480 AbstractCegarLoop]: Abstraction has 7358 states and 16716 transitions. [2018-12-31 21:49:29,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:49:29,571 INFO L276 IsEmpty]: Start isEmpty. Operand 7358 states and 16716 transitions. [2018-12-31 21:49:29,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 21:49:29,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:29,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:29,580 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:29,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:29,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1559378162, now seen corresponding path program 1 times [2018-12-31 21:49:29,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:29,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:29,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:29,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:29,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:29,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:29,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:49:29,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:49:29,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:49:29,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:49:29,824 INFO L87 Difference]: Start difference. First operand 7358 states and 16716 transitions. Second operand 6 states. [2018-12-31 21:49:31,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:31,388 INFO L93 Difference]: Finished difference Result 9349 states and 21078 transitions. [2018-12-31 21:49:31,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 21:49:31,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-31 21:49:31,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:31,404 INFO L225 Difference]: With dead ends: 9349 [2018-12-31 21:49:31,404 INFO L226 Difference]: Without dead ends: 9270 [2018-12-31 21:49:31,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-31 21:49:31,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9270 states. [2018-12-31 21:49:31,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9270 to 6928. [2018-12-31 21:49:31,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6928 states. [2018-12-31 21:49:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6928 states to 6928 states and 15763 transitions. [2018-12-31 21:49:31,522 INFO L78 Accepts]: Start accepts. Automaton has 6928 states and 15763 transitions. Word has length 93 [2018-12-31 21:49:31,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:31,522 INFO L480 AbstractCegarLoop]: Abstraction has 6928 states and 15763 transitions. [2018-12-31 21:49:31,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:49:31,522 INFO L276 IsEmpty]: Start isEmpty. Operand 6928 states and 15763 transitions. [2018-12-31 21:49:31,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 21:49:31,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:31,532 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:31,532 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:31,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:31,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1497612213, now seen corresponding path program 1 times [2018-12-31 21:49:31,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:31,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:31,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:31,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:31,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:32,500 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2018-12-31 21:49:32,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:32,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:32,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 21:49:32,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 21:49:32,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 21:49:32,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:49:32,530 INFO L87 Difference]: Start difference. First operand 6928 states and 15763 transitions. Second operand 9 states. [2018-12-31 21:49:33,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:33,352 INFO L93 Difference]: Finished difference Result 9639 states and 21910 transitions. [2018-12-31 21:49:33,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-31 21:49:33,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-12-31 21:49:33,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:33,365 INFO L225 Difference]: With dead ends: 9639 [2018-12-31 21:49:33,365 INFO L226 Difference]: Without dead ends: 9639 [2018-12-31 21:49:33,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-31 21:49:33,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9639 states. [2018-12-31 21:49:33,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9639 to 8631. [2018-12-31 21:49:33,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8631 states. [2018-12-31 21:49:33,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8631 states to 8631 states and 19631 transitions. [2018-12-31 21:49:33,476 INFO L78 Accepts]: Start accepts. Automaton has 8631 states and 19631 transitions. Word has length 93 [2018-12-31 21:49:33,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:33,476 INFO L480 AbstractCegarLoop]: Abstraction has 8631 states and 19631 transitions. [2018-12-31 21:49:33,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 21:49:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 8631 states and 19631 transitions. [2018-12-31 21:49:33,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 21:49:33,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:33,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:33,488 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:33,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:33,488 INFO L82 PathProgramCache]: Analyzing trace with hash -989900620, now seen corresponding path program 1 times [2018-12-31 21:49:33,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:33,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:33,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:33,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:33,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:33,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:33,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:33,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:49:33,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:49:33,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:49:33,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:49:33,620 INFO L87 Difference]: Start difference. First operand 8631 states and 19631 transitions. Second operand 4 states. [2018-12-31 21:49:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:33,736 INFO L93 Difference]: Finished difference Result 8903 states and 20327 transitions. [2018-12-31 21:49:33,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:49:33,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-12-31 21:49:33,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:33,750 INFO L225 Difference]: With dead ends: 8903 [2018-12-31 21:49:33,750 INFO L226 Difference]: Without dead ends: 8871 [2018-12-31 21:49:33,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:49:33,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8871 states. [2018-12-31 21:49:33,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8871 to 8727. [2018-12-31 21:49:33,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8727 states. [2018-12-31 21:49:33,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8727 states to 8727 states and 19887 transitions. [2018-12-31 21:49:33,854 INFO L78 Accepts]: Start accepts. Automaton has 8727 states and 19887 transitions. Word has length 93 [2018-12-31 21:49:33,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:33,855 INFO L480 AbstractCegarLoop]: Abstraction has 8727 states and 19887 transitions. [2018-12-31 21:49:33,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:49:33,855 INFO L276 IsEmpty]: Start isEmpty. Operand 8727 states and 19887 transitions. [2018-12-31 21:49:33,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 21:49:33,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:33,865 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:33,866 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:33,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:33,866 INFO L82 PathProgramCache]: Analyzing trace with hash -299339146, now seen corresponding path program 1 times [2018-12-31 21:49:33,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:33,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:33,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:33,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:33,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:34,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:34,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 21:49:34,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 21:49:34,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 21:49:34,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:49:34,366 INFO L87 Difference]: Start difference. First operand 8727 states and 19887 transitions. Second operand 8 states. [2018-12-31 21:49:34,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:34,900 INFO L93 Difference]: Finished difference Result 13198 states and 30502 transitions. [2018-12-31 21:49:34,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 21:49:34,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-31 21:49:34,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:34,920 INFO L225 Difference]: With dead ends: 13198 [2018-12-31 21:49:34,920 INFO L226 Difference]: Without dead ends: 13198 [2018-12-31 21:49:34,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-31 21:49:34,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13198 states. [2018-12-31 21:49:35,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13198 to 9365. [2018-12-31 21:49:35,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9365 states. [2018-12-31 21:49:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9365 states to 9365 states and 21554 transitions. [2018-12-31 21:49:35,124 INFO L78 Accepts]: Start accepts. Automaton has 9365 states and 21554 transitions. Word has length 93 [2018-12-31 21:49:35,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:35,124 INFO L480 AbstractCegarLoop]: Abstraction has 9365 states and 21554 transitions. [2018-12-31 21:49:35,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 21:49:35,124 INFO L276 IsEmpty]: Start isEmpty. Operand 9365 states and 21554 transitions. [2018-12-31 21:49:35,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 21:49:35,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:35,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:35,137 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:35,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:35,137 INFO L82 PathProgramCache]: Analyzing trace with hash 588164535, now seen corresponding path program 1 times [2018-12-31 21:49:35,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:35,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:35,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:35,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:35,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:35,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:35,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:35,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:49:35,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:49:35,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:49:35,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:49:35,256 INFO L87 Difference]: Start difference. First operand 9365 states and 21554 transitions. Second operand 3 states. [2018-12-31 21:49:35,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:35,343 INFO L93 Difference]: Finished difference Result 9013 states and 20482 transitions. [2018-12-31 21:49:35,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:49:35,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2018-12-31 21:49:35,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:35,357 INFO L225 Difference]: With dead ends: 9013 [2018-12-31 21:49:35,357 INFO L226 Difference]: Without dead ends: 8981 [2018-12-31 21:49:35,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:49:35,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8981 states. [2018-12-31 21:49:35,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8981 to 7523. [2018-12-31 21:49:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7523 states. [2018-12-31 21:49:35,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7523 states to 7523 states and 17031 transitions. [2018-12-31 21:49:35,447 INFO L78 Accepts]: Start accepts. Automaton has 7523 states and 17031 transitions. Word has length 93 [2018-12-31 21:49:35,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:35,448 INFO L480 AbstractCegarLoop]: Abstraction has 7523 states and 17031 transitions. [2018-12-31 21:49:35,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:49:35,448 INFO L276 IsEmpty]: Start isEmpty. Operand 7523 states and 17031 transitions. [2018-12-31 21:49:35,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 21:49:35,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:35,458 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:35,458 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:35,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:35,459 INFO L82 PathProgramCache]: Analyzing trace with hash -360597677, now seen corresponding path program 1 times [2018-12-31 21:49:35,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:35,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:35,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:35,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:35,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:35,939 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 21:49:36,171 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 21:49:36,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:36,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:36,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 21:49:36,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 21:49:36,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 21:49:36,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-31 21:49:36,535 INFO L87 Difference]: Start difference. First operand 7523 states and 17031 transitions. Second operand 11 states. [2018-12-31 21:49:38,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:38,287 INFO L93 Difference]: Finished difference Result 10123 states and 22667 transitions. [2018-12-31 21:49:38,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-31 21:49:38,289 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-31 21:49:38,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:38,302 INFO L225 Difference]: With dead ends: 10123 [2018-12-31 21:49:38,302 INFO L226 Difference]: Without dead ends: 10123 [2018-12-31 21:49:38,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2018-12-31 21:49:38,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10123 states. [2018-12-31 21:49:38,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10123 to 8899. [2018-12-31 21:49:38,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8899 states. [2018-12-31 21:49:38,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8899 states to 8899 states and 20022 transitions. [2018-12-31 21:49:38,419 INFO L78 Accepts]: Start accepts. Automaton has 8899 states and 20022 transitions. Word has length 95 [2018-12-31 21:49:38,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:38,419 INFO L480 AbstractCegarLoop]: Abstraction has 8899 states and 20022 transitions. [2018-12-31 21:49:38,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 21:49:38,419 INFO L276 IsEmpty]: Start isEmpty. Operand 8899 states and 20022 transitions. [2018-12-31 21:49:38,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 21:49:38,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:38,430 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:38,430 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:38,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:38,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1550303339, now seen corresponding path program 1 times [2018-12-31 21:49:38,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:38,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:38,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:38,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:38,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:38,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:38,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:38,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 21:49:38,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 21:49:38,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 21:49:38,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:49:38,907 INFO L87 Difference]: Start difference. First operand 8899 states and 20022 transitions. Second operand 9 states. [2018-12-31 21:49:39,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:39,694 INFO L93 Difference]: Finished difference Result 11077 states and 24615 transitions. [2018-12-31 21:49:39,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 21:49:39,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-12-31 21:49:39,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:39,710 INFO L225 Difference]: With dead ends: 11077 [2018-12-31 21:49:39,710 INFO L226 Difference]: Without dead ends: 11077 [2018-12-31 21:49:39,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-12-31 21:49:39,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11077 states. [2018-12-31 21:49:39,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11077 to 9328. [2018-12-31 21:49:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9328 states. [2018-12-31 21:49:39,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9328 states to 9328 states and 20940 transitions. [2018-12-31 21:49:39,833 INFO L78 Accepts]: Start accepts. Automaton has 9328 states and 20940 transitions. Word has length 95 [2018-12-31 21:49:39,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:39,833 INFO L480 AbstractCegarLoop]: Abstraction has 9328 states and 20940 transitions. [2018-12-31 21:49:39,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 21:49:39,833 INFO L276 IsEmpty]: Start isEmpty. Operand 9328 states and 20940 transitions. [2018-12-31 21:49:39,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 21:49:39,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:39,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:39,845 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:39,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:39,845 INFO L82 PathProgramCache]: Analyzing trace with hash 2068511189, now seen corresponding path program 1 times [2018-12-31 21:49:39,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:39,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:39,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:39,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:39,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:40,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:40,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 21:49:40,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 21:49:40,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 21:49:40,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:49:40,123 INFO L87 Difference]: Start difference. First operand 9328 states and 20940 transitions. Second operand 9 states. [2018-12-31 21:49:40,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:40,702 INFO L93 Difference]: Finished difference Result 10252 states and 22965 transitions. [2018-12-31 21:49:40,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-31 21:49:40,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-12-31 21:49:40,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:40,717 INFO L225 Difference]: With dead ends: 10252 [2018-12-31 21:49:40,717 INFO L226 Difference]: Without dead ends: 10252 [2018-12-31 21:49:40,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-12-31 21:49:40,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10252 states. [2018-12-31 21:49:40,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10252 to 7051. [2018-12-31 21:49:40,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7051 states. [2018-12-31 21:49:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7051 states to 7051 states and 15813 transitions. [2018-12-31 21:49:40,825 INFO L78 Accepts]: Start accepts. Automaton has 7051 states and 15813 transitions. Word has length 95 [2018-12-31 21:49:40,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:40,825 INFO L480 AbstractCegarLoop]: Abstraction has 7051 states and 15813 transitions. [2018-12-31 21:49:40,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 21:49:40,825 INFO L276 IsEmpty]: Start isEmpty. Operand 7051 states and 15813 transitions. [2018-12-31 21:49:40,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 21:49:40,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:40,834 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:40,834 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:40,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:40,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1338952426, now seen corresponding path program 1 times [2018-12-31 21:49:40,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:40,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:40,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:40,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:40,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:41,117 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 21:49:41,298 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 21:49:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:41,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:41,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 21:49:41,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 21:49:41,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 21:49:41,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 21:49:41,460 INFO L87 Difference]: Start difference. First operand 7051 states and 15813 transitions. Second operand 11 states. [2018-12-31 21:49:43,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:43,298 INFO L93 Difference]: Finished difference Result 13327 states and 30077 transitions. [2018-12-31 21:49:43,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 21:49:43,299 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-31 21:49:43,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:43,312 INFO L225 Difference]: With dead ends: 13327 [2018-12-31 21:49:43,312 INFO L226 Difference]: Without dead ends: 9210 [2018-12-31 21:49:43,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-31 21:49:43,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9210 states. [2018-12-31 21:49:43,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9210 to 6887. [2018-12-31 21:49:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6887 states. [2018-12-31 21:49:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6887 states to 6887 states and 15403 transitions. [2018-12-31 21:49:43,412 INFO L78 Accepts]: Start accepts. Automaton has 6887 states and 15403 transitions. Word has length 95 [2018-12-31 21:49:43,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:43,413 INFO L480 AbstractCegarLoop]: Abstraction has 6887 states and 15403 transitions. [2018-12-31 21:49:43,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 21:49:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 6887 states and 15403 transitions. [2018-12-31 21:49:43,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 21:49:43,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:43,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:43,422 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:43,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:43,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1071746382, now seen corresponding path program 1 times [2018-12-31 21:49:43,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:43,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:43,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:43,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:43,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:43,865 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 21:49:44,300 WARN L181 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-12-31 21:49:44,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:44,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:44,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:49:44,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:49:44,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:49:44,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:49:44,314 INFO L87 Difference]: Start difference. First operand 6887 states and 15403 transitions. Second operand 6 states. [2018-12-31 21:49:44,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:44,500 INFO L93 Difference]: Finished difference Result 7785 states and 17167 transitions. [2018-12-31 21:49:44,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:49:44,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-31 21:49:44,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:44,510 INFO L225 Difference]: With dead ends: 7785 [2018-12-31 21:49:44,510 INFO L226 Difference]: Without dead ends: 7728 [2018-12-31 21:49:44,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:49:44,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7728 states. [2018-12-31 21:49:44,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7728 to 6910. [2018-12-31 21:49:44,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6910 states. [2018-12-31 21:49:44,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6910 states to 6910 states and 15291 transitions. [2018-12-31 21:49:44,588 INFO L78 Accepts]: Start accepts. Automaton has 6910 states and 15291 transitions. Word has length 95 [2018-12-31 21:49:44,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:44,588 INFO L480 AbstractCegarLoop]: Abstraction has 6910 states and 15291 transitions. [2018-12-31 21:49:44,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:49:44,588 INFO L276 IsEmpty]: Start isEmpty. Operand 6910 states and 15291 transitions. [2018-12-31 21:49:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 21:49:44,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:44,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:44,596 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:44,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:44,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1408217134, now seen corresponding path program 2 times [2018-12-31 21:49:44,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:44,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:44,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:44,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:44,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:45,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:45,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 21:49:45,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 21:49:45,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 21:49:45,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:49:45,256 INFO L87 Difference]: Start difference. First operand 6910 states and 15291 transitions. Second operand 7 states. [2018-12-31 21:49:46,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:46,061 INFO L93 Difference]: Finished difference Result 9182 states and 19987 transitions. [2018-12-31 21:49:46,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 21:49:46,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-31 21:49:46,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:46,074 INFO L225 Difference]: With dead ends: 9182 [2018-12-31 21:49:46,075 INFO L226 Difference]: Without dead ends: 9182 [2018-12-31 21:49:46,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-12-31 21:49:46,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9182 states. [2018-12-31 21:49:46,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9182 to 7505. [2018-12-31 21:49:46,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7505 states. [2018-12-31 21:49:46,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7505 states to 7505 states and 16598 transitions. [2018-12-31 21:49:46,189 INFO L78 Accepts]: Start accepts. Automaton has 7505 states and 16598 transitions. Word has length 95 [2018-12-31 21:49:46,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:46,190 INFO L480 AbstractCegarLoop]: Abstraction has 7505 states and 16598 transitions. [2018-12-31 21:49:46,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 21:49:46,190 INFO L276 IsEmpty]: Start isEmpty. Operand 7505 states and 16598 transitions. [2018-12-31 21:49:46,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 21:49:46,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:46,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:46,200 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:46,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:46,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1196866221, now seen corresponding path program 1 times [2018-12-31 21:49:46,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:46,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:46,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:46,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 21:49:46,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:46,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:46,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:49:46,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:49:46,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:49:46,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:49:46,345 INFO L87 Difference]: Start difference. First operand 7505 states and 16598 transitions. Second operand 6 states. [2018-12-31 21:49:46,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:46,574 INFO L93 Difference]: Finished difference Result 7753 states and 17098 transitions. [2018-12-31 21:49:46,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 21:49:46,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-31 21:49:46,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:46,586 INFO L225 Difference]: With dead ends: 7753 [2018-12-31 21:49:46,587 INFO L226 Difference]: Without dead ends: 7753 [2018-12-31 21:49:46,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:49:46,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7753 states. [2018-12-31 21:49:46,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7753 to 7382. [2018-12-31 21:49:46,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7382 states. [2018-12-31 21:49:46,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7382 states to 7382 states and 16327 transitions. [2018-12-31 21:49:46,682 INFO L78 Accepts]: Start accepts. Automaton has 7382 states and 16327 transitions. Word has length 95 [2018-12-31 21:49:46,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:46,683 INFO L480 AbstractCegarLoop]: Abstraction has 7382 states and 16327 transitions. [2018-12-31 21:49:46,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:49:46,683 INFO L276 IsEmpty]: Start isEmpty. Operand 7382 states and 16327 transitions. [2018-12-31 21:49:46,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 21:49:46,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:46,692 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:46,693 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:46,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:46,693 INFO L82 PathProgramCache]: Analyzing trace with hash -741980621, now seen corresponding path program 2 times [2018-12-31 21:49:46,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:46,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:46,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:46,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:49:46,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:49:46,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:49:46,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:49:46,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 21:49:46,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 21:49:46,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 21:49:46,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:49:46,916 INFO L87 Difference]: Start difference. First operand 7382 states and 16327 transitions. Second operand 7 states. [2018-12-31 21:49:47,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:49:47,146 INFO L93 Difference]: Finished difference Result 9227 states and 20407 transitions. [2018-12-31 21:49:47,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:49:47,147 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-31 21:49:47,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:49:47,159 INFO L225 Difference]: With dead ends: 9227 [2018-12-31 21:49:47,159 INFO L226 Difference]: Without dead ends: 9227 [2018-12-31 21:49:47,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-31 21:49:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9227 states. [2018-12-31 21:49:47,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9227 to 6593. [2018-12-31 21:49:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6593 states. [2018-12-31 21:49:47,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6593 states to 6593 states and 14493 transitions. [2018-12-31 21:49:47,262 INFO L78 Accepts]: Start accepts. Automaton has 6593 states and 14493 transitions. Word has length 95 [2018-12-31 21:49:47,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:49:47,263 INFO L480 AbstractCegarLoop]: Abstraction has 6593 states and 14493 transitions. [2018-12-31 21:49:47,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 21:49:47,263 INFO L276 IsEmpty]: Start isEmpty. Operand 6593 states and 14493 transitions. [2018-12-31 21:49:47,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 21:49:47,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:49:47,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:49:47,272 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:49:47,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:49:47,272 INFO L82 PathProgramCache]: Analyzing trace with hash -530629708, now seen corresponding path program 2 times [2018-12-31 21:49:47,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:49:47,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:49:47,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:47,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 21:49:47,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:49:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 21:49:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 21:49:47,392 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 21:49:47,650 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 21:49:47,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:49:47 BasicIcfg [2018-12-31 21:49:47,652 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 21:49:47,653 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 21:49:47,653 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 21:49:47,653 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 21:49:47,657 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:48:59" (3/4) ... [2018-12-31 21:49:47,661 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 21:49:47,931 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 21:49:47,935 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 21:49:47,937 INFO L168 Benchmark]: Toolchain (without parser) took 50780.75 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 948.7 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-12-31 21:49:47,937 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 21:49:47,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 818.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -140.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-31 21:49:47,938 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-31 21:49:47,940 INFO L168 Benchmark]: Boogie Preprocessor took 69.15 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 21:49:47,940 INFO L168 Benchmark]: RCFGBuilder took 1288.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2018-12-31 21:49:47,943 INFO L168 Benchmark]: TraceAbstraction took 48239.60 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 630.1 MB in the end (delta: 400.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-12-31 21:49:47,943 INFO L168 Benchmark]: Witness Printer took 281.71 ms. Allocated memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 49.3 MB). Free memory was 630.1 MB in the beginning and 2.5 GB in the end (delta: -1.9 GB). Peak memory consumption was 531.8 kB. Max. memory is 11.5 GB. [2018-12-31 21:49:47,947 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 818.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -140.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.15 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1288.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 48239.60 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 630.1 MB in the end (delta: 400.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 281.71 ms. Allocated memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 49.3 MB). Free memory was 630.1 MB in the beginning and 2.5 GB in the end (delta: -1.9 GB). Peak memory consumption was 531.8 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] -1 pthread_t t1291; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] FCALL, FORK -1 pthread_create(&t1291, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L701] 0 y$w_buff1 = y$w_buff0 [L702] 0 y$w_buff0 = 1 [L703] 0 y$w_buff1_used = y$w_buff0_used [L704] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] -1 pthread_t t1292; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] FCALL, FORK -1 pthread_create(&t1292, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L707] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L708] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L709] 0 y$r_buff0_thd1 = (_Bool)1 [L712] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] 1 y = y$flush_delayed ? y$mem_tmp : y [L745] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L780] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L781] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L783] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L786] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 48.0s OverallTime, 35 OverallIterations, 1 TraceHistogramMax, 25.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8637 SDtfs, 9803 SDslu, 22458 SDs, 0 SdLazy, 10420 SolverSat, 491 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 398 GetRequests, 94 SyntacticMatches, 43 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34806occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.5s AutomataMinimizationTime, 34 MinimizatonAttempts, 79310 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 2727 NumberOfCodeBlocks, 2727 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2598 ConstructedInterpolants, 0 QuantifiedInterpolants, 627355 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...