./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix031_pso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix031_pso.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 6024798e59ce0f0a3cb69b9d88eac58b24078872 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 19:58:58,112 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 19:58:58,114 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 19:58:58,135 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 19:58:58,136 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 19:58:58,138 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 19:58:58,142 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 19:58:58,146 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 19:58:58,152 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 19:58:58,153 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 19:58:58,154 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 19:58:58,154 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 19:58:58,157 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 19:58:58,161 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 19:58:58,164 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 19:58:58,166 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 19:58:58,167 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 19:58:58,172 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 19:58:58,177 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 19:58:58,179 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 19:58:58,183 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 19:58:58,186 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 19:58:58,191 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 19:58:58,194 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 19:58:58,195 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 19:58:58,197 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 19:58:58,197 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 19:58:58,201 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 19:58:58,202 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 19:58:58,206 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 19:58:58,206 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 19:58:58,207 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 19:58:58,208 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 19:58:58,209 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 19:58:58,211 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 19:58:58,213 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 19:58:58,213 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 19:58:58,229 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 19:58:58,229 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 19:58:58,230 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 19:58:58,230 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 19:58:58,232 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 19:58:58,232 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 19:58:58,232 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 19:58:58,232 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 19:58:58,232 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 19:58:58,233 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 19:58:58,233 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 19:58:58,233 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 19:58:58,234 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 19:58:58,234 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 19:58:58,234 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 19:58:58,234 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 19:58:58,234 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 19:58:58,235 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 19:58:58,235 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 19:58:58,235 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 19:58:58,235 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 19:58:58,235 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 19:58:58,235 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 19:58:58,237 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 19:58:58,238 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 19:58:58,238 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 19:58:58,238 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 19:58:58,238 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 19:58:58,238 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 19:58:58,238 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 19:58:58,240 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 -> 6024798e59ce0f0a3cb69b9d88eac58b24078872 [2018-11-28 19:58:58,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 19:58:58,301 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 19:58:58,309 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 19:58:58,311 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 19:58:58,311 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 19:58:58,312 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix031_pso.oepc_false-unreach-call.i [2018-11-28 19:58:58,385 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/932d56443/7238ac9538fc490982a85f8a07474af6/FLAG29f2beec0 [2018-11-28 19:58:58,992 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 19:58:58,993 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix031_pso.oepc_false-unreach-call.i [2018-11-28 19:58:59,024 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/932d56443/7238ac9538fc490982a85f8a07474af6/FLAG29f2beec0 [2018-11-28 19:58:59,230 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/932d56443/7238ac9538fc490982a85f8a07474af6 [2018-11-28 19:58:59,233 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 19:58:59,234 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 19:58:59,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 19:58:59,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 19:58:59,239 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 19:58:59,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:58:59" (1/1) ... [2018-11-28 19:58:59,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e1a52d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:58:59, skipping insertion in model container [2018-11-28 19:58:59,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:58:59" (1/1) ... [2018-11-28 19:58:59,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 19:58:59,319 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 19:58:59,836 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 19:58:59,864 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 19:59:00,013 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 19:59:00,105 INFO L195 MainTranslator]: Completed translation [2018-11-28 19:59:00,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00 WrapperNode [2018-11-28 19:59:00,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 19:59:00,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 19:59:00,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 19:59:00,107 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 19:59:00,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00" (1/1) ... [2018-11-28 19:59:00,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00" (1/1) ... [2018-11-28 19:59:00,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 19:59:00,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 19:59:00,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 19:59:00,183 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 19:59:00,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00" (1/1) ... [2018-11-28 19:59:00,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00" (1/1) ... [2018-11-28 19:59:00,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00" (1/1) ... [2018-11-28 19:59:00,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00" (1/1) ... [2018-11-28 19:59:00,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00" (1/1) ... [2018-11-28 19:59:00,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00" (1/1) ... [2018-11-28 19:59:00,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00" (1/1) ... [2018-11-28 19:59:00,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 19:59:00,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 19:59:00,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 19:59:00,227 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 19:59:00,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 19:59:00,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 19:59:00,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 19:59:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 19:59:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 19:59:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 19:59:00,301 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 19:59:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 19:59:00,301 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 19:59:00,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 19:59:00,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 19:59:00,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 19:59:00,305 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 19:59:01,495 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 19:59:01,496 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 19:59:01,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:59:01 BoogieIcfgContainer [2018-11-28 19:59:01,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 19:59:01,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 19:59:01,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 19:59:01,503 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 19:59:01,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 07:58:59" (1/3) ... [2018-11-28 19:59:01,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4ab830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:59:01, skipping insertion in model container [2018-11-28 19:59:01,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00" (2/3) ... [2018-11-28 19:59:01,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4ab830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:59:01, skipping insertion in model container [2018-11-28 19:59:01,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:59:01" (3/3) ... [2018-11-28 19:59:01,508 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031_pso.oepc_false-unreach-call.i [2018-11-28 19:59:01,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,555 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,556 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,556 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,557 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,558 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,558 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,559 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,562 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,570 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,571 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,571 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,571 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,571 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,571 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,572 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,572 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,572 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,572 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,572 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,572 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,583 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,583 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,583 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,583 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,583 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,585 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,585 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,585 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,585 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,586 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,587 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,587 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,587 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,587 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,588 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,589 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,589 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,589 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,589 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,589 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,590 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,591 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,591 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,591 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,591 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,602 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,602 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,602 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,602 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,602 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,604 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,605 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,606 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,607 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,610 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,610 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,610 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,613 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,613 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,614 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,614 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,614 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,614 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,645 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 19:59:01,645 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 19:59:01,658 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 19:59:01,675 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 19:59:01,701 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 19:59:01,702 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 19:59:01,702 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 19:59:01,702 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 19:59:01,702 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 19:59:01,702 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 19:59:01,702 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 19:59:01,703 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 19:59:01,703 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 19:59:01,718 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146places, 184 transitions [2018-11-28 19:59:04,057 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34810 states. [2018-11-28 19:59:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 34810 states. [2018-11-28 19:59:04,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 19:59:04,067 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:04,068 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] [2018-11-28 19:59:04,071 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:04,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:04,078 INFO L82 PathProgramCache]: Analyzing trace with hash 148401709, now seen corresponding path program 1 times [2018-11-28 19:59:04,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:04,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:04,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:04,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:04,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:04,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:04,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:59:04,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:59:04,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:59:04,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:59:04,442 INFO L87 Difference]: Start difference. First operand 34810 states. Second operand 4 states. [2018-11-28 19:59:05,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:05,960 INFO L93 Difference]: Finished difference Result 60794 states and 234497 transitions. [2018-11-28 19:59:05,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:59:05,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-28 19:59:05,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:06,335 INFO L225 Difference]: With dead ends: 60794 [2018-11-28 19:59:06,336 INFO L226 Difference]: Without dead ends: 44274 [2018-11-28 19:59:06,338 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-11-28 19:59:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44274 states. [2018-11-28 19:59:07,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44274 to 27342. [2018-11-28 19:59:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27342 states. [2018-11-28 19:59:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27342 states to 27342 states and 105503 transitions. [2018-11-28 19:59:08,130 INFO L78 Accepts]: Start accepts. Automaton has 27342 states and 105503 transitions. Word has length 37 [2018-11-28 19:59:08,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:08,131 INFO L480 AbstractCegarLoop]: Abstraction has 27342 states and 105503 transitions. [2018-11-28 19:59:08,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:59:08,131 INFO L276 IsEmpty]: Start isEmpty. Operand 27342 states and 105503 transitions. [2018-11-28 19:59:08,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 19:59:08,142 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:08,142 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] [2018-11-28 19:59:08,142 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:08,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:08,144 INFO L82 PathProgramCache]: Analyzing trace with hash -54930118, now seen corresponding path program 1 times [2018-11-28 19:59:08,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:08,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:08,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:08,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:08,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:08,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:08,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:59:08,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:59:08,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:59:08,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:59:08,377 INFO L87 Difference]: Start difference. First operand 27342 states and 105503 transitions. Second operand 4 states. [2018-11-28 19:59:08,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:08,785 INFO L93 Difference]: Finished difference Result 8532 states and 28348 transitions. [2018-11-28 19:59:08,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 19:59:08,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-28 19:59:08,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:08,816 INFO L225 Difference]: With dead ends: 8532 [2018-11-28 19:59:08,816 INFO L226 Difference]: Without dead ends: 7470 [2018-11-28 19:59:08,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:59:08,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2018-11-28 19:59:08,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 7470. [2018-11-28 19:59:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7470 states. [2018-11-28 19:59:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7470 states to 7470 states and 24640 transitions. [2018-11-28 19:59:09,055 INFO L78 Accepts]: Start accepts. Automaton has 7470 states and 24640 transitions. Word has length 49 [2018-11-28 19:59:09,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:09,056 INFO L480 AbstractCegarLoop]: Abstraction has 7470 states and 24640 transitions. [2018-11-28 19:59:09,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:59:09,056 INFO L276 IsEmpty]: Start isEmpty. Operand 7470 states and 24640 transitions. [2018-11-28 19:59:09,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 19:59:09,058 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:09,060 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] [2018-11-28 19:59:09,060 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:09,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:09,060 INFO L82 PathProgramCache]: Analyzing trace with hash -790300171, now seen corresponding path program 1 times [2018-11-28 19:59:09,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:09,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:09,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:09,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:09,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:09,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:09,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:59:09,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:59:09,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:59:09,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:59:09,410 INFO L87 Difference]: Start difference. First operand 7470 states and 24640 transitions. Second operand 5 states. [2018-11-28 19:59:10,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:10,867 INFO L93 Difference]: Finished difference Result 14002 states and 45809 transitions. [2018-11-28 19:59:10,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:59:10,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-28 19:59:10,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:10,920 INFO L225 Difference]: With dead ends: 14002 [2018-11-28 19:59:10,921 INFO L226 Difference]: Without dead ends: 13934 [2018-11-28 19:59:10,921 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-11-28 19:59:11,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13934 states. [2018-11-28 19:59:11,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13934 to 9445. [2018-11-28 19:59:11,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9445 states. [2018-11-28 19:59:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9445 states to 9445 states and 30546 transitions. [2018-11-28 19:59:11,242 INFO L78 Accepts]: Start accepts. Automaton has 9445 states and 30546 transitions. Word has length 50 [2018-11-28 19:59:11,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:11,243 INFO L480 AbstractCegarLoop]: Abstraction has 9445 states and 30546 transitions. [2018-11-28 19:59:11,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:59:11,245 INFO L276 IsEmpty]: Start isEmpty. Operand 9445 states and 30546 transitions. [2018-11-28 19:59:11,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 19:59:11,248 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:11,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:11,248 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:11,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:11,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1702931131, now seen corresponding path program 1 times [2018-11-28 19:59:11,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:11,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:11,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:11,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:11,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:11,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:11,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:59:11,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:59:11,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:59:11,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:59:11,365 INFO L87 Difference]: Start difference. First operand 9445 states and 30546 transitions. Second operand 3 states. [2018-11-28 19:59:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:11,874 INFO L93 Difference]: Finished difference Result 13283 states and 42645 transitions. [2018-11-28 19:59:11,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:59:11,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-28 19:59:11,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:11,912 INFO L225 Difference]: With dead ends: 13283 [2018-11-28 19:59:11,912 INFO L226 Difference]: Without dead ends: 13283 [2018-11-28 19:59:11,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:59:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13283 states. [2018-11-28 19:59:12,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13283 to 9849. [2018-11-28 19:59:12,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9849 states. [2018-11-28 19:59:12,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9849 states to 9849 states and 31512 transitions. [2018-11-28 19:59:12,169 INFO L78 Accepts]: Start accepts. Automaton has 9849 states and 31512 transitions. Word has length 52 [2018-11-28 19:59:12,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:12,170 INFO L480 AbstractCegarLoop]: Abstraction has 9849 states and 31512 transitions. [2018-11-28 19:59:12,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:59:12,170 INFO L276 IsEmpty]: Start isEmpty. Operand 9849 states and 31512 transitions. [2018-11-28 19:59:12,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 19:59:12,172 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:12,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:12,173 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:12,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:12,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1252831162, now seen corresponding path program 1 times [2018-11-28 19:59:12,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:12,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:12,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:12,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:12,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:12,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:12,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:59:12,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:59:12,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:59:12,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:59:12,565 INFO L87 Difference]: Start difference. First operand 9849 states and 31512 transitions. Second operand 6 states. [2018-11-28 19:59:13,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:13,394 INFO L93 Difference]: Finished difference Result 14207 states and 45068 transitions. [2018-11-28 19:59:13,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 19:59:13,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-11-28 19:59:13,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:13,428 INFO L225 Difference]: With dead ends: 14207 [2018-11-28 19:59:13,428 INFO L226 Difference]: Without dead ends: 14135 [2018-11-28 19:59:13,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-28 19:59:13,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14135 states. [2018-11-28 19:59:13,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14135 to 10853. [2018-11-28 19:59:13,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10853 states. [2018-11-28 19:59:13,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10853 states to 10853 states and 34567 transitions. [2018-11-28 19:59:13,701 INFO L78 Accepts]: Start accepts. Automaton has 10853 states and 34567 transitions. Word has length 56 [2018-11-28 19:59:13,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:13,701 INFO L480 AbstractCegarLoop]: Abstraction has 10853 states and 34567 transitions. [2018-11-28 19:59:13,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:59:13,702 INFO L276 IsEmpty]: Start isEmpty. Operand 10853 states and 34567 transitions. [2018-11-28 19:59:13,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 19:59:13,708 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:13,708 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-11-28 19:59:13,708 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:13,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:13,709 INFO L82 PathProgramCache]: Analyzing trace with hash -575191646, now seen corresponding path program 1 times [2018-11-28 19:59:13,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:13,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:13,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:13,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:13,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:13,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:13,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:59:13,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:59:13,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:59:13,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:59:13,928 INFO L87 Difference]: Start difference. First operand 10853 states and 34567 transitions. Second operand 4 states. [2018-11-28 19:59:14,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:14,159 INFO L93 Difference]: Finished difference Result 12400 states and 39576 transitions. [2018-11-28 19:59:14,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 19:59:14,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-28 19:59:14,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:14,188 INFO L225 Difference]: With dead ends: 12400 [2018-11-28 19:59:14,188 INFO L226 Difference]: Without dead ends: 12400 [2018-11-28 19:59:14,188 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-11-28 19:59:14,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12400 states. [2018-11-28 19:59:14,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12400 to 11373. [2018-11-28 19:59:14,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11373 states. [2018-11-28 19:59:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11373 states to 11373 states and 36240 transitions. [2018-11-28 19:59:14,433 INFO L78 Accepts]: Start accepts. Automaton has 11373 states and 36240 transitions. Word has length 64 [2018-11-28 19:59:14,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:14,434 INFO L480 AbstractCegarLoop]: Abstraction has 11373 states and 36240 transitions. [2018-11-28 19:59:14,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:59:14,434 INFO L276 IsEmpty]: Start isEmpty. Operand 11373 states and 36240 transitions. [2018-11-28 19:59:14,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 19:59:14,440 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:14,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:14,441 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:14,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:14,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1167618689, now seen corresponding path program 1 times [2018-11-28 19:59:14,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:14,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:14,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:14,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:14,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:14,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:14,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:59:14,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:59:14,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:59:14,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:59:14,649 INFO L87 Difference]: Start difference. First operand 11373 states and 36240 transitions. Second operand 6 states. [2018-11-28 19:59:15,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:15,466 INFO L93 Difference]: Finished difference Result 20973 states and 66490 transitions. [2018-11-28 19:59:15,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 19:59:15,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-28 19:59:15,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:15,510 INFO L225 Difference]: With dead ends: 20973 [2018-11-28 19:59:15,510 INFO L226 Difference]: Without dead ends: 20902 [2018-11-28 19:59:15,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 19:59:15,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20902 states. [2018-11-28 19:59:16,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20902 to 13759. [2018-11-28 19:59:16,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13759 states. [2018-11-28 19:59:16,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13759 states to 13759 states and 43284 transitions. [2018-11-28 19:59:16,296 INFO L78 Accepts]: Start accepts. Automaton has 13759 states and 43284 transitions. Word has length 64 [2018-11-28 19:59:16,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:16,296 INFO L480 AbstractCegarLoop]: Abstraction has 13759 states and 43284 transitions. [2018-11-28 19:59:16,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:59:16,296 INFO L276 IsEmpty]: Start isEmpty. Operand 13759 states and 43284 transitions. [2018-11-28 19:59:16,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 19:59:16,317 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:16,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:16,318 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:16,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:16,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1129581006, now seen corresponding path program 1 times [2018-11-28 19:59:16,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:16,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:16,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:16,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:16,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:16,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:16,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:59:16,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:59:16,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:59:16,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:59:16,612 INFO L87 Difference]: Start difference. First operand 13759 states and 43284 transitions. Second operand 4 states. [2018-11-28 19:59:17,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:17,191 INFO L93 Difference]: Finished difference Result 17639 states and 54589 transitions. [2018-11-28 19:59:17,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:59:17,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-11-28 19:59:17,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:17,222 INFO L225 Difference]: With dead ends: 17639 [2018-11-28 19:59:17,222 INFO L226 Difference]: Without dead ends: 17639 [2018-11-28 19:59:17,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:59:17,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17639 states. [2018-11-28 19:59:17,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17639 to 15797. [2018-11-28 19:59:17,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15797 states. [2018-11-28 19:59:17,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15797 states to 15797 states and 49135 transitions. [2018-11-28 19:59:17,489 INFO L78 Accepts]: Start accepts. Automaton has 15797 states and 49135 transitions. Word has length 68 [2018-11-28 19:59:17,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:17,490 INFO L480 AbstractCegarLoop]: Abstraction has 15797 states and 49135 transitions. [2018-11-28 19:59:17,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:59:17,490 INFO L276 IsEmpty]: Start isEmpty. Operand 15797 states and 49135 transitions. [2018-11-28 19:59:17,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 19:59:17,501 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:17,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:17,502 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:17,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:17,502 INFO L82 PathProgramCache]: Analyzing trace with hash -947628337, now seen corresponding path program 1 times [2018-11-28 19:59:17,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:17,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:17,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:17,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:17,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:17,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:17,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:59:17,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:59:17,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:59:17,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:59:17,639 INFO L87 Difference]: Start difference. First operand 15797 states and 49135 transitions. Second operand 3 states. [2018-11-28 19:59:17,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:17,939 INFO L93 Difference]: Finished difference Result 16389 states and 50742 transitions. [2018-11-28 19:59:17,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:59:17,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-11-28 19:59:17,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:17,971 INFO L225 Difference]: With dead ends: 16389 [2018-11-28 19:59:17,972 INFO L226 Difference]: Without dead ends: 16389 [2018-11-28 19:59:17,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:59:18,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16389 states. [2018-11-28 19:59:18,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16389 to 16113. [2018-11-28 19:59:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16113 states. [2018-11-28 19:59:18,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16113 states to 16113 states and 49985 transitions. [2018-11-28 19:59:18,225 INFO L78 Accepts]: Start accepts. Automaton has 16113 states and 49985 transitions. Word has length 68 [2018-11-28 19:59:18,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:18,225 INFO L480 AbstractCegarLoop]: Abstraction has 16113 states and 49985 transitions. [2018-11-28 19:59:18,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:59:18,225 INFO L276 IsEmpty]: Start isEmpty. Operand 16113 states and 49985 transitions. [2018-11-28 19:59:18,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 19:59:18,239 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:18,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:18,239 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:18,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:18,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1412859306, now seen corresponding path program 1 times [2018-11-28 19:59:18,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:18,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:18,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:18,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:18,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:18,425 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-28 19:59:18,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:18,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:18,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:59:18,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:59:18,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:59:18,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:59:18,630 INFO L87 Difference]: Start difference. First operand 16113 states and 49985 transitions. Second operand 6 states. [2018-11-28 19:59:20,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:20,033 INFO L93 Difference]: Finished difference Result 19825 states and 60441 transitions. [2018-11-28 19:59:20,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:59:20,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-11-28 19:59:20,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:20,065 INFO L225 Difference]: With dead ends: 19825 [2018-11-28 19:59:20,065 INFO L226 Difference]: Without dead ends: 19825 [2018-11-28 19:59:20,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:59:20,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19825 states. [2018-11-28 19:59:20,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19825 to 18621. [2018-11-28 19:59:20,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18621 states. [2018-11-28 19:59:20,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18621 states to 18621 states and 57221 transitions. [2018-11-28 19:59:20,672 INFO L78 Accepts]: Start accepts. Automaton has 18621 states and 57221 transitions. Word has length 70 [2018-11-28 19:59:20,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:20,673 INFO L480 AbstractCegarLoop]: Abstraction has 18621 states and 57221 transitions. [2018-11-28 19:59:20,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:59:20,673 INFO L276 IsEmpty]: Start isEmpty. Operand 18621 states and 57221 transitions. [2018-11-28 19:59:20,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 19:59:20,685 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:20,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:20,685 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:20,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:20,687 INFO L82 PathProgramCache]: Analyzing trace with hash 804898647, now seen corresponding path program 1 times [2018-11-28 19:59:20,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:20,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:20,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:20,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:20,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:20,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:20,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:20,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:59:20,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:59:20,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:59:20,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:59:20,886 INFO L87 Difference]: Start difference. First operand 18621 states and 57221 transitions. Second operand 5 states. [2018-11-28 19:59:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:21,422 INFO L93 Difference]: Finished difference Result 24184 states and 73726 transitions. [2018-11-28 19:59:21,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:59:21,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-11-28 19:59:21,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:21,473 INFO L225 Difference]: With dead ends: 24184 [2018-11-28 19:59:21,474 INFO L226 Difference]: Without dead ends: 24184 [2018-11-28 19:59:21,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:59:21,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24184 states. [2018-11-28 19:59:21,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24184 to 22021. [2018-11-28 19:59:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22021 states. [2018-11-28 19:59:21,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22021 states to 22021 states and 67146 transitions. [2018-11-28 19:59:21,835 INFO L78 Accepts]: Start accepts. Automaton has 22021 states and 67146 transitions. Word has length 70 [2018-11-28 19:59:21,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:21,835 INFO L480 AbstractCegarLoop]: Abstraction has 22021 states and 67146 transitions. [2018-11-28 19:59:21,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:59:21,836 INFO L276 IsEmpty]: Start isEmpty. Operand 22021 states and 67146 transitions. [2018-11-28 19:59:21,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 19:59:21,849 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:21,849 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:21,849 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:21,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:21,850 INFO L82 PathProgramCache]: Analyzing trace with hash 294364470, now seen corresponding path program 1 times [2018-11-28 19:59:21,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:21,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:21,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:21,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:21,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:22,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:22,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:59:22,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:59:22,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:59:22,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:59:22,013 INFO L87 Difference]: Start difference. First operand 22021 states and 67146 transitions. Second operand 5 states. [2018-11-28 19:59:23,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:23,030 INFO L93 Difference]: Finished difference Result 30767 states and 92772 transitions. [2018-11-28 19:59:23,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 19:59:23,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-11-28 19:59:23,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:23,087 INFO L225 Difference]: With dead ends: 30767 [2018-11-28 19:59:23,087 INFO L226 Difference]: Without dead ends: 30767 [2018-11-28 19:59:23,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:59:23,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30767 states. [2018-11-28 19:59:23,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30767 to 27531. [2018-11-28 19:59:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27531 states. [2018-11-28 19:59:23,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27531 states to 27531 states and 83463 transitions. [2018-11-28 19:59:23,547 INFO L78 Accepts]: Start accepts. Automaton has 27531 states and 83463 transitions. Word has length 70 [2018-11-28 19:59:23,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:23,547 INFO L480 AbstractCegarLoop]: Abstraction has 27531 states and 83463 transitions. [2018-11-28 19:59:23,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:59:23,547 INFO L276 IsEmpty]: Start isEmpty. Operand 27531 states and 83463 transitions. [2018-11-28 19:59:23,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 19:59:23,563 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:23,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:23,564 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:23,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:23,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1513089993, now seen corresponding path program 1 times [2018-11-28 19:59:23,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:23,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:23,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:23,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:23,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:23,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:23,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:23,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:59:23,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:59:23,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:59:23,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:59:23,846 INFO L87 Difference]: Start difference. First operand 27531 states and 83463 transitions. Second operand 4 states. [2018-11-28 19:59:24,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:24,615 INFO L93 Difference]: Finished difference Result 37927 states and 115324 transitions. [2018-11-28 19:59:24,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 19:59:24,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2018-11-28 19:59:24,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:24,689 INFO L225 Difference]: With dead ends: 37927 [2018-11-28 19:59:24,689 INFO L226 Difference]: Without dead ends: 37711 [2018-11-28 19:59:24,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:59:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37711 states. [2018-11-28 19:59:25,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37711 to 34931. [2018-11-28 19:59:25,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34931 states. [2018-11-28 19:59:25,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34931 states to 34931 states and 106353 transitions. [2018-11-28 19:59:25,939 INFO L78 Accepts]: Start accepts. Automaton has 34931 states and 106353 transitions. Word has length 70 [2018-11-28 19:59:25,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:25,939 INFO L480 AbstractCegarLoop]: Abstraction has 34931 states and 106353 transitions. [2018-11-28 19:59:25,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:59:25,939 INFO L276 IsEmpty]: Start isEmpty. Operand 34931 states and 106353 transitions. [2018-11-28 19:59:25,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 19:59:25,955 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:25,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:25,955 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:25,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:25,956 INFO L82 PathProgramCache]: Analyzing trace with hash 984925944, now seen corresponding path program 1 times [2018-11-28 19:59:25,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:25,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:25,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:25,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:25,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:26,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:26,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 19:59:26,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 19:59:26,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 19:59:26,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:59:26,342 INFO L87 Difference]: Start difference. First operand 34931 states and 106353 transitions. Second operand 7 states. [2018-11-28 19:59:27,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:27,042 INFO L93 Difference]: Finished difference Result 30943 states and 89976 transitions. [2018-11-28 19:59:27,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 19:59:27,043 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-11-28 19:59:27,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:27,095 INFO L225 Difference]: With dead ends: 30943 [2018-11-28 19:59:27,095 INFO L226 Difference]: Without dead ends: 30943 [2018-11-28 19:59:27,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-11-28 19:59:27,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30943 states. [2018-11-28 19:59:27,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30943 to 25023. [2018-11-28 19:59:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25023 states. [2018-11-28 19:59:27,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25023 states to 25023 states and 72808 transitions. [2018-11-28 19:59:27,503 INFO L78 Accepts]: Start accepts. Automaton has 25023 states and 72808 transitions. Word has length 70 [2018-11-28 19:59:27,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:27,503 INFO L480 AbstractCegarLoop]: Abstraction has 25023 states and 72808 transitions. [2018-11-28 19:59:27,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 19:59:27,504 INFO L276 IsEmpty]: Start isEmpty. Operand 25023 states and 72808 transitions. [2018-11-28 19:59:27,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 19:59:27,517 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:27,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:27,518 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:27,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:27,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1872429625, now seen corresponding path program 1 times [2018-11-28 19:59:27,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:27,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:27,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:27,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:27,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:27,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:27,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:59:27,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:59:27,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:59:27,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:59:27,800 INFO L87 Difference]: Start difference. First operand 25023 states and 72808 transitions. Second operand 5 states. [2018-11-28 19:59:28,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:28,037 INFO L93 Difference]: Finished difference Result 7111 states and 17702 transitions. [2018-11-28 19:59:28,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 19:59:28,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-11-28 19:59:28,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:28,045 INFO L225 Difference]: With dead ends: 7111 [2018-11-28 19:59:28,045 INFO L226 Difference]: Without dead ends: 5778 [2018-11-28 19:59:28,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:59:28,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5778 states. [2018-11-28 19:59:28,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5778 to 5211. [2018-11-28 19:59:28,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5211 states. [2018-11-28 19:59:28,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5211 states to 5211 states and 12576 transitions. [2018-11-28 19:59:28,107 INFO L78 Accepts]: Start accepts. Automaton has 5211 states and 12576 transitions. Word has length 70 [2018-11-28 19:59:28,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:28,107 INFO L480 AbstractCegarLoop]: Abstraction has 5211 states and 12576 transitions. [2018-11-28 19:59:28,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:59:28,108 INFO L276 IsEmpty]: Start isEmpty. Operand 5211 states and 12576 transitions. [2018-11-28 19:59:28,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 19:59:28,115 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:28,115 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:28,115 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:28,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:28,115 INFO L82 PathProgramCache]: Analyzing trace with hash -173742318, now seen corresponding path program 1 times [2018-11-28 19:59:28,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:28,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:28,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:28,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:28,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:28,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:28,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:28,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:59:28,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:59:28,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:59:28,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:59:28,193 INFO L87 Difference]: Start difference. First operand 5211 states and 12576 transitions. Second operand 3 states. [2018-11-28 19:59:28,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:28,433 INFO L93 Difference]: Finished difference Result 6743 states and 16083 transitions. [2018-11-28 19:59:28,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:59:28,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-11-28 19:59:28,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:28,444 INFO L225 Difference]: With dead ends: 6743 [2018-11-28 19:59:28,445 INFO L226 Difference]: Without dead ends: 6743 [2018-11-28 19:59:28,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:59:28,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6743 states. [2018-11-28 19:59:28,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6743 to 5112. [2018-11-28 19:59:28,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5112 states. [2018-11-28 19:59:28,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5112 states to 5112 states and 12061 transitions. [2018-11-28 19:59:28,531 INFO L78 Accepts]: Start accepts. Automaton has 5112 states and 12061 transitions. Word has length 70 [2018-11-28 19:59:28,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:28,531 INFO L480 AbstractCegarLoop]: Abstraction has 5112 states and 12061 transitions. [2018-11-28 19:59:28,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:59:28,531 INFO L276 IsEmpty]: Start isEmpty. Operand 5112 states and 12061 transitions. [2018-11-28 19:59:28,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 19:59:28,541 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:28,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:28,542 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:28,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:28,542 INFO L82 PathProgramCache]: Analyzing trace with hash 536084869, now seen corresponding path program 1 times [2018-11-28 19:59:28,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:28,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:28,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:28,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:28,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:28,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-11-28 19:59:28,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:28,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:59:28,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:59:28,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:59:28,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:59:28,750 INFO L87 Difference]: Start difference. First operand 5112 states and 12061 transitions. Second operand 5 states. [2018-11-28 19:59:28,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:28,948 INFO L93 Difference]: Finished difference Result 6146 states and 14511 transitions. [2018-11-28 19:59:28,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 19:59:28,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-11-28 19:59:28,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:28,956 INFO L225 Difference]: With dead ends: 6146 [2018-11-28 19:59:28,957 INFO L226 Difference]: Without dead ends: 6146 [2018-11-28 19:59:28,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 19:59:28,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6146 states. [2018-11-28 19:59:29,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6146 to 5590. [2018-11-28 19:59:29,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5590 states. [2018-11-28 19:59:29,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5590 states to 5590 states and 13219 transitions. [2018-11-28 19:59:29,021 INFO L78 Accepts]: Start accepts. Automaton has 5590 states and 13219 transitions. Word has length 76 [2018-11-28 19:59:29,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:29,021 INFO L480 AbstractCegarLoop]: Abstraction has 5590 states and 13219 transitions. [2018-11-28 19:59:29,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:59:29,021 INFO L276 IsEmpty]: Start isEmpty. Operand 5590 states and 13219 transitions. [2018-11-28 19:59:29,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 19:59:29,027 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:29,028 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:29,028 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:29,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:29,028 INFO L82 PathProgramCache]: Analyzing trace with hash -2016072092, now seen corresponding path program 1 times [2018-11-28 19:59:29,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:29,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:29,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:29,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:29,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:29,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-11-28 19:59:29,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:29,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 19:59:29,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 19:59:29,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 19:59:29,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:59:29,162 INFO L87 Difference]: Start difference. First operand 5590 states and 13219 transitions. Second operand 7 states. [2018-11-28 19:59:29,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:29,627 INFO L93 Difference]: Finished difference Result 6317 states and 14770 transitions. [2018-11-28 19:59:29,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 19:59:29,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-11-28 19:59:29,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:29,636 INFO L225 Difference]: With dead ends: 6317 [2018-11-28 19:59:29,636 INFO L226 Difference]: Without dead ends: 6215 [2018-11-28 19:59:29,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-11-28 19:59:29,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6215 states. [2018-11-28 19:59:29,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6215 to 5600. [2018-11-28 19:59:29,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5600 states. [2018-11-28 19:59:29,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5600 states to 5600 states and 13149 transitions. [2018-11-28 19:59:29,697 INFO L78 Accepts]: Start accepts. Automaton has 5600 states and 13149 transitions. Word has length 76 [2018-11-28 19:59:29,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:29,697 INFO L480 AbstractCegarLoop]: Abstraction has 5600 states and 13149 transitions. [2018-11-28 19:59:29,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 19:59:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 5600 states and 13149 transitions. [2018-11-28 19:59:29,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-28 19:59:29,703 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:29,704 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, 1, 1] [2018-11-28 19:59:29,704 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:29,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:29,704 INFO L82 PathProgramCache]: Analyzing trace with hash -321575746, now seen corresponding path program 1 times [2018-11-28 19:59:29,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:29,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:29,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:29,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:29,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:29,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:29,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 19:59:29,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 19:59:29,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 19:59:29,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:59:29,873 INFO L87 Difference]: Start difference. First operand 5600 states and 13149 transitions. Second operand 7 states. [2018-11-28 19:59:30,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:30,601 INFO L93 Difference]: Finished difference Result 6817 states and 16126 transitions. [2018-11-28 19:59:30,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:59:30,602 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-11-28 19:59:30,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:30,610 INFO L225 Difference]: With dead ends: 6817 [2018-11-28 19:59:30,610 INFO L226 Difference]: Without dead ends: 6817 [2018-11-28 19:59:30,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:59:30,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6817 states. [2018-11-28 19:59:30,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6817 to 5783. [2018-11-28 19:59:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5783 states. [2018-11-28 19:59:30,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5783 states to 5783 states and 13733 transitions. [2018-11-28 19:59:30,677 INFO L78 Accepts]: Start accepts. Automaton has 5783 states and 13733 transitions. Word has length 97 [2018-11-28 19:59:30,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:30,678 INFO L480 AbstractCegarLoop]: Abstraction has 5783 states and 13733 transitions. [2018-11-28 19:59:30,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 19:59:30,678 INFO L276 IsEmpty]: Start isEmpty. Operand 5783 states and 13733 transitions. [2018-11-28 19:59:30,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-28 19:59:30,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:30,685 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, 1, 1] [2018-11-28 19:59:30,685 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:30,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:30,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1424496976, now seen corresponding path program 1 times [2018-11-28 19:59:30,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:30,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:30,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:30,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:30,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:30,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:30,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:30,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:59:30,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:59:30,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:59:30,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:59:30,898 INFO L87 Difference]: Start difference. First operand 5783 states and 13733 transitions. Second operand 4 states. [2018-11-28 19:59:31,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:31,034 INFO L93 Difference]: Finished difference Result 6884 states and 16093 transitions. [2018-11-28 19:59:31,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:59:31,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-11-28 19:59:31,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:31,043 INFO L225 Difference]: With dead ends: 6884 [2018-11-28 19:59:31,043 INFO L226 Difference]: Without dead ends: 6884 [2018-11-28 19:59:31,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:59:31,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6884 states. [2018-11-28 19:59:31,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6884 to 6235. [2018-11-28 19:59:31,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6235 states. [2018-11-28 19:59:31,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6235 states to 6235 states and 14671 transitions. [2018-11-28 19:59:31,115 INFO L78 Accepts]: Start accepts. Automaton has 6235 states and 14671 transitions. Word has length 97 [2018-11-28 19:59:31,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:31,115 INFO L480 AbstractCegarLoop]: Abstraction has 6235 states and 14671 transitions. [2018-11-28 19:59:31,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:59:31,115 INFO L276 IsEmpty]: Start isEmpty. Operand 6235 states and 14671 transitions. [2018-11-28 19:59:31,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 19:59:31,123 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:31,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:31,123 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:31,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:31,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1324645014, now seen corresponding path program 1 times [2018-11-28 19:59:31,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:31,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:31,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:31,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:31,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:31,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:31,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:59:31,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:59:31,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:59:31,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:59:31,296 INFO L87 Difference]: Start difference. First operand 6235 states and 14671 transitions. Second operand 5 states. [2018-11-28 19:59:31,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:31,425 INFO L93 Difference]: Finished difference Result 6821 states and 15986 transitions. [2018-11-28 19:59:31,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:59:31,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-11-28 19:59:31,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:31,434 INFO L225 Difference]: With dead ends: 6821 [2018-11-28 19:59:31,434 INFO L226 Difference]: Without dead ends: 6821 [2018-11-28 19:59:31,435 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-11-28 19:59:31,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6821 states. [2018-11-28 19:59:31,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6821 to 5265. [2018-11-28 19:59:31,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5265 states. [2018-11-28 19:59:31,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5265 states to 5265 states and 12335 transitions. [2018-11-28 19:59:31,498 INFO L78 Accepts]: Start accepts. Automaton has 5265 states and 12335 transitions. Word has length 99 [2018-11-28 19:59:31,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:31,498 INFO L480 AbstractCegarLoop]: Abstraction has 5265 states and 12335 transitions. [2018-11-28 19:59:31,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:59:31,498 INFO L276 IsEmpty]: Start isEmpty. Operand 5265 states and 12335 transitions. [2018-11-28 19:59:31,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 19:59:31,505 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:31,505 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, 1, 1, 1, 1] [2018-11-28 19:59:31,505 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:31,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:31,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1335961141, now seen corresponding path program 1 times [2018-11-28 19:59:31,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:31,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:31,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:31,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:31,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:31,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:31,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:31,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:59:31,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:59:31,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:59:31,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:59:31,783 INFO L87 Difference]: Start difference. First operand 5265 states and 12335 transitions. Second operand 4 states. [2018-11-28 19:59:32,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:32,071 INFO L93 Difference]: Finished difference Result 6800 states and 15876 transitions. [2018-11-28 19:59:32,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 19:59:32,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-11-28 19:59:32,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:32,081 INFO L225 Difference]: With dead ends: 6800 [2018-11-28 19:59:32,082 INFO L226 Difference]: Without dead ends: 6739 [2018-11-28 19:59:32,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:59:32,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6739 states. [2018-11-28 19:59:32,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6739 to 6337. [2018-11-28 19:59:32,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6337 states. [2018-11-28 19:59:32,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6337 states to 6337 states and 14856 transitions. [2018-11-28 19:59:32,151 INFO L78 Accepts]: Start accepts. Automaton has 6337 states and 14856 transitions. Word has length 99 [2018-11-28 19:59:32,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:32,151 INFO L480 AbstractCegarLoop]: Abstraction has 6337 states and 14856 transitions. [2018-11-28 19:59:32,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:59:32,152 INFO L276 IsEmpty]: Start isEmpty. Operand 6337 states and 14856 transitions. [2018-11-28 19:59:32,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 19:59:32,215 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:32,215 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, 1, 1, 1, 1] [2018-11-28 19:59:32,215 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:32,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:32,215 INFO L82 PathProgramCache]: Analyzing trace with hash -741248202, now seen corresponding path program 1 times [2018-11-28 19:59:32,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:32,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:32,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:32,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:32,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:32,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:32,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:32,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 19:59:32,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 19:59:32,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 19:59:32,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:59:32,430 INFO L87 Difference]: Start difference. First operand 6337 states and 14856 transitions. Second operand 7 states. [2018-11-28 19:59:32,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:32,724 INFO L93 Difference]: Finished difference Result 8083 states and 18867 transitions. [2018-11-28 19:59:32,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:59:32,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-11-28 19:59:32,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:32,734 INFO L225 Difference]: With dead ends: 8083 [2018-11-28 19:59:32,734 INFO L226 Difference]: Without dead ends: 8083 [2018-11-28 19:59:32,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-28 19:59:32,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8083 states. [2018-11-28 19:59:32,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8083 to 6105. [2018-11-28 19:59:32,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6105 states. [2018-11-28 19:59:32,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6105 states to 6105 states and 14166 transitions. [2018-11-28 19:59:32,807 INFO L78 Accepts]: Start accepts. Automaton has 6105 states and 14166 transitions. Word has length 99 [2018-11-28 19:59:32,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:32,808 INFO L480 AbstractCegarLoop]: Abstraction has 6105 states and 14166 transitions. [2018-11-28 19:59:32,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 19:59:32,808 INFO L276 IsEmpty]: Start isEmpty. Operand 6105 states and 14166 transitions. [2018-11-28 19:59:32,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 19:59:32,817 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:32,817 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, 1, 1, 1, 1] [2018-11-28 19:59:32,817 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:32,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:32,818 INFO L82 PathProgramCache]: Analyzing trace with hash -529897289, now seen corresponding path program 1 times [2018-11-28 19:59:32,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:32,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:32,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:32,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:32,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:33,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:33,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:33,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:59:33,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:59:33,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:59:33,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:59:33,016 INFO L87 Difference]: Start difference. First operand 6105 states and 14166 transitions. Second operand 5 states. [2018-11-28 19:59:33,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:33,065 INFO L93 Difference]: Finished difference Result 6105 states and 14150 transitions. [2018-11-28 19:59:33,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 19:59:33,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-11-28 19:59:33,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:33,074 INFO L225 Difference]: With dead ends: 6105 [2018-11-28 19:59:33,074 INFO L226 Difference]: Without dead ends: 6105 [2018-11-28 19:59:33,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:59:33,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6105 states. [2018-11-28 19:59:33,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6105 to 5757. [2018-11-28 19:59:33,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2018-11-28 19:59:33,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 13316 transitions. [2018-11-28 19:59:33,140 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 13316 transitions. Word has length 99 [2018-11-28 19:59:33,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:33,141 INFO L480 AbstractCegarLoop]: Abstraction has 5757 states and 13316 transitions. [2018-11-28 19:59:33,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:59:33,141 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 13316 transitions. [2018-11-28 19:59:33,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 19:59:33,149 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:33,150 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, 1, 1, 1, 1] [2018-11-28 19:59:33,150 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:33,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:33,150 INFO L82 PathProgramCache]: Analyzing trace with hash 357606392, now seen corresponding path program 1 times [2018-11-28 19:59:33,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:33,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:33,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:33,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:33,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:33,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:33,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:33,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 19:59:33,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 19:59:33,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 19:59:33,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 19:59:33,381 INFO L87 Difference]: Start difference. First operand 5757 states and 13316 transitions. Second operand 10 states. [2018-11-28 19:59:35,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:35,765 INFO L93 Difference]: Finished difference Result 8664 states and 19989 transitions. [2018-11-28 19:59:35,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 19:59:35,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2018-11-28 19:59:35,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:35,774 INFO L225 Difference]: With dead ends: 8664 [2018-11-28 19:59:35,774 INFO L226 Difference]: Without dead ends: 6420 [2018-11-28 19:59:35,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-28 19:59:35,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6420 states. [2018-11-28 19:59:35,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6420 to 5890. [2018-11-28 19:59:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5890 states. [2018-11-28 19:59:35,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5890 states to 5890 states and 13589 transitions. [2018-11-28 19:59:35,835 INFO L78 Accepts]: Start accepts. Automaton has 5890 states and 13589 transitions. Word has length 99 [2018-11-28 19:59:35,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:35,836 INFO L480 AbstractCegarLoop]: Abstraction has 5890 states and 13589 transitions. [2018-11-28 19:59:35,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 19:59:35,836 INFO L276 IsEmpty]: Start isEmpty. Operand 5890 states and 13589 transitions. [2018-11-28 19:59:35,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 19:59:35,842 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:35,842 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, 1, 1, 1, 1] [2018-11-28 19:59:35,844 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:35,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:35,844 INFO L82 PathProgramCache]: Analyzing trace with hash 571332279, now seen corresponding path program 1 times [2018-11-28 19:59:35,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:35,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:35,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:35,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:35,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:36,234 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 19:59:36,674 WARN L180 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-11-28 19:59:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:36,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:36,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:59:36,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:59:36,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:59:36,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:59:36,690 INFO L87 Difference]: Start difference. First operand 5890 states and 13589 transitions. Second operand 6 states. [2018-11-28 19:59:36,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:36,878 INFO L93 Difference]: Finished difference Result 7234 states and 16172 transitions. [2018-11-28 19:59:36,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:59:36,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-11-28 19:59:36,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:36,888 INFO L225 Difference]: With dead ends: 7234 [2018-11-28 19:59:36,889 INFO L226 Difference]: Without dead ends: 7203 [2018-11-28 19:59:36,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:59:36,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7203 states. [2018-11-28 19:59:36,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7203 to 5897. [2018-11-28 19:59:36,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5897 states. [2018-11-28 19:59:36,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5897 states to 5897 states and 13285 transitions. [2018-11-28 19:59:36,961 INFO L78 Accepts]: Start accepts. Automaton has 5897 states and 13285 transitions. Word has length 99 [2018-11-28 19:59:36,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:36,962 INFO L480 AbstractCegarLoop]: Abstraction has 5897 states and 13285 transitions. [2018-11-28 19:59:36,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:59:36,962 INFO L276 IsEmpty]: Start isEmpty. Operand 5897 states and 13285 transitions. [2018-11-28 19:59:36,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 19:59:36,968 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:36,969 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, 1, 1, 1, 1] [2018-11-28 19:59:36,969 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:36,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:36,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1679511564, now seen corresponding path program 1 times [2018-11-28 19:59:36,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:36,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:36,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:36,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:36,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:37,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:37,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:59:37,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:59:37,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:59:37,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:59:37,094 INFO L87 Difference]: Start difference. First operand 5897 states and 13285 transitions. Second operand 5 states. [2018-11-28 19:59:37,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:37,354 INFO L93 Difference]: Finished difference Result 6847 states and 15318 transitions. [2018-11-28 19:59:37,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 19:59:37,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-11-28 19:59:37,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:37,365 INFO L225 Difference]: With dead ends: 6847 [2018-11-28 19:59:37,365 INFO L226 Difference]: Without dead ends: 6781 [2018-11-28 19:59:37,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:59:37,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6781 states. [2018-11-28 19:59:37,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6781 to 5524. [2018-11-28 19:59:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5524 states. [2018-11-28 19:59:37,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 12519 transitions. [2018-11-28 19:59:37,432 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 12519 transitions. Word has length 99 [2018-11-28 19:59:37,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:37,432 INFO L480 AbstractCegarLoop]: Abstraction has 5524 states and 12519 transitions. [2018-11-28 19:59:37,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:59:37,432 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 12519 transitions. [2018-11-28 19:59:37,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 19:59:37,439 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:37,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:37,439 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:37,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:37,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1922354035, now seen corresponding path program 2 times [2018-11-28 19:59:37,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:37,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:37,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:37,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:37,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:37,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:37,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:59:37,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:59:37,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:59:37,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:59:37,658 INFO L87 Difference]: Start difference. First operand 5524 states and 12519 transitions. Second operand 6 states. [2018-11-28 19:59:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:38,009 INFO L93 Difference]: Finished difference Result 5976 states and 13438 transitions. [2018-11-28 19:59:38,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 19:59:38,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-11-28 19:59:38,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:38,019 INFO L225 Difference]: With dead ends: 5976 [2018-11-28 19:59:38,019 INFO L226 Difference]: Without dead ends: 5976 [2018-11-28 19:59:38,019 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-11-28 19:59:38,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2018-11-28 19:59:38,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 5689. [2018-11-28 19:59:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5689 states. [2018-11-28 19:59:38,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5689 states to 5689 states and 12814 transitions. [2018-11-28 19:59:38,084 INFO L78 Accepts]: Start accepts. Automaton has 5689 states and 12814 transitions. Word has length 99 [2018-11-28 19:59:38,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:38,084 INFO L480 AbstractCegarLoop]: Abstraction has 5689 states and 12814 transitions. [2018-11-28 19:59:38,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:59:38,084 INFO L276 IsEmpty]: Start isEmpty. Operand 5689 states and 12814 transitions. [2018-11-28 19:59:38,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 19:59:38,091 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:38,091 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, 1, 1, 1, 1] [2018-11-28 19:59:38,091 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:38,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:38,092 INFO L82 PathProgramCache]: Analyzing trace with hash 122635640, now seen corresponding path program 2 times [2018-11-28 19:59:38,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:38,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:38,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:38,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 19:59:38,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:38,282 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 19:59:38,583 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 6 [2018-11-28 19:59:39,080 WARN L180 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 6 [2018-11-28 19:59:39,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:39,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:39,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 19:59:39,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 19:59:39,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 19:59:39,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 19:59:39,603 INFO L87 Difference]: Start difference. First operand 5689 states and 12814 transitions. Second operand 9 states. [2018-11-28 19:59:39,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:39,788 INFO L93 Difference]: Finished difference Result 7272 states and 16362 transitions. [2018-11-28 19:59:39,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 19:59:39,789 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2018-11-28 19:59:39,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:39,796 INFO L225 Difference]: With dead ends: 7272 [2018-11-28 19:59:39,797 INFO L226 Difference]: Without dead ends: 5792 [2018-11-28 19:59:39,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-11-28 19:59:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5792 states. [2018-11-28 19:59:39,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5792 to 5343. [2018-11-28 19:59:39,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5343 states. [2018-11-28 19:59:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5343 states to 5343 states and 12092 transitions. [2018-11-28 19:59:39,851 INFO L78 Accepts]: Start accepts. Automaton has 5343 states and 12092 transitions. Word has length 99 [2018-11-28 19:59:39,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:39,851 INFO L480 AbstractCegarLoop]: Abstraction has 5343 states and 12092 transitions. [2018-11-28 19:59:39,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 19:59:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 5343 states and 12092 transitions. [2018-11-28 19:59:39,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 19:59:39,857 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:39,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:39,857 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:39,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:39,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1836332608, now seen corresponding path program 3 times [2018-11-28 19:59:39,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:39,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:39,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:39,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 19:59:39,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:40,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:40,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:40,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 19:59:40,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 19:59:40,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 19:59:40,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 19:59:40,108 INFO L87 Difference]: Start difference. First operand 5343 states and 12092 transitions. Second operand 10 states. [2018-11-28 19:59:40,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:40,920 INFO L93 Difference]: Finished difference Result 14141 states and 32221 transitions. [2018-11-28 19:59:40,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 19:59:40,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2018-11-28 19:59:40,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:40,927 INFO L225 Difference]: With dead ends: 14141 [2018-11-28 19:59:40,927 INFO L226 Difference]: Without dead ends: 4580 [2018-11-28 19:59:40,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-11-28 19:59:40,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4580 states. [2018-11-28 19:59:40,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4580 to 3276. [2018-11-28 19:59:40,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3276 states. [2018-11-28 19:59:40,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 7363 transitions. [2018-11-28 19:59:40,967 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 7363 transitions. Word has length 99 [2018-11-28 19:59:40,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:40,967 INFO L480 AbstractCegarLoop]: Abstraction has 3276 states and 7363 transitions. [2018-11-28 19:59:40,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 19:59:40,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 7363 transitions. [2018-11-28 19:59:40,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 19:59:40,971 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:40,971 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, 1, 1, 1, 1] [2018-11-28 19:59:40,972 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:40,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:40,972 INFO L82 PathProgramCache]: Analyzing trace with hash -2012018334, now seen corresponding path program 4 times [2018-11-28 19:59:40,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:40,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:40,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:40,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 19:59:40,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:41,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-11-28 19:59:41,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:41,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 19:59:41,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 19:59:41,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 19:59:41,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 19:59:41,219 INFO L87 Difference]: Start difference. First operand 3276 states and 7363 transitions. Second operand 11 states. [2018-11-28 19:59:42,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:42,162 INFO L93 Difference]: Finished difference Result 6829 states and 15388 transitions. [2018-11-28 19:59:42,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 19:59:42,163 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-11-28 19:59:42,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:42,169 INFO L225 Difference]: With dead ends: 6829 [2018-11-28 19:59:42,169 INFO L226 Difference]: Without dead ends: 4448 [2018-11-28 19:59:42,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-11-28 19:59:42,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4448 states. [2018-11-28 19:59:42,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4448 to 3307. [2018-11-28 19:59:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3307 states. [2018-11-28 19:59:42,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3307 states to 3307 states and 7379 transitions. [2018-11-28 19:59:42,206 INFO L78 Accepts]: Start accepts. Automaton has 3307 states and 7379 transitions. Word has length 99 [2018-11-28 19:59:42,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:42,207 INFO L480 AbstractCegarLoop]: Abstraction has 3307 states and 7379 transitions. [2018-11-28 19:59:42,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 19:59:42,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3307 states and 7379 transitions. [2018-11-28 19:59:42,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 19:59:42,211 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:42,211 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, 1, 1, 1, 1] [2018-11-28 19:59:42,211 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:42,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:42,212 INFO L82 PathProgramCache]: Analyzing trace with hash 460693250, now seen corresponding path program 5 times [2018-11-28 19:59:42,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:42,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:42,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:42,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 19:59:42,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 19:59:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 19:59:42,322 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 19:59:42,535 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 19:59:42,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 07:59:42 BasicIcfg [2018-11-28 19:59:42,538 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 19:59:42,538 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 19:59:42,538 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 19:59:42,538 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 19:59:42,541 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:59:01" (3/4) ... [2018-11-28 19:59:42,545 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 19:59:42,776 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 19:59:42,780 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 19:59:42,781 INFO L168 Benchmark]: Toolchain (without parser) took 43548.13 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -229.9 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-11-28 19:59:42,782 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 19:59:42,783 INFO L168 Benchmark]: CACSL2BoogieTranslator took 870.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -138.9 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2018-11-28 19:59:42,783 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.31 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-11-28 19:59:42,783 INFO L168 Benchmark]: Boogie Preprocessor took 43.92 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-11-28 19:59:42,784 INFO L168 Benchmark]: RCFGBuilder took 1272.10 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: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. [2018-11-28 19:59:42,784 INFO L168 Benchmark]: TraceAbstraction took 41038.24 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -188.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-28 19:59:42,784 INFO L168 Benchmark]: Witness Printer took 242.43 ms. Allocated memory is still 3.0 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. [2018-11-28 19:59:42,791 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 870.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -138.9 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.31 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 43.92 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 1272.10 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: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41038.24 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -188.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 242.43 ms. Allocated memory is still 3.0 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L677] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L679] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L682] -1 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0] [L683] -1 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L684] -1 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L685] -1 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L686] -1 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L687] -1 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0] [L688] -1 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L689] -1 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L690] -1 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0] [L691] -1 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L692] -1 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L693] -1 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L694] -1 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L695] -1 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L696] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L697] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L699] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L701] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L704] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L705] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L790] -1 pthread_t t839; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t839, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L709] 0 a$w_buff1 = a$w_buff0 [L710] 0 a$w_buff0 = 1 [L711] 0 a$w_buff1_used = a$w_buff0_used [L712] 0 a$w_buff0_used = (_Bool)1 [L792] -1 pthread_t t840; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L793] FCALL, FORK -1 pthread_create(&t840, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L714] 0 a$r_buff1_thd0 = a$r_buff0_thd0 [L715] 0 a$r_buff1_thd1 = a$r_buff0_thd1 [L716] 0 a$r_buff1_thd2 = a$r_buff0_thd2 [L717] 0 a$r_buff0_thd1 = (_Bool)1 [L720] 0 x = 1 [L723] 0 __unbuffered_p0_EAX = x [L726] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L729] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L743] 1 y = 1 [L746] 1 z = 1 [L749] 1 __unbuffered_p1_EAX = z [L752] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L753] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L754] 1 a$flush_delayed = weak$$choice2 [L755] 1 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L756] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L729] 0 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L730] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L730] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L756] 1 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L731] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L757] EXPR 1 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L731] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L732] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L732] 0 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L733] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L733] 0 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L736] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L757] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L758] EXPR 1 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L758] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L759] EXPR 1 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L759] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L760] EXPR 1 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L760] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 1 weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2))=0, x=1, y=1, z=1] [L761] 1 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L762] EXPR 1 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L762] 1 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 1 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L764] EXPR 1 a$flush_delayed ? a$mem_tmp : a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L764] 1 a = a$flush_delayed ? a$mem_tmp : a [L765] 1 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L771] 1 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L772] 1 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L795] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L799] -1 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L800] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L800] -1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L801] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L801] -1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L802] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L802] -1 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L803] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L803] -1 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L806] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 226 locations, 3 error locations. UNSAFE Result, 40.8s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 20.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8420 SDtfs, 9269 SDslu, 20037 SDs, 0 SdLazy, 7269 SolverSat, 310 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 73 SyntacticMatches, 29 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34931occurred in iteration=13, 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, 31 MinimizatonAttempts, 69338 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 2532 NumberOfCodeBlocks, 2532 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2402 ConstructedInterpolants, 0 QuantifiedInterpolants, 584139 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...