./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe033_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_093af816-1c2c-4005-8be7-19c1123e0e4f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_093af816-1c2c-4005-8be7-19c1123e0e4f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_093af816-1c2c-4005-8be7-19c1123e0e4f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_093af816-1c2c-4005-8be7-19c1123e0e4f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_093af816-1c2c-4005-8be7-19c1123e0e4f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_093af816-1c2c-4005-8be7-19c1123e0e4f/bin/uautomizer --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 aa6f701e3114f964d079a3c4b968eefa99b542c6 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-cad4683 [2019-11-15 23:06:17,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:06:17,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:06:17,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:06:17,123 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:06:17,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:06:17,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:06:17,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:06:17,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:06:17,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:06:17,143 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:06:17,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:06:17,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:06:17,146 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:06:17,147 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:06:17,148 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:06:17,148 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:06:17,149 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:06:17,152 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:06:17,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:06:17,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:06:17,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:06:17,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:06:17,163 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:06:17,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:06:17,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:06:17,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:06:17,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:06:17,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:06:17,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:06:17,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:06:17,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:06:17,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:06:17,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:06:17,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:06:17,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:06:17,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:06:17,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:06:17,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:06:17,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:06:17,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:06:17,175 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_093af816-1c2c-4005-8be7-19c1123e0e4f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:06:17,199 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:06:17,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:06:17,200 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:06:17,200 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:06:17,200 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:06:17,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:06:17,201 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:06:17,201 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:06:17,201 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:06:17,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:06:17,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:06:17,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:06:17,202 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:06:17,203 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:06:17,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:06:17,203 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:06:17,203 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:06:17,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:06:17,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:06:17,204 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:06:17,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:06:17,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:06:17,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:06:17,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:06:17,205 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:06:17,206 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:06:17,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:06:17,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:06:17,206 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_093af816-1c2c-4005-8be7-19c1123e0e4f/bin/uautomizer 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 -> aa6f701e3114f964d079a3c4b968eefa99b542c6 [2019-11-15 23:06:17,231 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:06:17,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:06:17,244 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:06:17,245 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:06:17,245 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:06:17,246 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_093af816-1c2c-4005-8be7-19c1123e0e4f/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe033_rmo.opt.i [2019-11-15 23:06:17,294 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_093af816-1c2c-4005-8be7-19c1123e0e4f/bin/uautomizer/data/e54ed9982/fabfbf0f5be34ad49f29ea93152dfedc/FLAG166dd7ff6 [2019-11-15 23:06:17,760 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:06:17,761 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_093af816-1c2c-4005-8be7-19c1123e0e4f/sv-benchmarks/c/pthread-wmm/safe033_rmo.opt.i [2019-11-15 23:06:17,774 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_093af816-1c2c-4005-8be7-19c1123e0e4f/bin/uautomizer/data/e54ed9982/fabfbf0f5be34ad49f29ea93152dfedc/FLAG166dd7ff6 [2019-11-15 23:06:17,789 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_093af816-1c2c-4005-8be7-19c1123e0e4f/bin/uautomizer/data/e54ed9982/fabfbf0f5be34ad49f29ea93152dfedc [2019-11-15 23:06:17,791 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:06:17,792 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:06:17,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:06:17,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:06:17,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:06:17,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:06:17" (1/1) ... [2019-11-15 23:06:17,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64bf6310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:17, skipping insertion in model container [2019-11-15 23:06:17,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:06:17" (1/1) ... [2019-11-15 23:06:17,804 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:06:17,848 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:06:18,255 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:06:18,268 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:06:18,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:06:18,411 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:06:18,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:18 WrapperNode [2019-11-15 23:06:18,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:06:18,412 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:06:18,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:06:18,413 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:06:18,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:18" (1/1) ... [2019-11-15 23:06:18,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:18" (1/1) ... [2019-11-15 23:06:18,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:06:18,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:06:18,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:06:18,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:06:18,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:18" (1/1) ... [2019-11-15 23:06:18,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:18" (1/1) ... [2019-11-15 23:06:18,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:18" (1/1) ... [2019-11-15 23:06:18,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:18" (1/1) ... [2019-11-15 23:06:18,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:18" (1/1) ... [2019-11-15 23:06:18,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:18" (1/1) ... [2019-11-15 23:06:18,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:18" (1/1) ... [2019-11-15 23:06:18,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:06:18,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:06:18,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:06:18,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:06:18,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_093af816-1c2c-4005-8be7-19c1123e0e4f/bin/uautomizer/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-11-15 23:06:18,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:06:18,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 23:06:18,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:06:18,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:06:18,554 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 23:06:18,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 23:06:18,555 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 23:06:18,555 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 23:06:18,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 23:06:18,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:06:18,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:06:18,556 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 23:06:19,237 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:06:19,237 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:06:19,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:06:19 BoogieIcfgContainer [2019-11-15 23:06:19,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:06:19,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:06:19,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:06:19,245 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:06:19,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:06:17" (1/3) ... [2019-11-15 23:06:19,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a92400b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:06:19, skipping insertion in model container [2019-11-15 23:06:19,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:18" (2/3) ... [2019-11-15 23:06:19,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a92400b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:06:19, skipping insertion in model container [2019-11-15 23:06:19,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:06:19" (3/3) ... [2019-11-15 23:06:19,251 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_rmo.opt.i [2019-11-15 23:06:19,314 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,314 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,314 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,314 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,315 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,315 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,315 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,315 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,316 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,316 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,316 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,316 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,316 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,317 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,317 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,317 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,317 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,317 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,318 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,318 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,318 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,318 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,319 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,319 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,319 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,319 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,319 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,320 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,320 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,320 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,320 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,321 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,321 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,321 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,322 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,322 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,322 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,322 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,323 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,323 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,323 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,323 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,324 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,324 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,325 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,325 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,325 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,326 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,326 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,326 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,326 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,327 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,327 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,327 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,327 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,327 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,327 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,328 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,328 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,328 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,328 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,328 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,328 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,329 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,329 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,329 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,329 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,329 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,329 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,330 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,330 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,331 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,331 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,331 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,331 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,332 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,332 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,332 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,332 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,332 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,332 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,332 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,333 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,333 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,333 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,333 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,333 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,333 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,334 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,334 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,334 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,334 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,335 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,335 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,335 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,335 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,336 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,336 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,336 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,336 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,337 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,340 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,340 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,341 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,341 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,341 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,341 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,341 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,342 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,342 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,342 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,342 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,342 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,349 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,349 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,349 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,349 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,350 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,350 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,350 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,350 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,350 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,350 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,351 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,351 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,351 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,351 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,352 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:06:19,357 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 23:06:19,357 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:06:19,367 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 23:06:19,377 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 23:06:19,395 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:06:19,395 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:06:19,395 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:06:19,395 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:06:19,396 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:06:19,396 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:06:19,396 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:06:19,396 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:06:19,412 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 127 places, 159 transitions [2019-11-15 23:06:21,153 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25973 states. [2019-11-15 23:06:21,155 INFO L276 IsEmpty]: Start isEmpty. Operand 25973 states. [2019-11-15 23:06:21,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:06:21,164 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:21,165 INFO L380 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-11-15 23:06:21,167 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:21,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:21,172 INFO L82 PathProgramCache]: Analyzing trace with hash 531989487, now seen corresponding path program 1 times [2019-11-15 23:06:21,179 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:21,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543787668] [2019-11-15 23:06:21,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:21,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:21,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:21,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-11-15 23:06:21,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543787668] [2019-11-15 23:06:21,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:06:21,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:06:21,423 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466697197] [2019-11-15 23:06:21,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:06:21,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:06:21,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:06:21,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:06:21,441 INFO L87 Difference]: Start difference. First operand 25973 states. Second operand 4 states. [2019-11-15 23:06:22,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:06:22,067 INFO L93 Difference]: Finished difference Result 26613 states and 102118 transitions. [2019-11-15 23:06:22,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:06:22,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-15 23:06:22,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:06:22,296 INFO L225 Difference]: With dead ends: 26613 [2019-11-15 23:06:22,296 INFO L226 Difference]: Without dead ends: 20357 [2019-11-15 23:06:22,298 INFO L600 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-11-15 23:06:22,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20357 states. [2019-11-15 23:06:23,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20357 to 20357. [2019-11-15 23:06:23,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20357 states. [2019-11-15 23:06:23,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20357 states to 20357 states and 78422 transitions. [2019-11-15 23:06:23,442 INFO L78 Accepts]: Start accepts. Automaton has 20357 states and 78422 transitions. Word has length 36 [2019-11-15 23:06:23,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:06:23,443 INFO L462 AbstractCegarLoop]: Abstraction has 20357 states and 78422 transitions. [2019-11-15 23:06:23,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:06:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 20357 states and 78422 transitions. [2019-11-15 23:06:23,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 23:06:23,451 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:23,451 INFO L380 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-11-15 23:06:23,451 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:23,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:23,452 INFO L82 PathProgramCache]: Analyzing trace with hash 998522529, now seen corresponding path program 1 times [2019-11-15 23:06:23,452 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:23,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921520074] [2019-11-15 23:06:23,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:23,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:23,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:06:23,549 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921520074] [2019-11-15 23:06:23,550 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:06:23,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:06:23,550 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681539104] [2019-11-15 23:06:23,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:06:23,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:06:23,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:06:23,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:06:23,552 INFO L87 Difference]: Start difference. First operand 20357 states and 78422 transitions. Second operand 5 states. [2019-11-15 23:06:24,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:06:24,469 INFO L93 Difference]: Finished difference Result 31835 states and 116039 transitions. [2019-11-15 23:06:24,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:06:24,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-15 23:06:24,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:06:24,906 INFO L225 Difference]: With dead ends: 31835 [2019-11-15 23:06:24,907 INFO L226 Difference]: Without dead ends: 31283 [2019-11-15 23:06:24,907 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:06:25,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31283 states. [2019-11-15 23:06:25,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31283 to 29702. [2019-11-15 23:06:25,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29702 states. [2019-11-15 23:06:25,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29702 states to 29702 states and 109516 transitions. [2019-11-15 23:06:25,780 INFO L78 Accepts]: Start accepts. Automaton has 29702 states and 109516 transitions. Word has length 44 [2019-11-15 23:06:25,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:06:25,782 INFO L462 AbstractCegarLoop]: Abstraction has 29702 states and 109516 transitions. [2019-11-15 23:06:25,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:06:25,782 INFO L276 IsEmpty]: Start isEmpty. Operand 29702 states and 109516 transitions. [2019-11-15 23:06:25,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 23:06:25,786 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:25,787 INFO L380 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-11-15 23:06:25,790 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:25,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:25,790 INFO L82 PathProgramCache]: Analyzing trace with hash -192170192, now seen corresponding path program 1 times [2019-11-15 23:06:25,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:25,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686459844] [2019-11-15 23:06:25,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:25,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:25,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:25,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:06:25,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686459844] [2019-11-15 23:06:25,881 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:06:25,881 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:06:25,881 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217946232] [2019-11-15 23:06:25,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:06:25,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:06:25,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:06:25,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:06:25,882 INFO L87 Difference]: Start difference. First operand 29702 states and 109516 transitions. Second operand 5 states. [2019-11-15 23:06:26,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:06:26,709 INFO L93 Difference]: Finished difference Result 38693 states and 139688 transitions. [2019-11-15 23:06:26,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:06:26,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-15 23:06:26,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:06:26,862 INFO L225 Difference]: With dead ends: 38693 [2019-11-15 23:06:26,862 INFO L226 Difference]: Without dead ends: 38245 [2019-11-15 23:06:26,863 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:06:27,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38245 states. [2019-11-15 23:06:27,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38245 to 32948. [2019-11-15 23:06:27,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32948 states. [2019-11-15 23:06:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32948 states to 32948 states and 120525 transitions. [2019-11-15 23:06:27,726 INFO L78 Accepts]: Start accepts. Automaton has 32948 states and 120525 transitions. Word has length 45 [2019-11-15 23:06:27,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:06:27,726 INFO L462 AbstractCegarLoop]: Abstraction has 32948 states and 120525 transitions. [2019-11-15 23:06:27,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:06:27,726 INFO L276 IsEmpty]: Start isEmpty. Operand 32948 states and 120525 transitions. [2019-11-15 23:06:27,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 23:06:27,734 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:27,735 INFO L380 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-11-15 23:06:27,735 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:27,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:27,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1923602230, now seen corresponding path program 1 times [2019-11-15 23:06:27,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:27,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336359730] [2019-11-15 23:06:27,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:27,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:27,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:27,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:06:27,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336359730] [2019-11-15 23:06:27,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:06:27,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:06:27,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78420903] [2019-11-15 23:06:27,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:06:27,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:06:27,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:06:27,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:06:27,790 INFO L87 Difference]: Start difference. First operand 32948 states and 120525 transitions. Second operand 3 states. [2019-11-15 23:06:28,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:06:28,018 INFO L93 Difference]: Finished difference Result 42409 states and 152016 transitions. [2019-11-15 23:06:28,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:06:28,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-15 23:06:28,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:06:28,135 INFO L225 Difference]: With dead ends: 42409 [2019-11-15 23:06:28,135 INFO L226 Difference]: Without dead ends: 42409 [2019-11-15 23:06:28,136 INFO L600 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-11-15 23:06:28,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42409 states. [2019-11-15 23:06:29,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42409 to 37662. [2019-11-15 23:06:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37662 states. [2019-11-15 23:06:29,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37662 states to 37662 states and 136329 transitions. [2019-11-15 23:06:29,412 INFO L78 Accepts]: Start accepts. Automaton has 37662 states and 136329 transitions. Word has length 47 [2019-11-15 23:06:29,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:06:29,413 INFO L462 AbstractCegarLoop]: Abstraction has 37662 states and 136329 transitions. [2019-11-15 23:06:29,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:06:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 37662 states and 136329 transitions. [2019-11-15 23:06:29,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 23:06:29,430 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:29,430 INFO L380 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-11-15 23:06:29,430 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:29,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:29,431 INFO L82 PathProgramCache]: Analyzing trace with hash -629683857, now seen corresponding path program 1 times [2019-11-15 23:06:29,431 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:29,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035994869] [2019-11-15 23:06:29,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:29,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:29,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:06:29,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035994869] [2019-11-15 23:06:29,540 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:06:29,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:06:29,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745368493] [2019-11-15 23:06:29,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:06:29,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:06:29,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:06:29,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:06:29,542 INFO L87 Difference]: Start difference. First operand 37662 states and 136329 transitions. Second operand 6 states. [2019-11-15 23:06:30,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:06:30,209 INFO L93 Difference]: Finished difference Result 48753 states and 172978 transitions. [2019-11-15 23:06:30,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:06:30,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-15 23:06:30,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:06:30,312 INFO L225 Difference]: With dead ends: 48753 [2019-11-15 23:06:30,312 INFO L226 Difference]: Without dead ends: 48233 [2019-11-15 23:06:30,312 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:06:31,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48233 states. [2019-11-15 23:06:31,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48233 to 38226. [2019-11-15 23:06:31,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38226 states. [2019-11-15 23:06:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38226 states to 38226 states and 138492 transitions. [2019-11-15 23:06:31,661 INFO L78 Accepts]: Start accepts. Automaton has 38226 states and 138492 transitions. Word has length 51 [2019-11-15 23:06:31,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:06:31,661 INFO L462 AbstractCegarLoop]: Abstraction has 38226 states and 138492 transitions. [2019-11-15 23:06:31,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:06:31,661 INFO L276 IsEmpty]: Start isEmpty. Operand 38226 states and 138492 transitions. [2019-11-15 23:06:31,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 23:06:31,675 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:31,678 INFO L380 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-11-15 23:06:31,679 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:31,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:31,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1938707736, now seen corresponding path program 1 times [2019-11-15 23:06:31,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:31,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618437643] [2019-11-15 23:06:31,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:31,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:31,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:06:31,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618437643] [2019-11-15 23:06:31,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:06:31,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:06:31,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949356393] [2019-11-15 23:06:31,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:06:31,819 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:06:31,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:06:31,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:06:31,819 INFO L87 Difference]: Start difference. First operand 38226 states and 138492 transitions. Second operand 6 states. [2019-11-15 23:06:32,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:06:32,537 INFO L93 Difference]: Finished difference Result 53002 states and 189568 transitions. [2019-11-15 23:06:32,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:06:32,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-15 23:06:32,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:06:32,641 INFO L225 Difference]: With dead ends: 53002 [2019-11-15 23:06:32,641 INFO L226 Difference]: Without dead ends: 52026 [2019-11-15 23:06:32,641 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:06:32,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52026 states. [2019-11-15 23:06:33,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52026 to 48779. [2019-11-15 23:06:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48779 states. [2019-11-15 23:06:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48779 states to 48779 states and 175223 transitions. [2019-11-15 23:06:34,408 INFO L78 Accepts]: Start accepts. Automaton has 48779 states and 175223 transitions. Word has length 51 [2019-11-15 23:06:34,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:06:34,409 INFO L462 AbstractCegarLoop]: Abstraction has 48779 states and 175223 transitions. [2019-11-15 23:06:34,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:06:34,409 INFO L276 IsEmpty]: Start isEmpty. Operand 48779 states and 175223 transitions. [2019-11-15 23:06:34,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 23:06:34,423 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:34,423 INFO L380 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-11-15 23:06:34,423 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:34,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:34,424 INFO L82 PathProgramCache]: Analyzing trace with hash 559308201, now seen corresponding path program 1 times [2019-11-15 23:06:34,424 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:34,424 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257771127] [2019-11-15 23:06:34,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:34,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:34,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:06:34,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257771127] [2019-11-15 23:06:34,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:06:34,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:06:34,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407475231] [2019-11-15 23:06:34,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:06:34,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:06:34,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:06:34,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:06:34,553 INFO L87 Difference]: Start difference. First operand 48779 states and 175223 transitions. Second operand 7 states. [2019-11-15 23:06:35,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:06:35,458 INFO L93 Difference]: Finished difference Result 70894 states and 244520 transitions. [2019-11-15 23:06:35,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:06:35,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-11-15 23:06:35,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:06:35,593 INFO L225 Difference]: With dead ends: 70894 [2019-11-15 23:06:35,593 INFO L226 Difference]: Without dead ends: 70894 [2019-11-15 23:06:35,594 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:06:35,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70894 states. [2019-11-15 23:06:36,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70894 to 57887. [2019-11-15 23:06:36,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57887 states. [2019-11-15 23:06:36,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57887 states to 57887 states and 203147 transitions. [2019-11-15 23:06:36,638 INFO L78 Accepts]: Start accepts. Automaton has 57887 states and 203147 transitions. Word has length 51 [2019-11-15 23:06:36,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:06:36,638 INFO L462 AbstractCegarLoop]: Abstraction has 57887 states and 203147 transitions. [2019-11-15 23:06:36,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:06:36,639 INFO L276 IsEmpty]: Start isEmpty. Operand 57887 states and 203147 transitions. [2019-11-15 23:06:36,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 23:06:36,650 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:36,650 INFO L380 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-11-15 23:06:36,650 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:36,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:36,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1446811882, now seen corresponding path program 1 times [2019-11-15 23:06:36,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:36,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878829678] [2019-11-15 23:06:36,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:36,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:36,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:06:36,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878829678] [2019-11-15 23:06:36,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:06:36,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:06:36,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210507098] [2019-11-15 23:06:36,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:06:36,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:06:36,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:06:36,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:06:36,718 INFO L87 Difference]: Start difference. First operand 57887 states and 203147 transitions. Second operand 4 states. [2019-11-15 23:06:36,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:06:36,775 INFO L93 Difference]: Finished difference Result 10857 states and 33392 transitions. [2019-11-15 23:06:36,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:06:36,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-15 23:06:36,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:06:36,791 INFO L225 Difference]: With dead ends: 10857 [2019-11-15 23:06:36,791 INFO L226 Difference]: Without dead ends: 9358 [2019-11-15 23:06:36,792 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:06:39,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9358 states. [2019-11-15 23:06:39,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9358 to 9310. [2019-11-15 23:06:39,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9310 states. [2019-11-15 23:06:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9310 states to 9310 states and 28342 transitions. [2019-11-15 23:06:39,516 INFO L78 Accepts]: Start accepts. Automaton has 9310 states and 28342 transitions. Word has length 51 [2019-11-15 23:06:39,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:06:39,517 INFO L462 AbstractCegarLoop]: Abstraction has 9310 states and 28342 transitions. [2019-11-15 23:06:39,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:06:39,517 INFO L276 IsEmpty]: Start isEmpty. Operand 9310 states and 28342 transitions. [2019-11-15 23:06:39,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 23:06:39,522 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:39,523 INFO L380 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-11-15 23:06:39,523 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:39,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:39,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1556006386, now seen corresponding path program 1 times [2019-11-15 23:06:39,524 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:39,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125240406] [2019-11-15 23:06:39,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:39,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:39,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:06:39,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125240406] [2019-11-15 23:06:39,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:06:39,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:06:39,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43543655] [2019-11-15 23:06:39,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:06:39,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:06:39,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:06:39,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:06:39,601 INFO L87 Difference]: Start difference. First operand 9310 states and 28342 transitions. Second operand 4 states. [2019-11-15 23:06:39,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:06:39,752 INFO L93 Difference]: Finished difference Result 10885 states and 33034 transitions. [2019-11-15 23:06:39,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:06:39,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-15 23:06:39,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:06:39,771 INFO L225 Difference]: With dead ends: 10885 [2019-11-15 23:06:39,771 INFO L226 Difference]: Without dead ends: 10885 [2019-11-15 23:06:39,772 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:06:39,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10885 states. [2019-11-15 23:06:39,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10885 to 9877. [2019-11-15 23:06:39,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9877 states. [2019-11-15 23:06:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9877 states to 9877 states and 30013 transitions. [2019-11-15 23:06:39,943 INFO L78 Accepts]: Start accepts. Automaton has 9877 states and 30013 transitions. Word has length 61 [2019-11-15 23:06:39,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:06:39,944 INFO L462 AbstractCegarLoop]: Abstraction has 9877 states and 30013 transitions. [2019-11-15 23:06:39,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:06:39,944 INFO L276 IsEmpty]: Start isEmpty. Operand 9877 states and 30013 transitions. [2019-11-15 23:06:39,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 23:06:39,951 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:39,951 INFO L380 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-11-15 23:06:39,951 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:39,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:39,952 INFO L82 PathProgramCache]: Analyzing trace with hash 186803949, now seen corresponding path program 1 times [2019-11-15 23:06:39,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:39,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809605707] [2019-11-15 23:06:39,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:39,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:39,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:40,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:06:40,070 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809605707] [2019-11-15 23:06:40,070 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:06:40,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:06:40,071 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33607029] [2019-11-15 23:06:40,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:06:40,071 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:06:40,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:06:40,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:06:40,072 INFO L87 Difference]: Start difference. First operand 9877 states and 30013 transitions. Second operand 6 states. [2019-11-15 23:06:40,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:06:40,586 INFO L93 Difference]: Finished difference Result 12783 states and 38223 transitions. [2019-11-15 23:06:40,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:06:40,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-15 23:06:40,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:06:40,603 INFO L225 Difference]: With dead ends: 12783 [2019-11-15 23:06:40,603 INFO L226 Difference]: Without dead ends: 12735 [2019-11-15 23:06:40,603 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:06:40,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12735 states. [2019-11-15 23:06:40,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12735 to 10616. [2019-11-15 23:06:40,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10616 states. [2019-11-15 23:06:40,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10616 states to 10616 states and 32066 transitions. [2019-11-15 23:06:40,749 INFO L78 Accepts]: Start accepts. Automaton has 10616 states and 32066 transitions. Word has length 61 [2019-11-15 23:06:40,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:06:40,750 INFO L462 AbstractCegarLoop]: Abstraction has 10616 states and 32066 transitions. [2019-11-15 23:06:40,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:06:40,750 INFO L276 IsEmpty]: Start isEmpty. Operand 10616 states and 32066 transitions. [2019-11-15 23:06:40,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 23:06:40,756 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:40,756 INFO L380 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] [2019-11-15 23:06:40,757 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:40,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:40,757 INFO L82 PathProgramCache]: Analyzing trace with hash -45655302, now seen corresponding path program 1 times [2019-11-15 23:06:40,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:40,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181167380] [2019-11-15 23:06:40,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:40,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:40,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:40,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:06:40,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181167380] [2019-11-15 23:06:40,820 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:06:40,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:06:40,821 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091664071] [2019-11-15 23:06:40,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:06:40,821 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:06:40,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:06:40,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:06:40,821 INFO L87 Difference]: Start difference. First operand 10616 states and 32066 transitions. Second operand 4 states. [2019-11-15 23:06:41,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:06:41,055 INFO L93 Difference]: Finished difference Result 13318 states and 39668 transitions. [2019-11-15 23:06:41,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:06:41,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-15 23:06:41,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:06:41,072 INFO L225 Difference]: With dead ends: 13318 [2019-11-15 23:06:41,072 INFO L226 Difference]: Without dead ends: 13318 [2019-11-15 23:06:41,073 INFO L600 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-11-15 23:06:41,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13318 states. [2019-11-15 23:06:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13318 to 12172. [2019-11-15 23:06:41,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12172 states. [2019-11-15 23:06:41,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12172 states to 12172 states and 36357 transitions. [2019-11-15 23:06:41,230 INFO L78 Accepts]: Start accepts. Automaton has 12172 states and 36357 transitions. Word has length 63 [2019-11-15 23:06:41,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:06:41,230 INFO L462 AbstractCegarLoop]: Abstraction has 12172 states and 36357 transitions. [2019-11-15 23:06:41,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:06:41,231 INFO L276 IsEmpty]: Start isEmpty. Operand 12172 states and 36357 transitions. [2019-11-15 23:06:41,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 23:06:41,240 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:41,240 INFO L380 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] [2019-11-15 23:06:41,240 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:41,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:41,241 INFO L82 PathProgramCache]: Analyzing trace with hash -2122864645, now seen corresponding path program 1 times [2019-11-15 23:06:41,241 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:41,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015226939] [2019-11-15 23:06:41,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:41,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:41,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:06:41,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015226939] [2019-11-15 23:06:41,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:06:41,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:06:41,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962554279] [2019-11-15 23:06:41,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:06:41,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:06:41,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:06:41,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:06:41,283 INFO L87 Difference]: Start difference. First operand 12172 states and 36357 transitions. Second operand 3 states. [2019-11-15 23:06:41,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:06:41,440 INFO L93 Difference]: Finished difference Result 12698 states and 37762 transitions. [2019-11-15 23:06:41,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:06:41,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-15 23:06:41,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:06:41,456 INFO L225 Difference]: With dead ends: 12698 [2019-11-15 23:06:41,457 INFO L226 Difference]: Without dead ends: 12698 [2019-11-15 23:06:41,457 INFO L600 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-11-15 23:06:41,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12698 states. [2019-11-15 23:06:41,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12698 to 12460. [2019-11-15 23:06:41,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12460 states. [2019-11-15 23:06:41,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12460 states to 12460 states and 37121 transitions. [2019-11-15 23:06:41,623 INFO L78 Accepts]: Start accepts. Automaton has 12460 states and 37121 transitions. Word has length 63 [2019-11-15 23:06:41,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:06:41,623 INFO L462 AbstractCegarLoop]: Abstraction has 12460 states and 37121 transitions. [2019-11-15 23:06:41,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:06:41,624 INFO L276 IsEmpty]: Start isEmpty. Operand 12460 states and 37121 transitions. [2019-11-15 23:06:41,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:06:41,638 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:41,638 INFO L380 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] [2019-11-15 23:06:41,638 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:41,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:41,638 INFO L82 PathProgramCache]: Analyzing trace with hash -40717626, now seen corresponding path program 1 times [2019-11-15 23:06:41,638 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:41,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201617018] [2019-11-15 23:06:41,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:41,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:41,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:41,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:06:41,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201617018] [2019-11-15 23:06:41,739 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:06:41,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:06:41,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007492033] [2019-11-15 23:06:41,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:06:41,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:06:41,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:06:41,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:06:41,740 INFO L87 Difference]: Start difference. First operand 12460 states and 37121 transitions. Second operand 6 states. [2019-11-15 23:06:42,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:06:42,178 INFO L93 Difference]: Finished difference Result 13731 states and 40360 transitions. [2019-11-15 23:06:42,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:06:42,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-15 23:06:42,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:06:42,195 INFO L225 Difference]: With dead ends: 13731 [2019-11-15 23:06:42,195 INFO L226 Difference]: Without dead ends: 13731 [2019-11-15 23:06:42,196 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:06:42,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13731 states. [2019-11-15 23:06:42,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13731 to 13245. [2019-11-15 23:06:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13245 states. [2019-11-15 23:06:42,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13245 states to 13245 states and 39076 transitions. [2019-11-15 23:06:42,352 INFO L78 Accepts]: Start accepts. Automaton has 13245 states and 39076 transitions. Word has length 65 [2019-11-15 23:06:42,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:06:42,352 INFO L462 AbstractCegarLoop]: Abstraction has 13245 states and 39076 transitions. [2019-11-15 23:06:42,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:06:42,352 INFO L276 IsEmpty]: Start isEmpty. Operand 13245 states and 39076 transitions. [2019-11-15 23:06:42,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:06:42,362 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:42,362 INFO L380 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] [2019-11-15 23:06:42,363 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:42,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:42,363 INFO L82 PathProgramCache]: Analyzing trace with hash -2117926969, now seen corresponding path program 1 times [2019-11-15 23:06:42,363 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:42,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182773991] [2019-11-15 23:06:42,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:42,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:42,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:42,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:06:42,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182773991] [2019-11-15 23:06:42,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:06:42,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:06:42,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440867229] [2019-11-15 23:06:42,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:06:42,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:06:42,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:06:42,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:06:42,463 INFO L87 Difference]: Start difference. First operand 13245 states and 39076 transitions. Second operand 6 states. [2019-11-15 23:06:42,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:06:42,796 INFO L93 Difference]: Finished difference Result 15568 states and 44586 transitions. [2019-11-15 23:06:42,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:06:42,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-15 23:06:42,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:06:42,813 INFO L225 Difference]: With dead ends: 15568 [2019-11-15 23:06:42,813 INFO L226 Difference]: Without dead ends: 15568 [2019-11-15 23:06:42,813 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:06:42,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15568 states. [2019-11-15 23:06:42,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15568 to 13819. [2019-11-15 23:06:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13819 states. [2019-11-15 23:06:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13819 states to 13819 states and 39926 transitions. [2019-11-15 23:06:42,972 INFO L78 Accepts]: Start accepts. Automaton has 13819 states and 39926 transitions. Word has length 65 [2019-11-15 23:06:42,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:06:42,973 INFO L462 AbstractCegarLoop]: Abstraction has 13819 states and 39926 transitions. [2019-11-15 23:06:42,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:06:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 13819 states and 39926 transitions. [2019-11-15 23:06:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:06:42,982 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:42,983 INFO L380 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] [2019-11-15 23:06:42,983 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:42,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:42,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1906576056, now seen corresponding path program 1 times [2019-11-15 23:06:42,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:42,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714900179] [2019-11-15 23:06:42,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:42,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:42,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:43,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:06:43,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714900179] [2019-11-15 23:06:43,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:06:43,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:06:43,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574267912] [2019-11-15 23:06:43,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:06:43,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:06:43,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:06:43,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:06:43,062 INFO L87 Difference]: Start difference. First operand 13819 states and 39926 transitions. Second operand 5 states. [2019-11-15 23:06:43,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:06:43,379 INFO L93 Difference]: Finished difference Result 17380 states and 50005 transitions. [2019-11-15 23:06:43,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:06:43,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-15 23:06:43,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:06:43,398 INFO L225 Difference]: With dead ends: 17380 [2019-11-15 23:06:43,398 INFO L226 Difference]: Without dead ends: 17380 [2019-11-15 23:06:43,399 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:06:43,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17380 states. [2019-11-15 23:06:43,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17380 to 14857. [2019-11-15 23:06:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14857 states. [2019-11-15 23:06:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14857 states to 14857 states and 42558 transitions. [2019-11-15 23:06:43,569 INFO L78 Accepts]: Start accepts. Automaton has 14857 states and 42558 transitions. Word has length 65 [2019-11-15 23:06:43,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:06:43,570 INFO L462 AbstractCegarLoop]: Abstraction has 14857 states and 42558 transitions. [2019-11-15 23:06:43,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:06:43,570 INFO L276 IsEmpty]: Start isEmpty. Operand 14857 states and 42558 transitions. [2019-11-15 23:06:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:06:43,576 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:43,577 INFO L380 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] [2019-11-15 23:06:43,577 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:43,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:43,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1877857063, now seen corresponding path program 1 times [2019-11-15 23:06:43,577 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:43,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492726153] [2019-11-15 23:06:43,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:43,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:43,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:06:43,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492726153] [2019-11-15 23:06:43,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:06:43,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:06:43,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203892701] [2019-11-15 23:06:43,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:06:43,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:06:43,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:06:43,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:06:43,639 INFO L87 Difference]: Start difference. First operand 14857 states and 42558 transitions. Second operand 5 states. [2019-11-15 23:06:44,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:06:44,001 INFO L93 Difference]: Finished difference Result 19762 states and 56505 transitions. [2019-11-15 23:06:44,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:06:44,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-15 23:06:44,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:06:44,022 INFO L225 Difference]: With dead ends: 19762 [2019-11-15 23:06:44,022 INFO L226 Difference]: Without dead ends: 19762 [2019-11-15 23:06:44,023 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:06:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19762 states. [2019-11-15 23:06:44,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19762 to 15762. [2019-11-15 23:06:44,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15762 states. [2019-11-15 23:06:44,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15762 states to 15762 states and 45144 transitions. [2019-11-15 23:06:44,376 INFO L78 Accepts]: Start accepts. Automaton has 15762 states and 45144 transitions. Word has length 65 [2019-11-15 23:06:44,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:06:44,377 INFO L462 AbstractCegarLoop]: Abstraction has 15762 states and 45144 transitions. [2019-11-15 23:06:44,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:06:44,377 INFO L276 IsEmpty]: Start isEmpty. Operand 15762 states and 45144 transitions. [2019-11-15 23:06:44,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:06:44,386 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:44,387 INFO L380 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] [2019-11-15 23:06:44,387 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:44,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:44,387 INFO L82 PathProgramCache]: Analyzing trace with hash 70402600, now seen corresponding path program 1 times [2019-11-15 23:06:44,387 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:44,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021157555] [2019-11-15 23:06:44,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:44,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:44,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:44,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:06:44,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021157555] [2019-11-15 23:06:44,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:06:44,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:06:44,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778731916] [2019-11-15 23:06:44,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:06:44,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:06:44,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:06:44,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:06:44,477 INFO L87 Difference]: Start difference. First operand 15762 states and 45144 transitions. Second operand 4 states. [2019-11-15 23:06:44,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:06:44,850 INFO L93 Difference]: Finished difference Result 20658 states and 59352 transitions. [2019-11-15 23:06:44,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:06:44,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-15 23:06:44,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:06:44,872 INFO L225 Difference]: With dead ends: 20658 [2019-11-15 23:06:44,872 INFO L226 Difference]: Without dead ends: 20382 [2019-11-15 23:06:44,873 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:06:44,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20382 states. [2019-11-15 23:06:45,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20382 to 18945. [2019-11-15 23:06:45,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18945 states. [2019-11-15 23:06:45,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18945 states to 18945 states and 54433 transitions. [2019-11-15 23:06:45,126 INFO L78 Accepts]: Start accepts. Automaton has 18945 states and 54433 transitions. Word has length 65 [2019-11-15 23:06:45,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:06:45,127 INFO L462 AbstractCegarLoop]: Abstraction has 18945 states and 54433 transitions. [2019-11-15 23:06:45,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:06:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 18945 states and 54433 transitions. [2019-11-15 23:06:45,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:06:45,149 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:45,149 INFO L380 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] [2019-11-15 23:06:45,149 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:45,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:45,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1726548759, now seen corresponding path program 1 times [2019-11-15 23:06:45,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:45,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958306602] [2019-11-15 23:06:45,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:45,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:45,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:45,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:06:45,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958306602] [2019-11-15 23:06:45,302 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:06:45,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:06:45,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653881957] [2019-11-15 23:06:45,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:06:45,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:06:45,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:06:45,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:06:45,303 INFO L87 Difference]: Start difference. First operand 18945 states and 54433 transitions. Second operand 7 states. [2019-11-15 23:06:45,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:06:45,631 INFO L93 Difference]: Finished difference Result 17839 states and 48887 transitions. [2019-11-15 23:06:45,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:06:45,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-11-15 23:06:45,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:06:45,649 INFO L225 Difference]: With dead ends: 17839 [2019-11-15 23:06:45,649 INFO L226 Difference]: Without dead ends: 17839 [2019-11-15 23:06:45,650 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:06:45,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17839 states. [2019-11-15 23:06:45,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17839 to 12473. [2019-11-15 23:06:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12473 states. [2019-11-15 23:06:45,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12473 states to 12473 states and 34350 transitions. [2019-11-15 23:06:45,808 INFO L78 Accepts]: Start accepts. Automaton has 12473 states and 34350 transitions. Word has length 65 [2019-11-15 23:06:45,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:06:45,809 INFO L462 AbstractCegarLoop]: Abstraction has 12473 states and 34350 transitions. [2019-11-15 23:06:45,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:06:45,809 INFO L276 IsEmpty]: Start isEmpty. Operand 12473 states and 34350 transitions. [2019-11-15 23:06:45,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:06:45,814 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:45,814 INFO L380 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] [2019-11-15 23:06:45,814 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:45,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:45,814 INFO L82 PathProgramCache]: Analyzing trace with hash -839045078, now seen corresponding path program 1 times [2019-11-15 23:06:45,815 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:45,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774618222] [2019-11-15 23:06:45,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:45,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:45,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:06:45,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774618222] [2019-11-15 23:06:45,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:06:45,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:06:45,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750447801] [2019-11-15 23:06:45,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:06:45,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:06:45,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:06:45,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:06:45,877 INFO L87 Difference]: Start difference. First operand 12473 states and 34350 transitions. Second operand 5 states. [2019-11-15 23:06:45,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:06:45,909 INFO L93 Difference]: Finished difference Result 4022 states and 9369 transitions. [2019-11-15 23:06:45,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:06:45,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-15 23:06:45,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:06:45,912 INFO L225 Difference]: With dead ends: 4022 [2019-11-15 23:06:45,912 INFO L226 Difference]: Without dead ends: 3349 [2019-11-15 23:06:45,912 INFO L600 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-11-15 23:06:45,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3349 states. [2019-11-15 23:06:45,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3349 to 3089. [2019-11-15 23:06:45,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3089 states. [2019-11-15 23:06:45,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 7075 transitions. [2019-11-15 23:06:45,938 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 7075 transitions. Word has length 65 [2019-11-15 23:06:45,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:06:45,938 INFO L462 AbstractCegarLoop]: Abstraction has 3089 states and 7075 transitions. [2019-11-15 23:06:45,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:06:45,938 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 7075 transitions. [2019-11-15 23:06:45,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 23:06:45,941 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:45,941 INFO L380 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-11-15 23:06:45,941 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:45,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:45,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1377720652, now seen corresponding path program 1 times [2019-11-15 23:06:45,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:45,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846657366] [2019-11-15 23:06:45,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:45,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:45,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:46,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:06:46,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846657366] [2019-11-15 23:06:46,058 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:06:46,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:06:46,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080839818] [2019-11-15 23:06:46,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:06:46,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:06:46,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:06:46,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:06:46,060 INFO L87 Difference]: Start difference. First operand 3089 states and 7075 transitions. Second operand 7 states. [2019-11-15 23:06:46,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:06:46,499 INFO L93 Difference]: Finished difference Result 3728 states and 8436 transitions. [2019-11-15 23:06:46,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 23:06:46,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-11-15 23:06:46,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:06:46,502 INFO L225 Difference]: With dead ends: 3728 [2019-11-15 23:06:46,502 INFO L226 Difference]: Without dead ends: 3697 [2019-11-15 23:06:46,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:06:46,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2019-11-15 23:06:46,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 3243. [2019-11-15 23:06:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3243 states. [2019-11-15 23:06:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3243 states to 3243 states and 7398 transitions. [2019-11-15 23:06:46,531 INFO L78 Accepts]: Start accepts. Automaton has 3243 states and 7398 transitions. Word has length 82 [2019-11-15 23:06:46,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:06:46,531 INFO L462 AbstractCegarLoop]: Abstraction has 3243 states and 7398 transitions. [2019-11-15 23:06:46,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:06:46,531 INFO L276 IsEmpty]: Start isEmpty. Operand 3243 states and 7398 transitions. [2019-11-15 23:06:46,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 23:06:46,533 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:46,534 INFO L380 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-11-15 23:06:46,534 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:46,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:46,534 INFO L82 PathProgramCache]: Analyzing trace with hash 733569717, now seen corresponding path program 1 times [2019-11-15 23:06:46,535 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:46,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862841621] [2019-11-15 23:06:46,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:46,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:46,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:06:46,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862841621] [2019-11-15 23:06:46,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:06:46,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:06:46,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625303690] [2019-11-15 23:06:46,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:06:46,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:06:46,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:06:46,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:06:46,684 INFO L87 Difference]: Start difference. First operand 3243 states and 7398 transitions. Second operand 9 states. [2019-11-15 23:06:47,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:06:47,031 INFO L93 Difference]: Finished difference Result 11538 states and 26510 transitions. [2019-11-15 23:06:47,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 23:06:47,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-11-15 23:06:47,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:06:47,037 INFO L225 Difference]: With dead ends: 11538 [2019-11-15 23:06:47,037 INFO L226 Difference]: Without dead ends: 7339 [2019-11-15 23:06:47,037 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:06:47,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7339 states. [2019-11-15 23:06:47,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7339 to 3321. [2019-11-15 23:06:47,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3321 states. [2019-11-15 23:06:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 7546 transitions. [2019-11-15 23:06:47,080 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 7546 transitions. Word has length 82 [2019-11-15 23:06:47,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:06:47,081 INFO L462 AbstractCegarLoop]: Abstraction has 3321 states and 7546 transitions. [2019-11-15 23:06:47,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:06:47,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 7546 transitions. [2019-11-15 23:06:47,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 23:06:47,085 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:47,085 INFO L380 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-11-15 23:06:47,085 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:47,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:47,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1812519390, now seen corresponding path program 2 times [2019-11-15 23:06:47,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:47,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068086724] [2019-11-15 23:06:47,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:47,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:47,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:47,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:06:47,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068086724] [2019-11-15 23:06:47,200 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:06:47,200 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:06:47,200 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777459496] [2019-11-15 23:06:47,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:06:47,201 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:06:47,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:06:47,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:06:47,201 INFO L87 Difference]: Start difference. First operand 3321 states and 7546 transitions. Second operand 6 states. [2019-11-15 23:06:47,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:06:47,383 INFO L93 Difference]: Finished difference Result 3701 states and 8348 transitions. [2019-11-15 23:06:47,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:06:47,384 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-11-15 23:06:47,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:06:47,387 INFO L225 Difference]: With dead ends: 3701 [2019-11-15 23:06:47,388 INFO L226 Difference]: Without dead ends: 3629 [2019-11-15 23:06:47,388 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:06:47,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3629 states. [2019-11-15 23:06:47,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3629 to 3104. [2019-11-15 23:06:47,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2019-11-15 23:06:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 7014 transitions. [2019-11-15 23:06:47,429 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 7014 transitions. Word has length 82 [2019-11-15 23:06:47,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:06:47,429 INFO L462 AbstractCegarLoop]: Abstraction has 3104 states and 7014 transitions. [2019-11-15 23:06:47,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:06:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 7014 transitions. [2019-11-15 23:06:47,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 23:06:47,433 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:47,433 INFO L380 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-11-15 23:06:47,433 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:47,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:47,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1781499583, now seen corresponding path program 2 times [2019-11-15 23:06:47,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:47,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517747975] [2019-11-15 23:06:47,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:47,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:47,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:47,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:06:47,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517747975] [2019-11-15 23:06:47,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:06:47,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:06:47,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237999005] [2019-11-15 23:06:47,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:06:47,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:06:47,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:06:47,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:06:47,574 INFO L87 Difference]: Start difference. First operand 3104 states and 7014 transitions. Second operand 7 states. [2019-11-15 23:06:47,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:06:47,648 INFO L93 Difference]: Finished difference Result 5310 states and 12039 transitions. [2019-11-15 23:06:47,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:06:47,649 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-11-15 23:06:47,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:06:47,651 INFO L225 Difference]: With dead ends: 5310 [2019-11-15 23:06:47,652 INFO L226 Difference]: Without dead ends: 2294 [2019-11-15 23:06:47,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:06:47,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2294 states. [2019-11-15 23:06:47,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2294 to 2294. [2019-11-15 23:06:47,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2294 states. [2019-11-15 23:06:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 5172 transitions. [2019-11-15 23:06:47,678 INFO L78 Accepts]: Start accepts. Automaton has 2294 states and 5172 transitions. Word has length 82 [2019-11-15 23:06:47,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:06:47,679 INFO L462 AbstractCegarLoop]: Abstraction has 2294 states and 5172 transitions. [2019-11-15 23:06:47,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:06:47,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 5172 transitions. [2019-11-15 23:06:47,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 23:06:47,681 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:06:47,682 INFO L380 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-11-15 23:06:47,682 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:06:47,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:47,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1233614151, now seen corresponding path program 3 times [2019-11-15 23:06:47,683 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:47,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309659528] [2019-11-15 23:06:47,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:47,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:47,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:47,772 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:06:47,772 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:06:47,892 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 23:06:47,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:06:47 BasicIcfg [2019-11-15 23:06:47,894 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:06:47,894 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:06:47,894 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:06:47,895 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:06:47,895 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:06:19" (3/4) ... [2019-11-15 23:06:47,897 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:06:48,055 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_093af816-1c2c-4005-8be7-19c1123e0e4f/bin/uautomizer/witness.graphml [2019-11-15 23:06:48,055 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:06:48,057 INFO L168 Benchmark]: Toolchain (without parser) took 30264.34 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.9 GB). Free memory was 940.7 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-15 23:06:48,057 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:06:48,058 INFO L168 Benchmark]: CACSL2BoogieTranslator took 619.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -206.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:06:48,058 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.27 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:06:48,058 INFO L168 Benchmark]: Boogie Preprocessor took 32.21 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-11-15 23:06:48,059 INFO L168 Benchmark]: RCFGBuilder took 744.29 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: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:06:48,059 INFO L168 Benchmark]: TraceAbstraction took 28654.46 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-15 23:06:48,059 INFO L168 Benchmark]: Witness Printer took 161.12 ms. Allocated memory is still 3.9 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:06:48,061 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 619.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -206.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.27 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.21 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 744.29 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: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28654.46 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 161.12 ms. Allocated memory is still 3.9 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 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: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L699] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L701] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 _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] [L703] 0 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] [L704] 0 _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] [L705] 0 _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] [L706] 0 _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] [L707] 0 _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] [L708] 0 _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] [L709] 0 _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] [L710] 0 _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] [L711] 0 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}] [L712] 0 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] [L713] 0 _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] [L714] 0 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] [L715] 0 _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] [L717] 0 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] [L718] 0 _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] [L719] 0 _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] [L789] 0 pthread_t t2571; 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] [L790] FCALL, FORK 0 pthread_create(&t2571, ((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] [L791] 0 pthread_t t2572; 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] [L792] FCALL, FORK 0 pthread_create(&t2572, ((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] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!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] [L758] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L759] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L760] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L761] 2 x$r_buff0_thd2 = (_Bool)1 [L764] 2 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] [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 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] [L732] 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] [L732] 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) [L733] 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] [L767] EXPR 2 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 : (!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] [L733] 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)) [L734] 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] [L734] 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)) [L735] 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] [L735] 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)) [L736] 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] [L736] 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)) [L737] 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] [L737] 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)) [L738] 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] [L738] 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)) [L739] 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] [L740] 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] [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_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, x=1, 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] [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 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=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=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 2 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 [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 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=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 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=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=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L771] 2 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 [L774] 2 __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=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x = x$flush_delayed ? x$mem_tmp : x [L741] 1 x$flush_delayed = (_Bool)0 [L746] 1 __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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 0 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 0 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L800] 0 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 [L801] EXPR 0 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] EXPR 0 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 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 [L805] 0 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 193 locations, 3 error locations. Result: UNSAFE, OverallTime: 28.4s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6340 SDtfs, 7882 SDslu, 13944 SDs, 0 SdLazy, 4998 SolverSat, 390 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57887occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 63263 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1489 NumberOfCodeBlocks, 1489 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1384 ConstructedInterpolants, 0 QuantifiedInterpolants, 234843 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...