./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi004_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/rfi004_power.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 876454da50381170b67bfde0914077310251dbb9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 20:20:06,985 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 20:20:06,987 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 20:20:07,000 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 20:20:07,000 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 20:20:07,001 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 20:20:07,003 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 20:20:07,006 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 20:20:07,008 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 20:20:07,009 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 20:20:07,010 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 20:20:07,010 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 20:20:07,012 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 20:20:07,013 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 20:20:07,014 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 20:20:07,015 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 20:20:07,016 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 20:20:07,018 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 20:20:07,020 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 20:20:07,022 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 20:20:07,023 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 20:20:07,025 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 20:20:07,028 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 20:20:07,028 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 20:20:07,028 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 20:20:07,029 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 20:20:07,031 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 20:20:07,032 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 20:20:07,033 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 20:20:07,034 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 20:20:07,034 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 20:20:07,037 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 20:20:07,037 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 20:20:07,037 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 20:20:07,039 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 20:20:07,040 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 20:20:07,040 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 20:20:07,057 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 20:20:07,057 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 20:20:07,058 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 20:20:07,059 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 20:20:07,059 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 20:20:07,060 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 20:20:07,060 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 20:20:07,061 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 20:20:07,061 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 20:20:07,061 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 20:20:07,061 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 20:20:07,061 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 20:20:07,062 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 20:20:07,062 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 20:20:07,062 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 20:20:07,062 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 20:20:07,062 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 20:20:07,063 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 20:20:07,064 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 20:20:07,064 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 20:20:07,064 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 20:20:07,065 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 20:20:07,065 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 20:20:07,065 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:20:07,065 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 20:20:07,065 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 20:20:07,066 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 20:20:07,066 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 20:20:07,066 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 20:20:07,066 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 20:20:07,066 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 -> 876454da50381170b67bfde0914077310251dbb9 [2018-11-28 20:20:07,133 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 20:20:07,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 20:20:07,159 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 20:20:07,162 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 20:20:07,163 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 20:20:07,164 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi004_power.opt_false-unreach-call.i [2018-11-28 20:20:07,234 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3325b369b/24a8532d2ab2468e812d0d9df8504266/FLAGc4f78564d [2018-11-28 20:20:07,845 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 20:20:07,846 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi004_power.opt_false-unreach-call.i [2018-11-28 20:20:07,867 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3325b369b/24a8532d2ab2468e812d0d9df8504266/FLAGc4f78564d [2018-11-28 20:20:08,089 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3325b369b/24a8532d2ab2468e812d0d9df8504266 [2018-11-28 20:20:08,094 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 20:20:08,096 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 20:20:08,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 20:20:08,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 20:20:08,109 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 20:20:08,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:08" (1/1) ... [2018-11-28 20:20:08,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ab9c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:08, skipping insertion in model container [2018-11-28 20:20:08,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:08" (1/1) ... [2018-11-28 20:20:08,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 20:20:08,187 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 20:20:08,723 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:20:08,746 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 20:20:08,922 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:20:09,005 INFO L195 MainTranslator]: Completed translation [2018-11-28 20:20:09,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:09 WrapperNode [2018-11-28 20:20:09,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 20:20:09,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 20:20:09,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 20:20:09,007 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 20:20:09,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:09" (1/1) ... [2018-11-28 20:20:09,054 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:09" (1/1) ... [2018-11-28 20:20:09,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 20:20:09,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 20:20:09,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 20:20:09,100 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 20:20:09,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:09" (1/1) ... [2018-11-28 20:20:09,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:09" (1/1) ... [2018-11-28 20:20:09,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:09" (1/1) ... [2018-11-28 20:20:09,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:09" (1/1) ... [2018-11-28 20:20:09,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:09" (1/1) ... [2018-11-28 20:20:09,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:09" (1/1) ... [2018-11-28 20:20:09,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:09" (1/1) ... [2018-11-28 20:20:09,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 20:20:09,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 20:20:09,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 20:20:09,142 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 20:20:09,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:20:09,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 20:20:09,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 20:20:09,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 20:20:09,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 20:20:09,231 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 20:20:09,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 20:20:09,231 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 20:20:09,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 20:20:09,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 20:20:09,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 20:20:09,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 20:20:09,234 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 20:20:10,445 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 20:20:10,446 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 20:20:10,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:10 BoogieIcfgContainer [2018-11-28 20:20:10,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 20:20:10,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 20:20:10,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 20:20:10,453 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 20:20:10,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:20:08" (1/3) ... [2018-11-28 20:20:10,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d0a287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:20:10, skipping insertion in model container [2018-11-28 20:20:10,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:09" (2/3) ... [2018-11-28 20:20:10,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d0a287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:20:10, skipping insertion in model container [2018-11-28 20:20:10,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:10" (3/3) ... [2018-11-28 20:20:10,458 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004_power.opt_false-unreach-call.i [2018-11-28 20:20:10,504 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,505 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,505 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,505 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,505 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,506 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,507 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,507 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,507 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,508 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,508 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,509 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,509 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,509 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,509 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,510 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,510 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,510 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,510 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,510 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,510 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,512 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,513 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,513 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,513 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,513 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,514 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,515 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,515 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,515 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,515 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,515 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,517 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,517 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,517 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,517 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,517 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,518 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,518 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,518 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,518 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,518 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,519 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,519 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,519 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,519 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,519 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,522 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,522 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,522 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,523 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,523 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,523 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,523 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,523 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,525 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,527 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,527 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,527 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,527 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,527 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,529 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,529 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,529 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,529 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,530 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,530 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,530 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,530 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,530 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,532 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,532 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,532 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,533 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,533 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,534 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,534 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,534 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,534 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,535 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,535 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,535 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,535 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,535 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,537 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,538 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,538 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,538 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,539 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,539 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,539 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,539 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,539 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,540 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,540 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,540 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,546 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,546 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,547 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,547 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,547 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,548 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,548 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,548 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,548 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,548 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,553 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,554 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,555 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,556 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,560 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,561 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,563 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:20:10,593 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 20:20:10,594 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 20:20:10,602 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 20:20:10,620 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 20:20:10,646 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 20:20:10,647 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 20:20:10,647 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 20:20:10,647 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 20:20:10,647 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 20:20:10,647 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 20:20:10,648 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 20:20:10,648 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 20:20:10,648 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 20:20:10,660 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132places, 164 transitions [2018-11-28 20:20:12,384 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27856 states. [2018-11-28 20:20:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 27856 states. [2018-11-28 20:20:12,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 20:20:12,396 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:12,397 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] [2018-11-28 20:20:12,399 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:12,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:12,404 INFO L82 PathProgramCache]: Analyzing trace with hash -31372928, now seen corresponding path program 1 times [2018-11-28 20:20:12,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:12,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:12,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:12,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:12,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:12,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:12,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:12,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:12,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:12,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:12,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:12,778 INFO L87 Difference]: Start difference. First operand 27856 states. Second operand 4 states. [2018-11-28 20:20:13,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:13,974 INFO L93 Difference]: Finished difference Result 47768 states and 183119 transitions. [2018-11-28 20:20:13,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:20:13,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-11-28 20:20:13,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:14,615 INFO L225 Difference]: With dead ends: 47768 [2018-11-28 20:20:14,616 INFO L226 Difference]: Without dead ends: 34608 [2018-11-28 20:20:14,619 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 20:20:14,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34608 states. [2018-11-28 20:20:15,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34608 to 21756. [2018-11-28 20:20:15,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21756 states. [2018-11-28 20:20:15,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21756 states to 21756 states and 83441 transitions. [2018-11-28 20:20:15,774 INFO L78 Accepts]: Start accepts. Automaton has 21756 states and 83441 transitions. Word has length 39 [2018-11-28 20:20:15,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:15,775 INFO L480 AbstractCegarLoop]: Abstraction has 21756 states and 83441 transitions. [2018-11-28 20:20:15,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:20:15,775 INFO L276 IsEmpty]: Start isEmpty. Operand 21756 states and 83441 transitions. [2018-11-28 20:20:15,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 20:20:15,785 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:15,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:15,785 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:15,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:15,787 INFO L82 PathProgramCache]: Analyzing trace with hash -954263015, now seen corresponding path program 1 times [2018-11-28 20:20:15,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:15,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:15,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:15,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:15,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:16,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:16,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:20:16,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:20:16,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:20:16,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:16,102 INFO L87 Difference]: Start difference. First operand 21756 states and 83441 transitions. Second operand 5 states. [2018-11-28 20:20:18,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:18,531 INFO L93 Difference]: Finished difference Result 47634 states and 173802 transitions. [2018-11-28 20:20:18,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:20:18,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-28 20:20:18,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:18,756 INFO L225 Difference]: With dead ends: 47634 [2018-11-28 20:20:18,756 INFO L226 Difference]: Without dead ends: 47066 [2018-11-28 20:20:18,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:20:19,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47066 states. [2018-11-28 20:20:20,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47066 to 31796. [2018-11-28 20:20:20,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31796 states. [2018-11-28 20:20:20,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31796 states to 31796 states and 116819 transitions. [2018-11-28 20:20:20,369 INFO L78 Accepts]: Start accepts. Automaton has 31796 states and 116819 transitions. Word has length 47 [2018-11-28 20:20:20,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:20,375 INFO L480 AbstractCegarLoop]: Abstraction has 31796 states and 116819 transitions. [2018-11-28 20:20:20,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:20:20,376 INFO L276 IsEmpty]: Start isEmpty. Operand 31796 states and 116819 transitions. [2018-11-28 20:20:20,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 20:20:20,383 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:20,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:20,384 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:20,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:20,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1367871073, now seen corresponding path program 1 times [2018-11-28 20:20:20,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:20,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:20,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:20,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:20,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:20,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:20,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:20,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:20:20,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:20:20,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:20:20,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:20,572 INFO L87 Difference]: Start difference. First operand 31796 states and 116819 transitions. Second operand 5 states. [2018-11-28 20:20:21,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:21,320 INFO L93 Difference]: Finished difference Result 63028 states and 229114 transitions. [2018-11-28 20:20:21,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:20:21,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-28 20:20:21,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:21,683 INFO L225 Difference]: With dead ends: 63028 [2018-11-28 20:20:21,684 INFO L226 Difference]: Without dead ends: 62564 [2018-11-28 20:20:21,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:20:22,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62564 states. [2018-11-28 20:20:23,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62564 to 35364. [2018-11-28 20:20:23,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35364 states. [2018-11-28 20:20:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35364 states to 35364 states and 128877 transitions. [2018-11-28 20:20:23,665 INFO L78 Accepts]: Start accepts. Automaton has 35364 states and 128877 transitions. Word has length 48 [2018-11-28 20:20:23,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:23,666 INFO L480 AbstractCegarLoop]: Abstraction has 35364 states and 128877 transitions. [2018-11-28 20:20:23,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:20:23,666 INFO L276 IsEmpty]: Start isEmpty. Operand 35364 states and 128877 transitions. [2018-11-28 20:20:23,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 20:20:23,674 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:23,674 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 20:20:23,674 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:23,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:23,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1372813561, now seen corresponding path program 1 times [2018-11-28 20:20:23,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:23,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:23,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:23,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:23,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:23,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:23,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:20:23,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:20:23,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:20:23,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:20:23,761 INFO L87 Difference]: Start difference. First operand 35364 states and 128877 transitions. Second operand 3 states. [2018-11-28 20:20:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:24,008 INFO L93 Difference]: Finished difference Result 45910 states and 163945 transitions. [2018-11-28 20:20:24,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:20:24,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-28 20:20:24,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:24,137 INFO L225 Difference]: With dead ends: 45910 [2018-11-28 20:20:24,137 INFO L226 Difference]: Without dead ends: 45910 [2018-11-28 20:20:24,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:20:24,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45910 states. [2018-11-28 20:20:24,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45910 to 40247. [2018-11-28 20:20:24,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40247 states. [2018-11-28 20:20:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40247 states to 40247 states and 145215 transitions. [2018-11-28 20:20:26,045 INFO L78 Accepts]: Start accepts. Automaton has 40247 states and 145215 transitions. Word has length 50 [2018-11-28 20:20:26,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:26,046 INFO L480 AbstractCegarLoop]: Abstraction has 40247 states and 145215 transitions. [2018-11-28 20:20:26,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:20:26,046 INFO L276 IsEmpty]: Start isEmpty. Operand 40247 states and 145215 transitions. [2018-11-28 20:20:26,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 20:20:26,062 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:26,062 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] [2018-11-28 20:20:26,062 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:26,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:26,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1505170194, now seen corresponding path program 1 times [2018-11-28 20:20:26,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:26,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:26,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:26,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:26,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:26,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:26,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:26,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:26,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:26,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:26,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:26,206 INFO L87 Difference]: Start difference. First operand 40247 states and 145215 transitions. Second operand 6 states. [2018-11-28 20:20:27,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:27,387 INFO L93 Difference]: Finished difference Result 70850 states and 252355 transitions. [2018-11-28 20:20:27,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:20:27,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-11-28 20:20:27,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:27,557 INFO L225 Difference]: With dead ends: 70850 [2018-11-28 20:20:27,558 INFO L226 Difference]: Without dead ends: 70314 [2018-11-28 20:20:27,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-28 20:20:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70314 states. [2018-11-28 20:20:28,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70314 to 40898. [2018-11-28 20:20:28,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40898 states. [2018-11-28 20:20:28,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40898 states to 40898 states and 147668 transitions. [2018-11-28 20:20:28,611 INFO L78 Accepts]: Start accepts. Automaton has 40898 states and 147668 transitions. Word has length 54 [2018-11-28 20:20:28,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:28,611 INFO L480 AbstractCegarLoop]: Abstraction has 40898 states and 147668 transitions. [2018-11-28 20:20:28,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:28,611 INFO L276 IsEmpty]: Start isEmpty. Operand 40898 states and 147668 transitions. [2018-11-28 20:20:28,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 20:20:28,630 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:28,630 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] [2018-11-28 20:20:28,631 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:28,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:28,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1915358571, now seen corresponding path program 1 times [2018-11-28 20:20:28,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:28,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:28,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:28,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:28,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:28,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:28,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:28,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:28,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:28,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:28,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:28,863 INFO L87 Difference]: Start difference. First operand 40898 states and 147668 transitions. Second operand 6 states. [2018-11-28 20:20:30,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:30,002 INFO L93 Difference]: Finished difference Result 56599 states and 201648 transitions. [2018-11-28 20:20:30,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:20:30,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-11-28 20:20:30,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:30,130 INFO L225 Difference]: With dead ends: 56599 [2018-11-28 20:20:30,130 INFO L226 Difference]: Without dead ends: 55460 [2018-11-28 20:20:30,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:20:33,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55460 states. [2018-11-28 20:20:33,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55460 to 51955. [2018-11-28 20:20:33,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51955 states. [2018-11-28 20:20:34,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51955 states to 51955 states and 186007 transitions. [2018-11-28 20:20:34,020 INFO L78 Accepts]: Start accepts. Automaton has 51955 states and 186007 transitions. Word has length 54 [2018-11-28 20:20:34,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:34,021 INFO L480 AbstractCegarLoop]: Abstraction has 51955 states and 186007 transitions. [2018-11-28 20:20:34,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:34,021 INFO L276 IsEmpty]: Start isEmpty. Operand 51955 states and 186007 transitions. [2018-11-28 20:20:34,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 20:20:34,040 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:34,040 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] [2018-11-28 20:20:34,041 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:34,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:34,043 INFO L82 PathProgramCache]: Analyzing trace with hash 582657366, now seen corresponding path program 1 times [2018-11-28 20:20:34,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:34,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:34,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:34,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:34,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:34,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:34,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:20:34,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:20:34,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:20:34,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:34,577 INFO L87 Difference]: Start difference. First operand 51955 states and 186007 transitions. Second operand 7 states. [2018-11-28 20:20:35,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:35,824 INFO L93 Difference]: Finished difference Result 75638 states and 260104 transitions. [2018-11-28 20:20:35,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 20:20:35,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-11-28 20:20:35,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:36,006 INFO L225 Difference]: With dead ends: 75638 [2018-11-28 20:20:36,006 INFO L226 Difference]: Without dead ends: 75638 [2018-11-28 20:20:36,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:20:36,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75638 states. [2018-11-28 20:20:37,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75638 to 61473. [2018-11-28 20:20:37,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61473 states. [2018-11-28 20:20:37,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61473 states to 61473 states and 215184 transitions. [2018-11-28 20:20:37,862 INFO L78 Accepts]: Start accepts. Automaton has 61473 states and 215184 transitions. Word has length 54 [2018-11-28 20:20:37,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:37,863 INFO L480 AbstractCegarLoop]: Abstraction has 61473 states and 215184 transitions. [2018-11-28 20:20:37,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:20:37,863 INFO L276 IsEmpty]: Start isEmpty. Operand 61473 states and 215184 transitions. [2018-11-28 20:20:37,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 20:20:37,877 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:37,877 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] [2018-11-28 20:20:37,877 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:37,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:37,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1470161047, now seen corresponding path program 1 times [2018-11-28 20:20:37,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:37,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:37,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:37,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:37,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:37,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:37,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:20:37,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:20:37,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:20:37,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:20:37,976 INFO L87 Difference]: Start difference. First operand 61473 states and 215184 transitions. Second operand 3 states. [2018-11-28 20:20:38,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:38,276 INFO L93 Difference]: Finished difference Result 46767 states and 162434 transitions. [2018-11-28 20:20:38,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:20:38,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-11-28 20:20:38,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:38,368 INFO L225 Difference]: With dead ends: 46767 [2018-11-28 20:20:38,368 INFO L226 Difference]: Without dead ends: 46187 [2018-11-28 20:20:38,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:20:38,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46187 states. [2018-11-28 20:20:39,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46187 to 44422. [2018-11-28 20:20:39,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44422 states. [2018-11-28 20:20:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44422 states to 44422 states and 155155 transitions. [2018-11-28 20:20:39,166 INFO L78 Accepts]: Start accepts. Automaton has 44422 states and 155155 transitions. Word has length 54 [2018-11-28 20:20:39,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:39,166 INFO L480 AbstractCegarLoop]: Abstraction has 44422 states and 155155 transitions. [2018-11-28 20:20:39,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:20:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 44422 states and 155155 transitions. [2018-11-28 20:20:39,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 20:20:39,178 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:39,178 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] [2018-11-28 20:20:39,179 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:39,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:39,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1915106411, now seen corresponding path program 1 times [2018-11-28 20:20:39,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:39,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:39,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:39,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:39,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:39,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:39,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:39,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:39,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:39,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:39,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:39,424 INFO L87 Difference]: Start difference. First operand 44422 states and 155155 transitions. Second operand 6 states. [2018-11-28 20:20:40,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:40,352 INFO L93 Difference]: Finished difference Result 58724 states and 198370 transitions. [2018-11-28 20:20:40,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:20:40,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-28 20:20:40,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:40,476 INFO L225 Difference]: With dead ends: 58724 [2018-11-28 20:20:40,476 INFO L226 Difference]: Without dead ends: 58724 [2018-11-28 20:20:40,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:20:40,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58724 states. [2018-11-28 20:20:41,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58724 to 48778. [2018-11-28 20:20:41,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48778 states. [2018-11-28 20:20:42,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48778 states to 48778 states and 167871 transitions. [2018-11-28 20:20:42,018 INFO L78 Accepts]: Start accepts. Automaton has 48778 states and 167871 transitions. Word has length 55 [2018-11-28 20:20:42,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:42,019 INFO L480 AbstractCegarLoop]: Abstraction has 48778 states and 167871 transitions. [2018-11-28 20:20:42,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:42,019 INFO L276 IsEmpty]: Start isEmpty. Operand 48778 states and 167871 transitions. [2018-11-28 20:20:42,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 20:20:42,030 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:42,030 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] [2018-11-28 20:20:42,030 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:42,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:42,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1027602730, now seen corresponding path program 1 times [2018-11-28 20:20:42,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:42,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:42,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:42,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:42,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:42,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 20:20:42,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:42,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:42,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:42,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:42,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:42,194 INFO L87 Difference]: Start difference. First operand 48778 states and 167871 transitions. Second operand 4 states. [2018-11-28 20:20:42,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:42,512 INFO L93 Difference]: Finished difference Result 10152 states and 31522 transitions. [2018-11-28 20:20:42,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:20:42,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-11-28 20:20:42,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:42,531 INFO L225 Difference]: With dead ends: 10152 [2018-11-28 20:20:42,532 INFO L226 Difference]: Without dead ends: 8646 [2018-11-28 20:20:42,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:42,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8646 states. [2018-11-28 20:20:42,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8646 to 8598. [2018-11-28 20:20:42,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8598 states. [2018-11-28 20:20:42,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8598 states to 8598 states and 26467 transitions. [2018-11-28 20:20:42,686 INFO L78 Accepts]: Start accepts. Automaton has 8598 states and 26467 transitions. Word has length 55 [2018-11-28 20:20:42,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:42,687 INFO L480 AbstractCegarLoop]: Abstraction has 8598 states and 26467 transitions. [2018-11-28 20:20:42,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:20:42,687 INFO L276 IsEmpty]: Start isEmpty. Operand 8598 states and 26467 transitions. [2018-11-28 20:20:42,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 20:20:42,694 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:42,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:42,694 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:42,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:42,694 INFO L82 PathProgramCache]: Analyzing trace with hash 2067258406, now seen corresponding path program 1 times [2018-11-28 20:20:42,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:42,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:42,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:42,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:42,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:42,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:42,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:42,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:42,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:42,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:42,908 INFO L87 Difference]: Start difference. First operand 8598 states and 26467 transitions. Second operand 4 states. [2018-11-28 20:20:43,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:43,172 INFO L93 Difference]: Finished difference Result 10217 states and 31174 transitions. [2018-11-28 20:20:43,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:20:43,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-28 20:20:43,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:43,187 INFO L225 Difference]: With dead ends: 10217 [2018-11-28 20:20:43,187 INFO L226 Difference]: Without dead ends: 10217 [2018-11-28 20:20:43,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 20:20:43,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10217 states. [2018-11-28 20:20:43,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10217 to 9249. [2018-11-28 20:20:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9249 states. [2018-11-28 20:20:43,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9249 states to 9249 states and 28328 transitions. [2018-11-28 20:20:43,311 INFO L78 Accepts]: Start accepts. Automaton has 9249 states and 28328 transitions. Word has length 64 [2018-11-28 20:20:43,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:43,311 INFO L480 AbstractCegarLoop]: Abstraction has 9249 states and 28328 transitions. [2018-11-28 20:20:43,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:20:43,311 INFO L276 IsEmpty]: Start isEmpty. Operand 9249 states and 28328 transitions. [2018-11-28 20:20:43,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 20:20:43,316 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:43,317 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 20:20:43,317 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:43,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:43,317 INFO L82 PathProgramCache]: Analyzing trace with hash -484898555, now seen corresponding path program 1 times [2018-11-28 20:20:43,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:43,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:43,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:43,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:43,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:43,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:43,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:43,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:43,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:43,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:43,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:43,428 INFO L87 Difference]: Start difference. First operand 9249 states and 28328 transitions. Second operand 6 states. [2018-11-28 20:20:44,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:44,011 INFO L93 Difference]: Finished difference Result 16143 states and 49321 transitions. [2018-11-28 20:20:44,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 20:20:44,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-28 20:20:44,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:44,036 INFO L225 Difference]: With dead ends: 16143 [2018-11-28 20:20:44,036 INFO L226 Difference]: Without dead ends: 16079 [2018-11-28 20:20:44,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:20:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16079 states. [2018-11-28 20:20:44,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16079 to 10330. [2018-11-28 20:20:44,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10330 states. [2018-11-28 20:20:44,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10330 states to 10330 states and 31497 transitions. [2018-11-28 20:20:44,211 INFO L78 Accepts]: Start accepts. Automaton has 10330 states and 31497 transitions. Word has length 64 [2018-11-28 20:20:44,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:44,211 INFO L480 AbstractCegarLoop]: Abstraction has 10330 states and 31497 transitions. [2018-11-28 20:20:44,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:44,212 INFO L276 IsEmpty]: Start isEmpty. Operand 10330 states and 31497 transitions. [2018-11-28 20:20:44,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 20:20:44,220 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:44,220 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 20:20:44,220 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:44,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:44,221 INFO L82 PathProgramCache]: Analyzing trace with hash 990890537, now seen corresponding path program 1 times [2018-11-28 20:20:44,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:44,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:44,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:44,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:44,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:44,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 20:20:44,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:44,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:44,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:44,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:44,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:44,640 INFO L87 Difference]: Start difference. First operand 10330 states and 31497 transitions. Second operand 6 states. [2018-11-28 20:20:45,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:45,434 INFO L93 Difference]: Finished difference Result 13727 states and 40916 transitions. [2018-11-28 20:20:45,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:20:45,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-28 20:20:45,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:45,456 INFO L225 Difference]: With dead ends: 13727 [2018-11-28 20:20:45,457 INFO L226 Difference]: Without dead ends: 13727 [2018-11-28 20:20:45,457 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 20:20:45,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13727 states. [2018-11-28 20:20:45,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13727 to 13018. [2018-11-28 20:20:45,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13018 states. [2018-11-28 20:20:45,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13018 states to 13018 states and 39085 transitions. [2018-11-28 20:20:45,644 INFO L78 Accepts]: Start accepts. Automaton has 13018 states and 39085 transitions. Word has length 68 [2018-11-28 20:20:45,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:45,645 INFO L480 AbstractCegarLoop]: Abstraction has 13018 states and 39085 transitions. [2018-11-28 20:20:45,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:45,645 INFO L276 IsEmpty]: Start isEmpty. Operand 13018 states and 39085 transitions. [2018-11-28 20:20:45,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 20:20:45,657 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:45,657 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 20:20:45,657 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:45,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:45,658 INFO L82 PathProgramCache]: Analyzing trace with hash -253873944, now seen corresponding path program 1 times [2018-11-28 20:20:45,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:45,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:45,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:45,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:45,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:45,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:45,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:45,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:45,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:45,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:45,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:45,787 INFO L87 Difference]: Start difference. First operand 13018 states and 39085 transitions. Second operand 4 states. [2018-11-28 20:20:46,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:46,034 INFO L93 Difference]: Finished difference Result 16578 states and 49219 transitions. [2018-11-28 20:20:46,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:20:46,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-11-28 20:20:46,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:46,064 INFO L225 Difference]: With dead ends: 16578 [2018-11-28 20:20:46,064 INFO L226 Difference]: Without dead ends: 16578 [2018-11-28 20:20:46,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:46,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16578 states. [2018-11-28 20:20:46,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16578 to 14153. [2018-11-28 20:20:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14153 states. [2018-11-28 20:20:46,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14153 states to 14153 states and 42248 transitions. [2018-11-28 20:20:46,284 INFO L78 Accepts]: Start accepts. Automaton has 14153 states and 42248 transitions. Word has length 68 [2018-11-28 20:20:46,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:46,285 INFO L480 AbstractCegarLoop]: Abstraction has 14153 states and 42248 transitions. [2018-11-28 20:20:46,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:20:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 14153 states and 42248 transitions. [2018-11-28 20:20:46,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 20:20:46,298 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:46,298 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 20:20:46,299 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:46,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:46,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1086318806, now seen corresponding path program 1 times [2018-11-28 20:20:46,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:46,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:46,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:46,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:46,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:46,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:46,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:46,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:46,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:46,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:46,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:46,561 INFO L87 Difference]: Start difference. First operand 14153 states and 42248 transitions. Second operand 6 states. [2018-11-28 20:20:46,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:46,968 INFO L93 Difference]: Finished difference Result 16779 states and 48544 transitions. [2018-11-28 20:20:46,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:20:46,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-28 20:20:46,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:46,997 INFO L225 Difference]: With dead ends: 16779 [2018-11-28 20:20:46,997 INFO L226 Difference]: Without dead ends: 16779 [2018-11-28 20:20:46,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:20:47,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16779 states. [2018-11-28 20:20:47,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16779 to 14089. [2018-11-28 20:20:47,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14089 states. [2018-11-28 20:20:47,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14089 states to 14089 states and 41311 transitions. [2018-11-28 20:20:47,202 INFO L78 Accepts]: Start accepts. Automaton has 14089 states and 41311 transitions. Word has length 68 [2018-11-28 20:20:47,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:47,202 INFO L480 AbstractCegarLoop]: Abstraction has 14089 states and 41311 transitions. [2018-11-28 20:20:47,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:47,202 INFO L276 IsEmpty]: Start isEmpty. Operand 14089 states and 41311 transitions. [2018-11-28 20:20:47,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 20:20:47,211 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:47,212 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 20:20:47,212 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:47,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:47,212 INFO L82 PathProgramCache]: Analyzing trace with hash -874967893, now seen corresponding path program 1 times [2018-11-28 20:20:47,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:47,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:47,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:47,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:47,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:47,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:47,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:47,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:20:47,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:20:47,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:20:47,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:47,389 INFO L87 Difference]: Start difference. First operand 14089 states and 41311 transitions. Second operand 5 states. [2018-11-28 20:20:47,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:47,820 INFO L93 Difference]: Finished difference Result 17352 states and 50546 transitions. [2018-11-28 20:20:47,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:20:47,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-28 20:20:47,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:47,845 INFO L225 Difference]: With dead ends: 17352 [2018-11-28 20:20:47,845 INFO L226 Difference]: Without dead ends: 17352 [2018-11-28 20:20:47,845 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 20:20:47,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17352 states. [2018-11-28 20:20:48,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17352 to 15080. [2018-11-28 20:20:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15080 states. [2018-11-28 20:20:48,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15080 states to 15080 states and 43876 transitions. [2018-11-28 20:20:48,043 INFO L78 Accepts]: Start accepts. Automaton has 15080 states and 43876 transitions. Word has length 68 [2018-11-28 20:20:48,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:48,044 INFO L480 AbstractCegarLoop]: Abstraction has 15080 states and 43876 transitions. [2018-11-28 20:20:48,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:20:48,044 INFO L276 IsEmpty]: Start isEmpty. Operand 15080 states and 43876 transitions. [2018-11-28 20:20:48,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 20:20:48,053 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:48,053 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 20:20:48,054 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:48,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:48,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1385502070, now seen corresponding path program 1 times [2018-11-28 20:20:48,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:48,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:48,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:48,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:48,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:48,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:48,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:48,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:48,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:48,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:48,213 INFO L87 Difference]: Start difference. First operand 15080 states and 43876 transitions. Second operand 6 states. [2018-11-28 20:20:49,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:49,096 INFO L93 Difference]: Finished difference Result 23712 states and 68586 transitions. [2018-11-28 20:20:49,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:20:49,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-28 20:20:49,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:49,131 INFO L225 Difference]: With dead ends: 23712 [2018-11-28 20:20:49,131 INFO L226 Difference]: Without dead ends: 23712 [2018-11-28 20:20:49,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:20:49,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23712 states. [2018-11-28 20:20:49,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23712 to 19436. [2018-11-28 20:20:49,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19436 states. [2018-11-28 20:20:49,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19436 states to 19436 states and 56779 transitions. [2018-11-28 20:20:49,413 INFO L78 Accepts]: Start accepts. Automaton has 19436 states and 56779 transitions. Word has length 68 [2018-11-28 20:20:49,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:49,414 INFO L480 AbstractCegarLoop]: Abstraction has 19436 states and 56779 transitions. [2018-11-28 20:20:49,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:49,414 INFO L276 IsEmpty]: Start isEmpty. Operand 19436 states and 56779 transitions. [2018-11-28 20:20:49,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 20:20:49,425 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:49,425 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 20:20:49,425 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:49,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:49,426 INFO L82 PathProgramCache]: Analyzing trace with hash -497998389, now seen corresponding path program 1 times [2018-11-28 20:20:49,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:49,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:49,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:49,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:49,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:49,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:49,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:49,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:49,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:49,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:49,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:49,561 INFO L87 Difference]: Start difference. First operand 19436 states and 56779 transitions. Second operand 4 states. [2018-11-28 20:20:50,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:50,004 INFO L93 Difference]: Finished difference Result 20064 states and 58266 transitions. [2018-11-28 20:20:50,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:20:50,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-11-28 20:20:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:50,033 INFO L225 Difference]: With dead ends: 20064 [2018-11-28 20:20:50,034 INFO L226 Difference]: Without dead ends: 19360 [2018-11-28 20:20:50,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 20:20:50,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19360 states. [2018-11-28 20:20:50,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19360 to 18392. [2018-11-28 20:20:50,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18392 states. [2018-11-28 20:20:50,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18392 states to 18392 states and 53455 transitions. [2018-11-28 20:20:50,293 INFO L78 Accepts]: Start accepts. Automaton has 18392 states and 53455 transitions. Word has length 68 [2018-11-28 20:20:50,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:50,294 INFO L480 AbstractCegarLoop]: Abstraction has 18392 states and 53455 transitions. [2018-11-28 20:20:50,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:20:50,294 INFO L276 IsEmpty]: Start isEmpty. Operand 18392 states and 53455 transitions. [2018-11-28 20:20:50,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 20:20:50,307 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:50,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:50,308 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:50,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:50,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1112513867, now seen corresponding path program 1 times [2018-11-28 20:20:50,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:50,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:50,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:50,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:50,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:50,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:50,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:50,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:20:50,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:20:50,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:20:50,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:20:50,683 INFO L87 Difference]: Start difference. First operand 18392 states and 53455 transitions. Second operand 9 states. [2018-11-28 20:20:51,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:51,390 INFO L93 Difference]: Finished difference Result 26124 states and 75518 transitions. [2018-11-28 20:20:51,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:20:51,391 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-11-28 20:20:51,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:51,428 INFO L225 Difference]: With dead ends: 26124 [2018-11-28 20:20:51,428 INFO L226 Difference]: Without dead ends: 26124 [2018-11-28 20:20:51,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:20:51,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26124 states. [2018-11-28 20:20:51,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26124 to 21225. [2018-11-28 20:20:51,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21225 states. [2018-11-28 20:20:51,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21225 states to 21225 states and 61505 transitions. [2018-11-28 20:20:51,718 INFO L78 Accepts]: Start accepts. Automaton has 21225 states and 61505 transitions. Word has length 68 [2018-11-28 20:20:51,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:51,718 INFO L480 AbstractCegarLoop]: Abstraction has 21225 states and 61505 transitions. [2018-11-28 20:20:51,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:20:51,718 INFO L276 IsEmpty]: Start isEmpty. Operand 21225 states and 61505 transitions. [2018-11-28 20:20:51,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 20:20:51,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:51,732 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 20:20:51,732 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:51,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:51,732 INFO L82 PathProgramCache]: Analyzing trace with hash 2000017548, now seen corresponding path program 1 times [2018-11-28 20:20:51,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:51,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:51,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:51,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:51,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:51,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:51,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:20:51,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:20:51,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:20:51,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:51,813 INFO L87 Difference]: Start difference. First operand 21225 states and 61505 transitions. Second operand 5 states. [2018-11-28 20:20:52,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:52,007 INFO L93 Difference]: Finished difference Result 5849 states and 14057 transitions. [2018-11-28 20:20:52,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:20:52,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-28 20:20:52,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:52,016 INFO L225 Difference]: With dead ends: 5849 [2018-11-28 20:20:52,016 INFO L226 Difference]: Without dead ends: 4653 [2018-11-28 20:20:52,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:52,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4653 states. [2018-11-28 20:20:52,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4653 to 3961. [2018-11-28 20:20:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3961 states. [2018-11-28 20:20:52,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3961 states to 3961 states and 9298 transitions. [2018-11-28 20:20:52,080 INFO L78 Accepts]: Start accepts. Automaton has 3961 states and 9298 transitions. Word has length 68 [2018-11-28 20:20:52,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:52,081 INFO L480 AbstractCegarLoop]: Abstraction has 3961 states and 9298 transitions. [2018-11-28 20:20:52,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:20:52,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3961 states and 9298 transitions. [2018-11-28 20:20:52,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:20:52,088 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:52,089 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] [2018-11-28 20:20:52,089 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:52,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:52,089 INFO L82 PathProgramCache]: Analyzing trace with hash -901530196, now seen corresponding path program 1 times [2018-11-28 20:20:52,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:52,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:52,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:52,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:52,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:52,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:52,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:52,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:52,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:52,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:52,310 INFO L87 Difference]: Start difference. First operand 3961 states and 9298 transitions. Second operand 4 states. [2018-11-28 20:20:52,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:52,616 INFO L93 Difference]: Finished difference Result 3881 states and 9066 transitions. [2018-11-28 20:20:52,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:20:52,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-11-28 20:20:52,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:52,624 INFO L225 Difference]: With dead ends: 3881 [2018-11-28 20:20:52,624 INFO L226 Difference]: Without dead ends: 3881 [2018-11-28 20:20:52,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3881 states. [2018-11-28 20:20:52,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3881 to 3384. [2018-11-28 20:20:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3384 states. [2018-11-28 20:20:52,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 3384 states and 7916 transitions. [2018-11-28 20:20:52,679 INFO L78 Accepts]: Start accepts. Automaton has 3384 states and 7916 transitions. Word has length 85 [2018-11-28 20:20:52,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:52,680 INFO L480 AbstractCegarLoop]: Abstraction has 3384 states and 7916 transitions. [2018-11-28 20:20:52,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:20:52,680 INFO L276 IsEmpty]: Start isEmpty. Operand 3384 states and 7916 transitions. [2018-11-28 20:20:52,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:20:52,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:52,690 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] [2018-11-28 20:20:52,690 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:52,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:52,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1085951564, now seen corresponding path program 1 times [2018-11-28 20:20:52,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:52,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:52,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:52,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:52,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:53,257 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 6 [2018-11-28 20:20:53,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:53,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:53,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:20:53,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:20:53,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:20:53,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:53,341 INFO L87 Difference]: Start difference. First operand 3384 states and 7916 transitions. Second operand 5 states. [2018-11-28 20:20:53,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:53,722 INFO L93 Difference]: Finished difference Result 3384 states and 7900 transitions. [2018-11-28 20:20:53,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:20:53,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2018-11-28 20:20:53,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:53,729 INFO L225 Difference]: With dead ends: 3384 [2018-11-28 20:20:53,729 INFO L226 Difference]: Without dead ends: 3384 [2018-11-28 20:20:53,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2018-11-28 20:20:53,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 2958. [2018-11-28 20:20:53,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2958 states. [2018-11-28 20:20:53,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 6888 transitions. [2018-11-28 20:20:53,777 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 6888 transitions. Word has length 85 [2018-11-28 20:20:53,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:53,778 INFO L480 AbstractCegarLoop]: Abstraction has 2958 states and 6888 transitions. [2018-11-28 20:20:53,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:20:53,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 6888 transitions. [2018-11-28 20:20:53,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:20:53,784 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:53,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:53,785 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:53,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:53,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1973455245, now seen corresponding path program 1 times [2018-11-28 20:20:53,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:53,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:53,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:53,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:53,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:54,054 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 20:20:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:54,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:54,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 20:20:54,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 20:20:54,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 20:20:54,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:20:54,129 INFO L87 Difference]: Start difference. First operand 2958 states and 6888 transitions. Second operand 10 states. [2018-11-28 20:20:55,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:55,746 INFO L93 Difference]: Finished difference Result 5014 states and 11654 transitions. [2018-11-28 20:20:55,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:20:55,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-11-28 20:20:55,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:55,753 INFO L225 Difference]: With dead ends: 5014 [2018-11-28 20:20:55,753 INFO L226 Difference]: Without dead ends: 3506 [2018-11-28 20:20:55,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-11-28 20:20:55,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2018-11-28 20:20:55,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3031. [2018-11-28 20:20:55,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3031 states. [2018-11-28 20:20:55,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 6990 transitions. [2018-11-28 20:20:55,784 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 6990 transitions. Word has length 85 [2018-11-28 20:20:55,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:55,784 INFO L480 AbstractCegarLoop]: Abstraction has 3031 states and 6990 transitions. [2018-11-28 20:20:55,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 20:20:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 6990 transitions. [2018-11-28 20:20:55,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:20:55,787 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:55,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:55,788 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:55,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:55,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1532642072, now seen corresponding path program 1 times [2018-11-28 20:20:55,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:55,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:55,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:55,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:55,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:56,185 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 20:20:56,472 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-11-28 20:20:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:56,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:56,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:56,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:56,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:56,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:56,483 INFO L87 Difference]: Start difference. First operand 3031 states and 6990 transitions. Second operand 6 states. [2018-11-28 20:20:56,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:56,740 INFO L93 Difference]: Finished difference Result 3507 states and 7993 transitions. [2018-11-28 20:20:56,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:20:56,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-11-28 20:20:56,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:56,745 INFO L225 Difference]: With dead ends: 3507 [2018-11-28 20:20:56,746 INFO L226 Difference]: Without dead ends: 3453 [2018-11-28 20:20:56,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:56,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3453 states. [2018-11-28 20:20:56,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3453 to 3048. [2018-11-28 20:20:56,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3048 states. [2018-11-28 20:20:56,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 6969 transitions. [2018-11-28 20:20:56,779 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 6969 transitions. Word has length 85 [2018-11-28 20:20:56,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:56,779 INFO L480 AbstractCegarLoop]: Abstraction has 3048 states and 6969 transitions. [2018-11-28 20:20:56,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:56,779 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 6969 transitions. [2018-11-28 20:20:56,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:20:56,784 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:56,784 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] [2018-11-28 20:20:56,784 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:56,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:56,785 INFO L82 PathProgramCache]: Analyzing trace with hash -544567271, now seen corresponding path program 2 times [2018-11-28 20:20:56,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:56,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:56,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:56,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:56,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:57,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:57,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:57,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 20:20:57,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 20:20:57,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 20:20:57,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:20:57,018 INFO L87 Difference]: Start difference. First operand 3048 states and 6969 transitions. Second operand 10 states. [2018-11-28 20:20:57,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:57,863 INFO L93 Difference]: Finished difference Result 5878 states and 13478 transitions. [2018-11-28 20:20:57,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:20:57,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-11-28 20:20:57,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:57,868 INFO L225 Difference]: With dead ends: 5878 [2018-11-28 20:20:57,868 INFO L226 Difference]: Without dead ends: 2287 [2018-11-28 20:20:57,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-28 20:20:57,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2018-11-28 20:20:57,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 2287. [2018-11-28 20:20:57,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2287 states. [2018-11-28 20:20:57,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 5233 transitions. [2018-11-28 20:20:57,891 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 5233 transitions. Word has length 85 [2018-11-28 20:20:57,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:57,892 INFO L480 AbstractCegarLoop]: Abstraction has 2287 states and 5233 transitions. [2018-11-28 20:20:57,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 20:20:57,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 5233 transitions. [2018-11-28 20:20:57,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:20:57,895 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:57,895 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] [2018-11-28 20:20:57,895 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:57,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:57,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1942685255, now seen corresponding path program 3 times [2018-11-28 20:20:57,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:57,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:57,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:57,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:20:57,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:58,169 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 20:20:58,344 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-28 20:20:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:58,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:58,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 20:20:58,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 20:20:58,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 20:20:58,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:20:58,424 INFO L87 Difference]: Start difference. First operand 2287 states and 5233 transitions. Second operand 11 states. [2018-11-28 20:20:59,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:59,433 INFO L93 Difference]: Finished difference Result 3776 states and 8669 transitions. [2018-11-28 20:20:59,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:20:59,434 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-11-28 20:20:59,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:59,438 INFO L225 Difference]: With dead ends: 3776 [2018-11-28 20:20:59,438 INFO L226 Difference]: Without dead ends: 2473 [2018-11-28 20:20:59,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-11-28 20:20:59,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2018-11-28 20:20:59,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2267. [2018-11-28 20:20:59,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2018-11-28 20:20:59,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 5191 transitions. [2018-11-28 20:20:59,463 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 5191 transitions. Word has length 85 [2018-11-28 20:20:59,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:59,464 INFO L480 AbstractCegarLoop]: Abstraction has 2267 states and 5191 transitions. [2018-11-28 20:20:59,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 20:20:59,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 5191 transitions. [2018-11-28 20:20:59,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:20:59,468 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:59,468 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] [2018-11-28 20:20:59,468 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:59,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:59,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1542877223, now seen corresponding path program 4 times [2018-11-28 20:20:59,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:59,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:59,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:59,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:20:59,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:20:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:20:59,556 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 20:20:59,760 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 20:20:59,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:20:59 BasicIcfg [2018-11-28 20:20:59,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 20:20:59,767 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 20:20:59,767 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 20:20:59,768 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 20:20:59,768 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:10" (3/4) ... [2018-11-28 20:20:59,778 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 20:20:59,969 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 20:20:59,969 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 20:20:59,971 INFO L168 Benchmark]: Toolchain (without parser) took 51875.09 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.7 GB). Free memory was 946.0 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-11-28 20:20:59,972 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:20:59,972 INFO L168 Benchmark]: CACSL2BoogieTranslator took 907.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-11-28 20:20:59,972 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 20:20:59,973 INFO L168 Benchmark]: Boogie Preprocessor took 41.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:20:59,973 INFO L168 Benchmark]: RCFGBuilder took 1305.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 11.5 GB. [2018-11-28 20:20:59,973 INFO L168 Benchmark]: TraceAbstraction took 49318.23 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2018-11-28 20:20:59,974 INFO L168 Benchmark]: Witness Printer took 201.78 ms. Allocated memory is still 4.7 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:20:59,979 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 907.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1305.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49318.23 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 201.78 ms. Allocated memory is still 4.7 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L691] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L692] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t1653; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1653, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] -1 pthread_t t1654; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] FCALL, FORK -1 pthread_create(&t1654, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 y$w_buff1 = y$w_buff0 [L737] 0 y$w_buff0 = 1 [L738] 0 y$w_buff1_used = y$w_buff0_used [L739] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 0 y$r_buff0_thd2 = (_Bool)1 [L747] 0 z = 1 [L750] 0 __unbuffered_p1_EAX = z [L753] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L706] 1 x = 1 [L711] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L712] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L713] 1 y$flush_delayed = weak$$choice2 [L714] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L715] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L715] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L716] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L716] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L717] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L717] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L719] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L719] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L720] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L721] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L721] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L722] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 1 y = y$flush_delayed ? y$mem_tmp : y [L724] 1 y$flush_delayed = (_Bool)0 [L729] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 3 error locations. UNSAFE Result, 49.1s OverallTime, 27 OverallIterations, 1 TraceHistogramMax, 21.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6870 SDtfs, 9224 SDslu, 16526 SDs, 0 SdLazy, 7318 SolverSat, 433 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 67 SyntacticMatches, 15 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61473occurred in iteration=7, 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: 18.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 147487 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 1777 NumberOfCodeBlocks, 1777 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1666 ConstructedInterpolants, 0 QuantifiedInterpolants, 315503 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...