./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe033_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/safe033_rmo.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 54f74d2fd797ff981915538941a4cb9058547fcb ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 00:44:36,064 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 00:44:36,066 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 00:44:36,079 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 00:44:36,080 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 00:44:36,081 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 00:44:36,083 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 00:44:36,086 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 00:44:36,088 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 00:44:36,089 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 00:44:36,091 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 00:44:36,091 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 00:44:36,092 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 00:44:36,093 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 00:44:36,095 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 00:44:36,096 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 00:44:36,097 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 00:44:36,099 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 00:44:36,101 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 00:44:36,103 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 00:44:36,105 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 00:44:36,106 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 00:44:36,109 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 00:44:36,110 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 00:44:36,110 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 00:44:36,111 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 00:44:36,113 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 00:44:36,114 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 00:44:36,114 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 00:44:36,116 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 00:44:36,120 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 00:44:36,121 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 00:44:36,121 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 00:44:36,121 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 00:44:36,126 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 00:44:36,126 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 00:44:36,128 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-01 00:44:36,164 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 00:44:36,165 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 00:44:36,166 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 00:44:36,167 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 00:44:36,167 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 00:44:36,167 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 00:44:36,167 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 00:44:36,167 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 00:44:36,168 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 00:44:36,168 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 00:44:36,168 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 00:44:36,168 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 00:44:36,168 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 00:44:36,168 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 00:44:36,169 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 00:44:36,169 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 00:44:36,169 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 00:44:36,169 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 00:44:36,169 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 00:44:36,169 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 00:44:36,170 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 00:44:36,170 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:44:36,170 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 00:44:36,170 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 00:44:36,170 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 00:44:36,170 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 00:44:36,171 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 00:44:36,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 00:44:36,171 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 -> 54f74d2fd797ff981915538941a4cb9058547fcb [2019-01-01 00:44:36,210 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 00:44:36,224 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 00:44:36,228 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 00:44:36,230 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 00:44:36,230 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 00:44:36,231 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe033_rmo.opt_false-unreach-call.i [2019-01-01 00:44:36,297 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/741336b7b/a8dc1667313c489ab640528bae1a2169/FLAG27ca2320b [2019-01-01 00:44:36,913 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 00:44:36,917 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe033_rmo.opt_false-unreach-call.i [2019-01-01 00:44:36,947 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/741336b7b/a8dc1667313c489ab640528bae1a2169/FLAG27ca2320b [2019-01-01 00:44:37,124 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/741336b7b/a8dc1667313c489ab640528bae1a2169 [2019-01-01 00:44:37,129 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 00:44:37,130 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 00:44:37,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 00:44:37,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 00:44:37,136 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 00:44:37,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:44:37" (1/1) ... [2019-01-01 00:44:37,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@488d0b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:44:37, skipping insertion in model container [2019-01-01 00:44:37,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:44:37" (1/1) ... [2019-01-01 00:44:37,150 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 00:44:37,203 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 00:44:37,730 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:44:37,754 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 00:44:37,898 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:44:37,983 INFO L195 MainTranslator]: Completed translation [2019-01-01 00:44:37,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:44:37 WrapperNode [2019-01-01 00:44:37,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 00:44:37,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 00:44:37,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 00:44:37,985 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 00:44:37,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:44:37" (1/1) ... [2019-01-01 00:44:38,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:44:37" (1/1) ... [2019-01-01 00:44:38,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 00:44:38,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 00:44:38,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 00:44:38,068 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 00:44:38,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:44:37" (1/1) ... [2019-01-01 00:44:38,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:44:37" (1/1) ... [2019-01-01 00:44:38,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:44:37" (1/1) ... [2019-01-01 00:44:38,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:44:37" (1/1) ... [2019-01-01 00:44:38,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:44:37" (1/1) ... [2019-01-01 00:44:38,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:44:37" (1/1) ... [2019-01-01 00:44:38,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:44:37" (1/1) ... [2019-01-01 00:44:38,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 00:44:38,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 00:44:38,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 00:44:38,109 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 00:44:38,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:44:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:44:38,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 00:44:38,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-01 00:44:38,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 00:44:38,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 00:44:38,205 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-01 00:44:38,205 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-01 00:44:38,205 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-01 00:44:38,205 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-01 00:44:38,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-01 00:44:38,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 00:44:38,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 00:44:38,207 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-01 00:44:39,333 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 00:44:39,334 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 00:44:39,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:44:39 BoogieIcfgContainer [2019-01-01 00:44:39,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 00:44:39,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 00:44:39,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 00:44:39,339 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 00:44:39,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 12:44:37" (1/3) ... [2019-01-01 00:44:39,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a83808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:44:39, skipping insertion in model container [2019-01-01 00:44:39,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:44:37" (2/3) ... [2019-01-01 00:44:39,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a83808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:44:39, skipping insertion in model container [2019-01-01 00:44:39,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:44:39" (3/3) ... [2019-01-01 00:44:39,345 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_rmo.opt_false-unreach-call.i [2019-01-01 00:44:39,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,406 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,407 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,411 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,411 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,411 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,411 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,412 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,414 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,414 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,414 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,414 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,414 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,414 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,415 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,415 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,415 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,415 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,416 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,416 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,416 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,416 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,417 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,417 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,417 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,417 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,417 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,418 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,418 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,418 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,418 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,418 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,420 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,420 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,420 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,420 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,420 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,421 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,421 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,421 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,421 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,422 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,422 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,422 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,422 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,422 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,423 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,427 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,427 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,427 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,428 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,428 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,429 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,430 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,431 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,432 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,433 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,433 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,433 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,433 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,434 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,434 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,434 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,434 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,434 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,434 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:44:39,461 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-01 00:44:39,461 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 00:44:39,472 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-01 00:44:39,494 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-01 00:44:39,519 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 00:44:39,520 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 00:44:39,520 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 00:44:39,520 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 00:44:39,520 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 00:44:39,520 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 00:44:39,521 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 00:44:39,521 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 00:44:39,521 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 00:44:39,536 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 129places, 161 transitions [2019-01-01 00:44:41,461 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27853 states. [2019-01-01 00:44:41,464 INFO L276 IsEmpty]: Start isEmpty. Operand 27853 states. [2019-01-01 00:44:41,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-01 00:44:41,477 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:44:41,478 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] [2019-01-01 00:44:41,480 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:44:41,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:44:41,486 INFO L82 PathProgramCache]: Analyzing trace with hash -743892383, now seen corresponding path program 1 times [2019-01-01 00:44:41,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:44:41,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:44:41,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:41,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:44:41,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:44:41,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:44:41,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:44:41,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:44:41,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:44:41,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:44:41,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:44:41,894 INFO L87 Difference]: Start difference. First operand 27853 states. Second operand 4 states. [2019-01-01 00:44:43,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:44:43,048 INFO L93 Difference]: Finished difference Result 47765 states and 183116 transitions. [2019-01-01 00:44:43,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:44:43,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-01-01 00:44:43,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:44:43,423 INFO L225 Difference]: With dead ends: 47765 [2019-01-01 00:44:43,423 INFO L226 Difference]: Without dead ends: 34605 [2019-01-01 00:44:43,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:44:44,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34605 states. [2019-01-01 00:44:44,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34605 to 21753. [2019-01-01 00:44:44,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21753 states. [2019-01-01 00:44:45,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21753 states to 21753 states and 83438 transitions. [2019-01-01 00:44:45,114 INFO L78 Accepts]: Start accepts. Automaton has 21753 states and 83438 transitions. Word has length 36 [2019-01-01 00:44:45,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:44:45,116 INFO L480 AbstractCegarLoop]: Abstraction has 21753 states and 83438 transitions. [2019-01-01 00:44:45,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:44:45,116 INFO L276 IsEmpty]: Start isEmpty. Operand 21753 states and 83438 transitions. [2019-01-01 00:44:45,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-01 00:44:45,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:44:45,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:44:45,135 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:44:45,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:44:45,137 INFO L82 PathProgramCache]: Analyzing trace with hash 243022970, now seen corresponding path program 1 times [2019-01-01 00:44:45,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:44:45,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:44:45,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:45,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:44:45,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:44:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:44:45,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:44:45,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:44:45,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:44:45,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:44:45,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:44:45,381 INFO L87 Difference]: Start difference. First operand 21753 states and 83438 transitions. Second operand 4 states. [2019-01-01 00:44:45,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:44:45,779 INFO L93 Difference]: Finished difference Result 7167 states and 23623 transitions. [2019-01-01 00:44:45,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:44:45,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-01-01 00:44:45,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:44:45,808 INFO L225 Difference]: With dead ends: 7167 [2019-01-01 00:44:45,808 INFO L226 Difference]: Without dead ends: 6321 [2019-01-01 00:44:45,809 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 [2019-01-01 00:44:45,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6321 states. [2019-01-01 00:44:45,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6321 to 6321. [2019-01-01 00:44:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6321 states. [2019-01-01 00:44:46,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6321 states to 6321 states and 20695 transitions. [2019-01-01 00:44:46,049 INFO L78 Accepts]: Start accepts. Automaton has 6321 states and 20695 transitions. Word has length 44 [2019-01-01 00:44:46,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:44:46,051 INFO L480 AbstractCegarLoop]: Abstraction has 6321 states and 20695 transitions. [2019-01-01 00:44:46,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:44:46,053 INFO L276 IsEmpty]: Start isEmpty. Operand 6321 states and 20695 transitions. [2019-01-01 00:44:46,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-01 00:44:46,057 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:44:46,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:44:46,058 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:44:46,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:44:46,058 INFO L82 PathProgramCache]: Analyzing trace with hash -69776966, now seen corresponding path program 1 times [2019-01-01 00:44:46,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:44:46,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:44:46,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:46,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:44:46,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:44:46,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:44:46,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:44:46,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:44:46,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:44:46,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:44:46,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:44:46,427 INFO L87 Difference]: Start difference. First operand 6321 states and 20695 transitions. Second operand 5 states. [2019-01-01 00:44:47,463 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-01-01 00:44:48,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:44:48,614 INFO L93 Difference]: Finished difference Result 12017 states and 38781 transitions. [2019-01-01 00:44:48,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:44:48,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-01-01 00:44:48,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:44:48,660 INFO L225 Difference]: With dead ends: 12017 [2019-01-01 00:44:48,660 INFO L226 Difference]: Without dead ends: 11942 [2019-01-01 00:44:48,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:44:48,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11942 states. [2019-01-01 00:44:48,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11942 to 8286. [2019-01-01 00:44:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8286 states. [2019-01-01 00:44:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8286 states to 8286 states and 26548 transitions. [2019-01-01 00:44:48,941 INFO L78 Accepts]: Start accepts. Automaton has 8286 states and 26548 transitions. Word has length 45 [2019-01-01 00:44:48,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:44:48,942 INFO L480 AbstractCegarLoop]: Abstraction has 8286 states and 26548 transitions. [2019-01-01 00:44:48,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:44:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 8286 states and 26548 transitions. [2019-01-01 00:44:48,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-01 00:44:48,946 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:44:48,947 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] [2019-01-01 00:44:48,947 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:44:48,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:44:48,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1748582240, now seen corresponding path program 1 times [2019-01-01 00:44:48,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:44:48,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:44:48,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:48,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:44:48,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:44:49,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:44:49,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:44:49,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 00:44:49,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 00:44:49,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 00:44:49,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:44:49,027 INFO L87 Difference]: Start difference. First operand 8286 states and 26548 transitions. Second operand 3 states. [2019-01-01 00:44:49,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:44:49,311 INFO L93 Difference]: Finished difference Result 10982 states and 34703 transitions. [2019-01-01 00:44:49,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 00:44:49,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-01-01 00:44:49,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:44:49,351 INFO L225 Difference]: With dead ends: 10982 [2019-01-01 00:44:49,351 INFO L226 Difference]: Without dead ends: 10978 [2019-01-01 00:44:49,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:44:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10978 states. [2019-01-01 00:44:49,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10978 to 8504. [2019-01-01 00:44:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8504 states. [2019-01-01 00:44:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8504 states to 8504 states and 26984 transitions. [2019-01-01 00:44:49,571 INFO L78 Accepts]: Start accepts. Automaton has 8504 states and 26984 transitions. Word has length 47 [2019-01-01 00:44:49,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:44:49,571 INFO L480 AbstractCegarLoop]: Abstraction has 8504 states and 26984 transitions. [2019-01-01 00:44:49,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 00:44:49,572 INFO L276 IsEmpty]: Start isEmpty. Operand 8504 states and 26984 transitions. [2019-01-01 00:44:49,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-01 00:44:49,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:44:49,575 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] [2019-01-01 00:44:49,576 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:44:49,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:44:49,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1993857643, now seen corresponding path program 1 times [2019-01-01 00:44:49,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:44:49,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:44:49,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:49,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:44:49,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:44:49,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:44:49,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:44:49,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:44:49,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:44:49,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:44:49,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:44:49,729 INFO L87 Difference]: Start difference. First operand 8504 states and 26984 transitions. Second operand 6 states. [2019-01-01 00:44:50,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:44:50,524 INFO L93 Difference]: Finished difference Result 11920 states and 37195 transitions. [2019-01-01 00:44:50,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 00:44:50,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-01-01 00:44:50,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:44:50,567 INFO L225 Difference]: With dead ends: 11920 [2019-01-01 00:44:50,568 INFO L226 Difference]: Without dead ends: 11823 [2019-01-01 00:44:50,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-01 00:44:50,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11823 states. [2019-01-01 00:44:50,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11823 to 9278. [2019-01-01 00:44:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9278 states. [2019-01-01 00:44:51,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9278 states to 9278 states and 29428 transitions. [2019-01-01 00:44:51,152 INFO L78 Accepts]: Start accepts. Automaton has 9278 states and 29428 transitions. Word has length 51 [2019-01-01 00:44:51,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:44:51,153 INFO L480 AbstractCegarLoop]: Abstraction has 9278 states and 29428 transitions. [2019-01-01 00:44:51,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:44:51,153 INFO L276 IsEmpty]: Start isEmpty. Operand 9278 states and 29428 transitions. [2019-01-01 00:44:51,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-01 00:44:51,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:44:51,176 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] [2019-01-01 00:44:51,176 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:44:51,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:44:51,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1315887873, now seen corresponding path program 1 times [2019-01-01 00:44:51,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:44:51,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:44:51,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:51,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:44:51,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:44:51,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:44:51,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:44:51,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:44:51,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:44:51,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:44:51,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:44:51,313 INFO L87 Difference]: Start difference. First operand 9278 states and 29428 transitions. Second operand 5 states. [2019-01-01 00:44:51,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:44:51,467 INFO L93 Difference]: Finished difference Result 2586 states and 6693 transitions. [2019-01-01 00:44:51,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:44:51,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-01-01 00:44:51,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:44:51,474 INFO L225 Difference]: With dead ends: 2586 [2019-01-01 00:44:51,475 INFO L226 Difference]: Without dead ends: 2138 [2019-01-01 00:44:51,475 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 [2019-01-01 00:44:51,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2019-01-01 00:44:51,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 2125. [2019-01-01 00:44:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states. [2019-01-01 00:44:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 5339 transitions. [2019-01-01 00:44:51,518 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 5339 transitions. Word has length 61 [2019-01-01 00:44:51,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:44:51,518 INFO L480 AbstractCegarLoop]: Abstraction has 2125 states and 5339 transitions. [2019-01-01 00:44:51,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:44:51,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 5339 transitions. [2019-01-01 00:44:51,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 00:44:51,526 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:44:51,527 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] [2019-01-01 00:44:51,528 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:44:51,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:44:51,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1710407868, now seen corresponding path program 1 times [2019-01-01 00:44:51,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:44:51,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:44:51,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:51,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:44:51,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:44:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:44:51,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:44:51,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:44:51,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:44:51,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:44:51,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:44:51,804 INFO L87 Difference]: Start difference. First operand 2125 states and 5339 transitions. Second operand 4 states. [2019-01-01 00:44:52,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:44:52,123 INFO L93 Difference]: Finished difference Result 2907 states and 7134 transitions. [2019-01-01 00:44:52,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:44:52,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-01-01 00:44:52,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:44:52,130 INFO L225 Difference]: With dead ends: 2907 [2019-01-01 00:44:52,130 INFO L226 Difference]: Without dead ends: 2907 [2019-01-01 00:44:52,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:44:52,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2019-01-01 00:44:52,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 2488. [2019-01-01 00:44:52,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2488 states. [2019-01-01 00:44:52,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 6155 transitions. [2019-01-01 00:44:52,179 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 6155 transitions. Word has length 80 [2019-01-01 00:44:52,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:44:52,179 INFO L480 AbstractCegarLoop]: Abstraction has 2488 states and 6155 transitions. [2019-01-01 00:44:52,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:44:52,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 6155 transitions. [2019-01-01 00:44:52,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 00:44:52,188 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:44:52,189 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] [2019-01-01 00:44:52,189 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:44:52,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:44:52,189 INFO L82 PathProgramCache]: Analyzing trace with hash -366801475, now seen corresponding path program 1 times [2019-01-01 00:44:52,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:44:52,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:44:52,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:52,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:44:52,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:44:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:44:52,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:44:52,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:44:52,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:44:52,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:44:52,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:44:52,639 INFO L87 Difference]: Start difference. First operand 2488 states and 6155 transitions. Second operand 6 states. [2019-01-01 00:44:53,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:44:53,468 INFO L93 Difference]: Finished difference Result 2571 states and 6195 transitions. [2019-01-01 00:44:53,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:44:53,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-01-01 00:44:53,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:44:53,475 INFO L225 Difference]: With dead ends: 2571 [2019-01-01 00:44:53,476 INFO L226 Difference]: Without dead ends: 2571 [2019-01-01 00:44:53,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:44:53,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2019-01-01 00:44:53,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2339. [2019-01-01 00:44:53,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2339 states. [2019-01-01 00:44:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 2339 states and 5602 transitions. [2019-01-01 00:44:53,523 INFO L78 Accepts]: Start accepts. Automaton has 2339 states and 5602 transitions. Word has length 80 [2019-01-01 00:44:53,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:44:53,523 INFO L480 AbstractCegarLoop]: Abstraction has 2339 states and 5602 transitions. [2019-01-01 00:44:53,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:44:53,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 5602 transitions. [2019-01-01 00:44:53,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 00:44:53,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:44:53,536 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] [2019-01-01 00:44:53,537 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:44:53,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:44:53,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1823744423, now seen corresponding path program 1 times [2019-01-01 00:44:53,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:44:53,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:44:53,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:53,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:44:53,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:44:54,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:44:54,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:44:54,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:44:54,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:44:54,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:44:54,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:44:54,043 INFO L87 Difference]: Start difference. First operand 2339 states and 5602 transitions. Second operand 6 states. [2019-01-01 00:44:54,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:44:54,891 INFO L93 Difference]: Finished difference Result 3002 states and 7052 transitions. [2019-01-01 00:44:54,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:44:54,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-01-01 00:44:54,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:44:54,896 INFO L225 Difference]: With dead ends: 3002 [2019-01-01 00:44:54,896 INFO L226 Difference]: Without dead ends: 2927 [2019-01-01 00:44:54,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:44:54,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2019-01-01 00:44:54,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 2682. [2019-01-01 00:44:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2019-01-01 00:44:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 6364 transitions. [2019-01-01 00:44:54,944 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 6364 transitions. Word has length 80 [2019-01-01 00:44:54,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:44:54,944 INFO L480 AbstractCegarLoop]: Abstraction has 2682 states and 6364 transitions. [2019-01-01 00:44:54,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:44:54,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 6364 transitions. [2019-01-01 00:44:54,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 00:44:54,952 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:44:54,952 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] [2019-01-01 00:44:54,953 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:44:54,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:44:54,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2068316970, now seen corresponding path program 2 times [2019-01-01 00:44:54,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:44:54,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:44:54,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:54,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:44:54,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:44:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:44:55,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:44:55,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:44:55,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:44:55,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:44:55,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:44:55,446 INFO L87 Difference]: Start difference. First operand 2682 states and 6364 transitions. Second operand 7 states. [2019-01-01 00:44:56,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:44:56,154 INFO L93 Difference]: Finished difference Result 3229 states and 7678 transitions. [2019-01-01 00:44:56,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:44:56,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-01-01 00:44:56,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:44:56,160 INFO L225 Difference]: With dead ends: 3229 [2019-01-01 00:44:56,160 INFO L226 Difference]: Without dead ends: 3229 [2019-01-01 00:44:56,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:44:56,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3229 states. [2019-01-01 00:44:56,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3229 to 2712. [2019-01-01 00:44:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2712 states. [2019-01-01 00:44:56,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2712 states to 2712 states and 6470 transitions. [2019-01-01 00:44:56,204 INFO L78 Accepts]: Start accepts. Automaton has 2712 states and 6470 transitions. Word has length 80 [2019-01-01 00:44:56,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:44:56,205 INFO L480 AbstractCegarLoop]: Abstraction has 2712 states and 6470 transitions. [2019-01-01 00:44:56,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:44:56,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2712 states and 6470 transitions. [2019-01-01 00:44:56,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 00:44:56,212 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:44:56,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:44:56,212 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:44:56,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:44:56,213 INFO L82 PathProgramCache]: Analyzing trace with hash -186359418, now seen corresponding path program 1 times [2019-01-01 00:44:56,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:44:56,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:44:56,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:56,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:44:56,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:44:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:44:56,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:44:56,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:44:56,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:44:56,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:44:56,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:44:56,469 INFO L87 Difference]: Start difference. First operand 2712 states and 6470 transitions. Second operand 6 states. [2019-01-01 00:44:56,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:44:56,876 INFO L93 Difference]: Finished difference Result 3109 states and 7177 transitions. [2019-01-01 00:44:56,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 00:44:56,878 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-01-01 00:44:56,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:44:56,882 INFO L225 Difference]: With dead ends: 3109 [2019-01-01 00:44:56,882 INFO L226 Difference]: Without dead ends: 3109 [2019-01-01 00:44:56,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:44:56,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3109 states. [2019-01-01 00:44:56,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3109 to 2796. [2019-01-01 00:44:56,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2796 states. [2019-01-01 00:44:56,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2796 states and 6505 transitions. [2019-01-01 00:44:56,927 INFO L78 Accepts]: Start accepts. Automaton has 2796 states and 6505 transitions. Word has length 80 [2019-01-01 00:44:56,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:44:56,927 INFO L480 AbstractCegarLoop]: Abstraction has 2796 states and 6505 transitions. [2019-01-01 00:44:56,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:44:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2796 states and 6505 transitions. [2019-01-01 00:44:56,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 00:44:56,935 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:44:56,935 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] [2019-01-01 00:44:56,936 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:44:56,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:44:56,936 INFO L82 PathProgramCache]: Analyzing trace with hash -441095963, now seen corresponding path program 1 times [2019-01-01 00:44:56,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:44:56,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:44:56,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:56,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:44:56,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:44:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:44:57,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:44:57,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:44:57,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:44:57,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:44:57,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:44:57,083 INFO L87 Difference]: Start difference. First operand 2796 states and 6505 transitions. Second operand 4 states. [2019-01-01 00:44:57,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:44:57,201 INFO L93 Difference]: Finished difference Result 3004 states and 7041 transitions. [2019-01-01 00:44:57,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:44:57,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-01-01 00:44:57,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:44:57,207 INFO L225 Difference]: With dead ends: 3004 [2019-01-01 00:44:57,208 INFO L226 Difference]: Without dead ends: 3004 [2019-01-01 00:44:57,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:44:57,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2019-01-01 00:44:57,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 2860. [2019-01-01 00:44:57,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2860 states. [2019-01-01 00:44:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 6681 transitions. [2019-01-01 00:44:57,254 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 6681 transitions. Word has length 80 [2019-01-01 00:44:57,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:44:57,254 INFO L480 AbstractCegarLoop]: Abstraction has 2860 states and 6681 transitions. [2019-01-01 00:44:57,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:44:57,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 6681 transitions. [2019-01-01 00:44:57,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 00:44:57,261 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:44:57,261 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] [2019-01-01 00:44:57,262 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:44:57,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:44:57,262 INFO L82 PathProgramCache]: Analyzing trace with hash 2046416870, now seen corresponding path program 1 times [2019-01-01 00:44:57,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:44:57,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:44:57,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:57,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:44:57,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:44:57,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:44:57,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:44:57,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:44:57,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:44:57,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:44:57,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:44:57,602 INFO L87 Difference]: Start difference. First operand 2860 states and 6681 transitions. Second operand 6 states. [2019-01-01 00:44:57,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:44:57,764 INFO L93 Difference]: Finished difference Result 2812 states and 6449 transitions. [2019-01-01 00:44:57,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:44:57,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-01-01 00:44:57,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:44:57,769 INFO L225 Difference]: With dead ends: 2812 [2019-01-01 00:44:57,770 INFO L226 Difference]: Without dead ends: 2812 [2019-01-01 00:44:57,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:44:57,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2019-01-01 00:44:57,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2541. [2019-01-01 00:44:57,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2541 states. [2019-01-01 00:44:57,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 5837 transitions. [2019-01-01 00:44:57,820 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 5837 transitions. Word has length 80 [2019-01-01 00:44:57,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:44:57,821 INFO L480 AbstractCegarLoop]: Abstraction has 2541 states and 5837 transitions. [2019-01-01 00:44:57,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:44:57,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 5837 transitions. [2019-01-01 00:44:57,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-01 00:44:57,829 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:44:57,829 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] [2019-01-01 00:44:57,829 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:44:57,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:44:57,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1562827304, now seen corresponding path program 1 times [2019-01-01 00:44:57,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:44:57,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:44:57,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:57,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:44:57,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:44:58,273 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-01 00:44:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:44:58,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:44:58,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:44:58,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:44:58,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:44:58,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:44:58,402 INFO L87 Difference]: Start difference. First operand 2541 states and 5837 transitions. Second operand 6 states. [2019-01-01 00:44:58,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:44:58,678 INFO L93 Difference]: Finished difference Result 2927 states and 6650 transitions. [2019-01-01 00:44:58,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:44:58,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-01-01 00:44:58,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:44:58,683 INFO L225 Difference]: With dead ends: 2927 [2019-01-01 00:44:58,683 INFO L226 Difference]: Without dead ends: 2869 [2019-01-01 00:44:58,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:44:58,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2019-01-01 00:44:58,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 2244. [2019-01-01 00:44:58,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2019-01-01 00:44:58,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 5100 transitions. [2019-01-01 00:44:58,905 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 5100 transitions. Word has length 82 [2019-01-01 00:44:58,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:44:58,905 INFO L480 AbstractCegarLoop]: Abstraction has 2244 states and 5100 transitions. [2019-01-01 00:44:58,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:44:58,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 5100 transitions. [2019-01-01 00:44:58,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-01 00:44:58,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:44:58,910 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] [2019-01-01 00:44:58,911 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:44:58,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:44:58,911 INFO L82 PathProgramCache]: Analyzing trace with hash -514382039, now seen corresponding path program 1 times [2019-01-01 00:44:58,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:44:58,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:44:58,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:58,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:44:58,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:44:59,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:44:59,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:44:59,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:44:59,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:44:59,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:44:59,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:44:59,240 INFO L87 Difference]: Start difference. First operand 2244 states and 5100 transitions. Second operand 5 states. [2019-01-01 00:44:59,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:44:59,277 INFO L93 Difference]: Finished difference Result 2244 states and 5084 transitions. [2019-01-01 00:44:59,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:44:59,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-01-01 00:44:59,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:44:59,282 INFO L225 Difference]: With dead ends: 2244 [2019-01-01 00:44:59,282 INFO L226 Difference]: Without dead ends: 2244 [2019-01-01 00:44:59,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:44:59,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2244 states. [2019-01-01 00:44:59,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2244 to 2244. [2019-01-01 00:44:59,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2019-01-01 00:44:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 5084 transitions. [2019-01-01 00:44:59,311 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 5084 transitions. Word has length 82 [2019-01-01 00:44:59,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:44:59,312 INFO L480 AbstractCegarLoop]: Abstraction has 2244 states and 5084 transitions. [2019-01-01 00:44:59,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:44:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 5084 transitions. [2019-01-01 00:44:59,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-01 00:44:59,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:44:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:44:59,317 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:44:59,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:44:59,319 INFO L82 PathProgramCache]: Analyzing trace with hash 373121642, now seen corresponding path program 1 times [2019-01-01 00:44:59,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:44:59,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:44:59,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:59,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:44:59,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:44:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:44:59,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:44:59,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:44:59,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:44:59,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:44:59,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:44:59,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:44:59,531 INFO L87 Difference]: Start difference. First operand 2244 states and 5084 transitions. Second operand 7 states. [2019-01-01 00:45:00,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:45:00,569 INFO L93 Difference]: Finished difference Result 3952 states and 9010 transitions. [2019-01-01 00:45:00,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:45:00,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-01-01 00:45:00,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:45:00,573 INFO L225 Difference]: With dead ends: 3952 [2019-01-01 00:45:00,573 INFO L226 Difference]: Without dead ends: 1652 [2019-01-01 00:45:00,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:45:00,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2019-01-01 00:45:00,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1652. [2019-01-01 00:45:00,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2019-01-01 00:45:00,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 3759 transitions. [2019-01-01 00:45:00,592 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 3759 transitions. Word has length 82 [2019-01-01 00:45:00,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:45:00,592 INFO L480 AbstractCegarLoop]: Abstraction has 1652 states and 3759 transitions. [2019-01-01 00:45:00,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:45:00,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 3759 transitions. [2019-01-01 00:45:00,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-01 00:45:00,595 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:45:00,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:45:00,596 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:45:00,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:45:00,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1980467430, now seen corresponding path program 2 times [2019-01-01 00:45:00,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:45:00,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:45:00,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:45:00,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:45:00,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:45:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 00:45:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 00:45:00,696 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 00:45:00,881 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-01 00:45:00,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 12:45:00 BasicIcfg [2019-01-01 00:45:00,884 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 00:45:00,885 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 00:45:00,885 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 00:45:00,885 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 00:45:00,886 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:44:39" (3/4) ... [2019-01-01 00:45:00,891 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 00:45:01,094 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 00:45:01,095 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 00:45:01,100 INFO L168 Benchmark]: Toolchain (without parser) took 23966.59 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 710.9 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -327.8 MB). Peak memory consumption was 383.1 MB. Max. memory is 11.5 GB. [2019-01-01 00:45:01,103 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:45:01,104 INFO L168 Benchmark]: CACSL2BoogieTranslator took 852.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -159.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-01-01 00:45:01,104 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 00:45:01,105 INFO L168 Benchmark]: Boogie Preprocessor took 40.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:45:01,106 INFO L168 Benchmark]: RCFGBuilder took 1226.32 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: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2019-01-01 00:45:01,106 INFO L168 Benchmark]: TraceAbstraction took 21549.21 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 576.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -256.3 MB). Peak memory consumption was 319.9 MB. Max. memory is 11.5 GB. [2019-01-01 00:45:01,106 INFO L168 Benchmark]: Witness Printer took 209.85 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2019-01-01 00:45:01,111 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 852.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -159.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.50 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 1226.32 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: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21549.21 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 576.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -256.3 MB). Peak memory consumption was 319.9 MB. Max. memory is 11.5 GB. * Witness Printer took 209.85 ms. Allocated memory is still 1.7 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. 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] [L675] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L676] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L678] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L679] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L680] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L681] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L682] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L683] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L684] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L685] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L686] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L687] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L688] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L689] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L690] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L691] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L692] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L694] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L695] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L696] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L766] -1 pthread_t t2573; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] FCALL, FORK -1 pthread_create(&t2573, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L768] -1 pthread_t t2574; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] FCALL, FORK -1 pthread_create(&t2574, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L730] 0 x$w_buff1 = x$w_buff0 [L731] 0 x$w_buff0 = 1 [L732] 0 x$w_buff1_used = x$w_buff0_used [L733] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L735] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L736] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L737] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L738] 0 x$r_buff0_thd2 = (_Bool)1 [L741] 0 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L700] 1 y = 2 [L705] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L706] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L707] 1 x$flush_delayed = weak$$choice2 [L708] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L709] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L709] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L710] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L710] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L711] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L711] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L712] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L712] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L713] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L713] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L714] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L714] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L715] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L715] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L716] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] 1 x = x$flush_delayed ? x$mem_tmp : x [L718] 1 x$flush_delayed = (_Bool)0 [L723] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L745] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L745] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L746] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L747] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L748] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L748] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L751] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L771] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L776] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L777] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L778] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L779] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L782] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 197 locations, 3 error locations. UNSAFE Result, 21.3s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 10.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3513 SDtfs, 4215 SDslu, 6399 SDs, 0 SdLazy, 2735 SolverSat, 168 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27853occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 24306 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1172 NumberOfCodeBlocks, 1172 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1074 ConstructedInterpolants, 0 QuantifiedInterpolants, 211681 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...