./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_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_674e3948-2783-4252-a024-c572ac872959/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_674e3948-2783-4252-a024-c572ac872959/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_674e3948-2783-4252-a024-c572ac872959/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_674e3948-2783-4252-a024-c572ac872959/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_674e3948-2783-4252-a024-c572ac872959/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_674e3948-2783-4252-a024-c572ac872959/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 600b3f8ed1ae6a83367c916dba179aeec96a795d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 22:24:55,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:24:55,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:24:55,213 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:24:55,214 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:24:55,215 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:24:55,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:24:55,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:24:55,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:24:55,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:24:55,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:24:55,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:24:55,237 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:24:55,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:24:55,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:24:55,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:24:55,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:24:55,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:24:55,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:24:55,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:24:55,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:24:55,254 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:24:55,257 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:24:55,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:24:55,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:24:55,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:24:55,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:24:55,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:24:55,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:24:55,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:24:55,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:24:55,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:24:55,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:24:55,267 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:24:55,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:24:55,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:24:55,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:24:55,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:24:55,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:24:55,271 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:24:55,272 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:24:55,273 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_674e3948-2783-4252-a024-c572ac872959/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:24:55,299 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:24:55,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:24:55,301 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:24:55,301 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:24:55,301 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:24:55,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:24:55,302 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:24:55,302 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:24:55,302 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:24:55,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:24:55,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:24:55,303 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:24:55,303 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:24:55,303 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:24:55,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:24:55,304 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:24:55,304 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:24:55,304 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:24:55,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:24:55,305 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:24:55,305 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:24:55,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:24:55,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:24:55,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:24:55,306 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:24:55,306 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:24:55,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:24:55,307 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:24:55,307 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_674e3948-2783-4252-a024-c572ac872959/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 -> 600b3f8ed1ae6a83367c916dba179aeec96a795d [2019-11-15 22:24:55,356 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:24:55,372 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:24:55,376 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:24:55,378 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:24:55,378 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:24:55,380 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_674e3948-2783-4252-a024-c572ac872959/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi003_rmo.opt.i [2019-11-15 22:24:55,449 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_674e3948-2783-4252-a024-c572ac872959/bin/uautomizer/data/140edcf29/1366a83abcef4b3694a5fcaa9acebd4b/FLAGd10900a1b [2019-11-15 22:24:55,944 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:24:55,944 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_674e3948-2783-4252-a024-c572ac872959/sv-benchmarks/c/pthread-wmm/rfi003_rmo.opt.i [2019-11-15 22:24:55,962 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_674e3948-2783-4252-a024-c572ac872959/bin/uautomizer/data/140edcf29/1366a83abcef4b3694a5fcaa9acebd4b/FLAGd10900a1b [2019-11-15 22:24:56,255 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_674e3948-2783-4252-a024-c572ac872959/bin/uautomizer/data/140edcf29/1366a83abcef4b3694a5fcaa9acebd4b [2019-11-15 22:24:56,258 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:24:56,259 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:24:56,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:24:56,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:24:56,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:24:56,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:24:56" (1/1) ... [2019-11-15 22:24:56,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c12a99e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:56, skipping insertion in model container [2019-11-15 22:24:56,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:24:56" (1/1) ... [2019-11-15 22:24:56,278 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:24:56,342 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:24:56,923 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:24:56,935 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:24:56,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:24:57,073 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:24:57,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:57 WrapperNode [2019-11-15 22:24:57,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:24:57,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:24:57,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:24:57,076 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:24:57,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:57" (1/1) ... [2019-11-15 22:24:57,106 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:57" (1/1) ... [2019-11-15 22:24:57,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:24:57,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:24:57,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:24:57,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:24:57,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:57" (1/1) ... [2019-11-15 22:24:57,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:57" (1/1) ... [2019-11-15 22:24:57,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:57" (1/1) ... [2019-11-15 22:24:57,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:57" (1/1) ... [2019-11-15 22:24:57,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:57" (1/1) ... [2019-11-15 22:24:57,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:57" (1/1) ... [2019-11-15 22:24:57,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:57" (1/1) ... [2019-11-15 22:24:57,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:24:57,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:24:57,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:24:57,209 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:24:57,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_674e3948-2783-4252-a024-c572ac872959/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 22:24:57,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:24:57,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 22:24:57,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:24:57,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:24:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 22:24:57,290 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 22:24:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 22:24:57,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 22:24:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 22:24:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:24:57,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:24:57,295 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 22:24:58,134 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:24:58,135 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 22:24:58,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:24:58 BoogieIcfgContainer [2019-11-15 22:24:58,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:24:58,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:24:58,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:24:58,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:24:58,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:24:56" (1/3) ... [2019-11-15 22:24:58,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bd5d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:24:58, skipping insertion in model container [2019-11-15 22:24:58,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:24:57" (2/3) ... [2019-11-15 22:24:58,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bd5d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:24:58, skipping insertion in model container [2019-11-15 22:24:58,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:24:58" (3/3) ... [2019-11-15 22:24:58,143 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_rmo.opt.i [2019-11-15 22:24:58,185 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,186 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,186 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,186 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,186 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,187 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,187 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,187 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,187 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,189 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,190 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,190 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,190 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,190 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,191 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,191 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,191 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,191 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,192 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,192 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,192 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,192 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,193 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,193 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,193 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,194 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,195 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,195 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,195 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,195 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,195 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,196 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,196 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,196 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,196 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,197 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,197 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,197 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,197 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,198 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,198 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,199 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,199 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,199 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,200 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,200 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,201 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,201 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,201 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,202 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,202 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,202 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,202 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,203 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,203 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,203 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,204 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,205 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,205 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,205 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,205 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,206 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,206 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,207 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,207 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,207 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,207 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,207 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,208 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,208 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,209 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,209 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,210 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,210 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,210 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,211 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,211 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,211 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,211 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,211 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,212 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,212 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,212 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,212 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,213 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,213 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,213 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,213 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,214 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,214 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,214 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,215 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,220 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,220 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,222 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,222 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,222 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,224 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,224 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,224 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,225 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,228 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,229 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,229 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,229 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,229 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,230 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,231 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,231 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,231 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,231 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,231 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,231 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,231 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,232 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,232 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,232 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,232 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,232 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,233 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,233 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,233 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,233 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,233 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,233 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,234 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,234 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,234 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:24:58,243 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 22:24:58,243 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:24:58,251 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 22:24:58,262 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 22:24:58,282 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:24:58,282 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:24:58,282 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:24:58,282 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:24:58,283 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:24:58,283 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:24:58,283 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:24:58,283 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:24:58,295 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 129 places, 161 transitions [2019-11-15 22:25:00,457 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25975 states. [2019-11-15 22:25:00,459 INFO L276 IsEmpty]: Start isEmpty. Operand 25975 states. [2019-11-15 22:25:00,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 22:25:00,469 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:00,470 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] [2019-11-15 22:25:00,472 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:00,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:00,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1135396639, now seen corresponding path program 1 times [2019-11-15 22:25:00,486 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:00,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711145021] [2019-11-15 22:25:00,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:00,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:00,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:00,768 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 22:25:00,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711145021] [2019-11-15 22:25:00,770 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:00,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:00,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034291351] [2019-11-15 22:25:00,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:00,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:00,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:00,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:00,792 INFO L87 Difference]: Start difference. First operand 25975 states. Second operand 4 states. [2019-11-15 22:25:01,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:01,504 INFO L93 Difference]: Finished difference Result 26615 states and 102120 transitions. [2019-11-15 22:25:01,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:01,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-15 22:25:01,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:01,768 INFO L225 Difference]: With dead ends: 26615 [2019-11-15 22:25:01,769 INFO L226 Difference]: Without dead ends: 20359 [2019-11-15 22:25:01,770 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 22:25:02,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20359 states. [2019-11-15 22:25:02,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20359 to 20359. [2019-11-15 22:25:02,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20359 states. [2019-11-15 22:25:03,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20359 states to 20359 states and 78424 transitions. [2019-11-15 22:25:03,273 INFO L78 Accepts]: Start accepts. Automaton has 20359 states and 78424 transitions. Word has length 38 [2019-11-15 22:25:03,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:03,274 INFO L462 AbstractCegarLoop]: Abstraction has 20359 states and 78424 transitions. [2019-11-15 22:25:03,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:03,274 INFO L276 IsEmpty]: Start isEmpty. Operand 20359 states and 78424 transitions. [2019-11-15 22:25:03,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 22:25:03,286 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:03,286 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] [2019-11-15 22:25:03,286 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:03,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:03,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1334378173, now seen corresponding path program 1 times [2019-11-15 22:25:03,287 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:03,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013117735] [2019-11-15 22:25:03,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:03,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:03,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:03,412 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 22:25:03,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013117735] [2019-11-15 22:25:03,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:03,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:25:03,413 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201371054] [2019-11-15 22:25:03,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:25:03,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:03,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:25:03,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:25:03,415 INFO L87 Difference]: Start difference. First operand 20359 states and 78424 transitions. Second operand 5 states. [2019-11-15 22:25:04,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:04,933 INFO L93 Difference]: Finished difference Result 31837 states and 116041 transitions. [2019-11-15 22:25:04,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:25:04,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-15 22:25:04,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:05,416 INFO L225 Difference]: With dead ends: 31837 [2019-11-15 22:25:05,417 INFO L226 Difference]: Without dead ends: 31285 [2019-11-15 22:25:05,418 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 22:25:05,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31285 states. [2019-11-15 22:25:06,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31285 to 29704. [2019-11-15 22:25:06,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29704 states. [2019-11-15 22:25:06,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29704 states to 29704 states and 109518 transitions. [2019-11-15 22:25:06,536 INFO L78 Accepts]: Start accepts. Automaton has 29704 states and 109518 transitions. Word has length 46 [2019-11-15 22:25:06,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:06,538 INFO L462 AbstractCegarLoop]: Abstraction has 29704 states and 109518 transitions. [2019-11-15 22:25:06,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:25:06,539 INFO L276 IsEmpty]: Start isEmpty. Operand 29704 states and 109518 transitions. [2019-11-15 22:25:06,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 22:25:06,548 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:06,548 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 22:25:06,549 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:06,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:06,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1293014968, now seen corresponding path program 1 times [2019-11-15 22:25:06,551 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:06,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283684433] [2019-11-15 22:25:06,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:06,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:06,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:06,724 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 22:25:06,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283684433] [2019-11-15 22:25:06,725 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:06,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:25:06,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343764528] [2019-11-15 22:25:06,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:25:06,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:06,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:25:06,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:25:06,736 INFO L87 Difference]: Start difference. First operand 29704 states and 109518 transitions. Second operand 5 states. [2019-11-15 22:25:07,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:07,736 INFO L93 Difference]: Finished difference Result 38695 states and 139690 transitions. [2019-11-15 22:25:07,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:25:07,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-15 22:25:07,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:07,899 INFO L225 Difference]: With dead ends: 38695 [2019-11-15 22:25:07,899 INFO L226 Difference]: Without dead ends: 38247 [2019-11-15 22:25:07,900 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 22:25:08,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38247 states. [2019-11-15 22:25:09,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38247 to 32950. [2019-11-15 22:25:09,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32950 states. [2019-11-15 22:25:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32950 states to 32950 states and 120527 transitions. [2019-11-15 22:25:09,390 INFO L78 Accepts]: Start accepts. Automaton has 32950 states and 120527 transitions. Word has length 47 [2019-11-15 22:25:09,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:09,391 INFO L462 AbstractCegarLoop]: Abstraction has 32950 states and 120527 transitions. [2019-11-15 22:25:09,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:25:09,391 INFO L276 IsEmpty]: Start isEmpty. Operand 32950 states and 120527 transitions. [2019-11-15 22:25:09,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:25:09,403 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:09,403 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] [2019-11-15 22:25:09,404 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:09,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:09,406 INFO L82 PathProgramCache]: Analyzing trace with hash -458309778, now seen corresponding path program 1 times [2019-11-15 22:25:09,406 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:09,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441598803] [2019-11-15 22:25:09,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:09,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:09,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:09,479 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 22:25:09,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441598803] [2019-11-15 22:25:09,480 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:09,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:25:09,480 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726443127] [2019-11-15 22:25:09,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:09,481 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:09,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:09,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:09,482 INFO L87 Difference]: Start difference. First operand 32950 states and 120527 transitions. Second operand 3 states. [2019-11-15 22:25:09,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:09,725 INFO L93 Difference]: Finished difference Result 42411 states and 152018 transitions. [2019-11-15 22:25:09,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:09,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-15 22:25:09,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:09,895 INFO L225 Difference]: With dead ends: 42411 [2019-11-15 22:25:09,895 INFO L226 Difference]: Without dead ends: 42411 [2019-11-15 22:25:09,895 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 22:25:10,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42411 states. [2019-11-15 22:25:10,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42411 to 37664. [2019-11-15 22:25:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37664 states. [2019-11-15 22:25:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37664 states to 37664 states and 136331 transitions. [2019-11-15 22:25:11,523 INFO L78 Accepts]: Start accepts. Automaton has 37664 states and 136331 transitions. Word has length 49 [2019-11-15 22:25:11,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:11,523 INFO L462 AbstractCegarLoop]: Abstraction has 37664 states and 136331 transitions. [2019-11-15 22:25:11,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:11,523 INFO L276 IsEmpty]: Start isEmpty. Operand 37664 states and 136331 transitions. [2019-11-15 22:25:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 22:25:11,539 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:11,539 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] [2019-11-15 22:25:11,539 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:11,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:11,540 INFO L82 PathProgramCache]: Analyzing trace with hash 744447353, now seen corresponding path program 1 times [2019-11-15 22:25:11,540 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:11,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70735563] [2019-11-15 22:25:11,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:11,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:11,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:11,621 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 22:25:11,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70735563] [2019-11-15 22:25:11,621 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:11,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:25:11,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712168404] [2019-11-15 22:25:11,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:25:11,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:11,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:25:11,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:25:11,623 INFO L87 Difference]: Start difference. First operand 37664 states and 136331 transitions. Second operand 6 states. [2019-11-15 22:25:12,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:12,363 INFO L93 Difference]: Finished difference Result 48755 states and 172980 transitions. [2019-11-15 22:25:12,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:25:12,364 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-15 22:25:12,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:12,565 INFO L225 Difference]: With dead ends: 48755 [2019-11-15 22:25:12,566 INFO L226 Difference]: Without dead ends: 48235 [2019-11-15 22:25:12,567 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 22:25:12,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48235 states. [2019-11-15 22:25:13,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48235 to 38228. [2019-11-15 22:25:13,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38228 states. [2019-11-15 22:25:13,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38228 states to 38228 states and 138494 transitions. [2019-11-15 22:25:13,990 INFO L78 Accepts]: Start accepts. Automaton has 38228 states and 138494 transitions. Word has length 53 [2019-11-15 22:25:13,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:13,990 INFO L462 AbstractCegarLoop]: Abstraction has 38228 states and 138494 transitions. [2019-11-15 22:25:13,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:25:13,990 INFO L276 IsEmpty]: Start isEmpty. Operand 38228 states and 138494 transitions. [2019-11-15 22:25:14,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 22:25:14,006 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:14,006 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] [2019-11-15 22:25:14,006 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:14,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:14,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1933781412, now seen corresponding path program 1 times [2019-11-15 22:25:14,007 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:14,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476183749] [2019-11-15 22:25:14,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:14,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:14,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:14,188 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 22:25:14,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476183749] [2019-11-15 22:25:14,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:14,191 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:25:14,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570573995] [2019-11-15 22:25:14,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:25:14,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:14,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:25:14,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:25:14,193 INFO L87 Difference]: Start difference. First operand 38228 states and 138494 transitions. Second operand 6 states. [2019-11-15 22:25:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:15,056 INFO L93 Difference]: Finished difference Result 53004 states and 189570 transitions. [2019-11-15 22:25:15,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:25:15,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-15 22:25:15,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:15,197 INFO L225 Difference]: With dead ends: 53004 [2019-11-15 22:25:15,197 INFO L226 Difference]: Without dead ends: 52028 [2019-11-15 22:25:15,198 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:25:15,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52028 states. [2019-11-15 22:25:16,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52028 to 48781. [2019-11-15 22:25:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48781 states. [2019-11-15 22:25:16,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48781 states to 48781 states and 175225 transitions. [2019-11-15 22:25:16,208 INFO L78 Accepts]: Start accepts. Automaton has 48781 states and 175225 transitions. Word has length 53 [2019-11-15 22:25:16,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:16,209 INFO L462 AbstractCegarLoop]: Abstraction has 48781 states and 175225 transitions. [2019-11-15 22:25:16,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:25:16,209 INFO L276 IsEmpty]: Start isEmpty. Operand 48781 states and 175225 transitions. [2019-11-15 22:25:16,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 22:25:16,223 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:16,223 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] [2019-11-15 22:25:16,223 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:16,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:16,224 INFO L82 PathProgramCache]: Analyzing trace with hash 136830053, now seen corresponding path program 1 times [2019-11-15 22:25:16,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:16,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991525650] [2019-11-15 22:25:16,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:16,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:16,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:16,340 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 22:25:16,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991525650] [2019-11-15 22:25:16,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:16,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:25:16,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771768258] [2019-11-15 22:25:16,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:25:16,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:16,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:25:16,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:25:16,343 INFO L87 Difference]: Start difference. First operand 48781 states and 175225 transitions. Second operand 7 states. [2019-11-15 22:25:17,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:17,754 INFO L93 Difference]: Finished difference Result 70896 states and 244522 transitions. [2019-11-15 22:25:17,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:25:17,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-15 22:25:17,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:17,908 INFO L225 Difference]: With dead ends: 70896 [2019-11-15 22:25:17,908 INFO L226 Difference]: Without dead ends: 70896 [2019-11-15 22:25:17,908 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 22:25:18,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70896 states. [2019-11-15 22:25:18,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70896 to 57889. [2019-11-15 22:25:18,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57889 states. [2019-11-15 22:25:19,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57889 states to 57889 states and 203149 transitions. [2019-11-15 22:25:19,098 INFO L78 Accepts]: Start accepts. Automaton has 57889 states and 203149 transitions. Word has length 53 [2019-11-15 22:25:19,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:19,099 INFO L462 AbstractCegarLoop]: Abstraction has 57889 states and 203149 transitions. [2019-11-15 22:25:19,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:25:19,099 INFO L276 IsEmpty]: Start isEmpty. Operand 57889 states and 203149 transitions. [2019-11-15 22:25:19,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 22:25:19,114 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:19,114 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] [2019-11-15 22:25:19,114 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:19,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:19,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1024333734, now seen corresponding path program 1 times [2019-11-15 22:25:19,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:19,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402643529] [2019-11-15 22:25:19,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:19,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:19,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:19,170 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 22:25:19,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402643529] [2019-11-15 22:25:19,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:19,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:25:19,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850788280] [2019-11-15 22:25:19,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:25:19,172 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:19,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:25:19,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:19,172 INFO L87 Difference]: Start difference. First operand 57889 states and 203149 transitions. Second operand 3 states. [2019-11-15 22:25:19,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:19,763 INFO L93 Difference]: Finished difference Result 43855 states and 152832 transitions. [2019-11-15 22:25:19,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:25:19,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-15 22:25:19,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:19,872 INFO L225 Difference]: With dead ends: 43855 [2019-11-15 22:25:19,872 INFO L226 Difference]: Without dead ends: 43351 [2019-11-15 22:25:19,873 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:25:20,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43351 states. [2019-11-15 22:25:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43351 to 41885. [2019-11-15 22:25:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41885 states. [2019-11-15 22:25:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41885 states to 41885 states and 146703 transitions. [2019-11-15 22:25:20,728 INFO L78 Accepts]: Start accepts. Automaton has 41885 states and 146703 transitions. Word has length 53 [2019-11-15 22:25:20,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:20,728 INFO L462 AbstractCegarLoop]: Abstraction has 41885 states and 146703 transitions. [2019-11-15 22:25:20,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:25:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 41885 states and 146703 transitions. [2019-11-15 22:25:20,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 22:25:20,740 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:20,741 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] [2019-11-15 22:25:20,741 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:20,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:20,741 INFO L82 PathProgramCache]: Analyzing trace with hash 765117548, now seen corresponding path program 1 times [2019-11-15 22:25:20,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:20,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666723644] [2019-11-15 22:25:20,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:20,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:20,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:20,840 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 22:25:20,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666723644] [2019-11-15 22:25:20,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:20,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:25:20,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379392966] [2019-11-15 22:25:20,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:25:20,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:20,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:25:20,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:25:20,843 INFO L87 Difference]: Start difference. First operand 41885 states and 146703 transitions. Second operand 6 states. [2019-11-15 22:25:21,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:21,525 INFO L93 Difference]: Finished difference Result 54548 states and 184833 transitions. [2019-11-15 22:25:21,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:25:21,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-15 22:25:21,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:21,638 INFO L225 Difference]: With dead ends: 54548 [2019-11-15 22:25:21,638 INFO L226 Difference]: Without dead ends: 54548 [2019-11-15 22:25:21,639 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:25:21,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54548 states. [2019-11-15 22:25:22,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54548 to 45860. [2019-11-15 22:25:22,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45860 states. [2019-11-15 22:25:22,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45860 states to 45860 states and 158166 transitions. [2019-11-15 22:25:22,714 INFO L78 Accepts]: Start accepts. Automaton has 45860 states and 158166 transitions. Word has length 54 [2019-11-15 22:25:22,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:22,714 INFO L462 AbstractCegarLoop]: Abstraction has 45860 states and 158166 transitions. [2019-11-15 22:25:22,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:25:22,715 INFO L276 IsEmpty]: Start isEmpty. Operand 45860 states and 158166 transitions. [2019-11-15 22:25:22,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 22:25:22,729 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:22,729 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] [2019-11-15 22:25:22,729 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:22,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:22,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1652621229, now seen corresponding path program 1 times [2019-11-15 22:25:22,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:22,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856634353] [2019-11-15 22:25:22,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:22,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:22,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:22,815 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 22:25:22,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856634353] [2019-11-15 22:25:22,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:22,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:22,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029944729] [2019-11-15 22:25:22,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:22,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:22,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:22,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:22,818 INFO L87 Difference]: Start difference. First operand 45860 states and 158166 transitions. Second operand 4 states. [2019-11-15 22:25:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:22,876 INFO L93 Difference]: Finished difference Result 8162 states and 24870 transitions. [2019-11-15 22:25:22,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:25:22,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-15 22:25:22,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:22,886 INFO L225 Difference]: With dead ends: 8162 [2019-11-15 22:25:22,886 INFO L226 Difference]: Without dead ends: 6753 [2019-11-15 22:25:22,886 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 22:25:22,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6753 states. [2019-11-15 22:25:22,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6753 to 6705. [2019-11-15 22:25:22,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6705 states. [2019-11-15 22:25:23,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6705 states to 6705 states and 20039 transitions. [2019-11-15 22:25:23,005 INFO L78 Accepts]: Start accepts. Automaton has 6705 states and 20039 transitions. Word has length 54 [2019-11-15 22:25:23,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:23,005 INFO L462 AbstractCegarLoop]: Abstraction has 6705 states and 20039 transitions. [2019-11-15 22:25:23,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 6705 states and 20039 transitions. [2019-11-15 22:25:23,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 22:25:23,011 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:23,011 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 22:25:23,011 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:23,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:23,012 INFO L82 PathProgramCache]: Analyzing trace with hash 779185304, now seen corresponding path program 1 times [2019-11-15 22:25:23,012 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:23,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394539560] [2019-11-15 22:25:23,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:23,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:23,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:23,070 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 22:25:23,070 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394539560] [2019-11-15 22:25:23,070 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:23,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:23,070 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533819367] [2019-11-15 22:25:23,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:23,071 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:23,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:23,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:23,071 INFO L87 Difference]: Start difference. First operand 6705 states and 20039 transitions. Second operand 4 states. [2019-11-15 22:25:23,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:23,273 INFO L93 Difference]: Finished difference Result 7890 states and 23388 transitions. [2019-11-15 22:25:23,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:25:23,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-15 22:25:23,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:23,288 INFO L225 Difference]: With dead ends: 7890 [2019-11-15 22:25:23,288 INFO L226 Difference]: Without dead ends: 7890 [2019-11-15 22:25:23,289 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 22:25:23,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7890 states. [2019-11-15 22:25:23,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7890 to 7212. [2019-11-15 22:25:23,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7212 states. [2019-11-15 22:25:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7212 states to 7212 states and 21445 transitions. [2019-11-15 22:25:23,431 INFO L78 Accepts]: Start accepts. Automaton has 7212 states and 21445 transitions. Word has length 63 [2019-11-15 22:25:23,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:23,431 INFO L462 AbstractCegarLoop]: Abstraction has 7212 states and 21445 transitions. [2019-11-15 22:25:23,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 7212 states and 21445 transitions. [2019-11-15 22:25:23,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 22:25:23,445 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:23,446 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 22:25:23,446 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:23,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:23,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1772971657, now seen corresponding path program 1 times [2019-11-15 22:25:23,446 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:23,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117662251] [2019-11-15 22:25:23,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:23,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:23,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:23,557 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 22:25:23,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117662251] [2019-11-15 22:25:23,558 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:23,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:25:23,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044265743] [2019-11-15 22:25:23,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:25:23,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:23,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:25:23,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:25:23,560 INFO L87 Difference]: Start difference. First operand 7212 states and 21445 transitions. Second operand 6 states. [2019-11-15 22:25:23,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:23,881 INFO L93 Difference]: Finished difference Result 9267 states and 27194 transitions. [2019-11-15 22:25:23,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:25:23,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-11-15 22:25:23,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:23,897 INFO L225 Difference]: With dead ends: 9267 [2019-11-15 22:25:23,897 INFO L226 Difference]: Without dead ends: 9219 [2019-11-15 22:25:23,897 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:25:23,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9219 states. [2019-11-15 22:25:24,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9219 to 8051. [2019-11-15 22:25:24,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8051 states. [2019-11-15 22:25:24,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8051 states to 8051 states and 23825 transitions. [2019-11-15 22:25:24,045 INFO L78 Accepts]: Start accepts. Automaton has 8051 states and 23825 transitions. Word has length 63 [2019-11-15 22:25:24,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:24,046 INFO L462 AbstractCegarLoop]: Abstraction has 8051 states and 23825 transitions. [2019-11-15 22:25:24,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:25:24,046 INFO L276 IsEmpty]: Start isEmpty. Operand 8051 states and 23825 transitions. [2019-11-15 22:25:24,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:25:24,054 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:24,054 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] [2019-11-15 22:25:24,054 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:24,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:24,055 INFO L82 PathProgramCache]: Analyzing trace with hash 238487578, now seen corresponding path program 1 times [2019-11-15 22:25:24,055 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:24,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345064777] [2019-11-15 22:25:24,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:24,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:24,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:24,136 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 22:25:24,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345064777] [2019-11-15 22:25:24,137 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:24,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:24,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032065837] [2019-11-15 22:25:24,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:24,137 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:24,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:24,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:24,138 INFO L87 Difference]: Start difference. First operand 8051 states and 23825 transitions. Second operand 4 states. [2019-11-15 22:25:24,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:24,411 INFO L93 Difference]: Finished difference Result 10664 states and 31174 transitions. [2019-11-15 22:25:24,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:25:24,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-15 22:25:24,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:24,431 INFO L225 Difference]: With dead ends: 10664 [2019-11-15 22:25:24,431 INFO L226 Difference]: Without dead ends: 10664 [2019-11-15 22:25:24,432 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 22:25:24,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10664 states. [2019-11-15 22:25:24,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10664 to 9074. [2019-11-15 22:25:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9074 states. [2019-11-15 22:25:24,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9074 states to 9074 states and 26644 transitions. [2019-11-15 22:25:24,593 INFO L78 Accepts]: Start accepts. Automaton has 9074 states and 26644 transitions. Word has length 67 [2019-11-15 22:25:24,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:24,593 INFO L462 AbstractCegarLoop]: Abstraction has 9074 states and 26644 transitions. [2019-11-15 22:25:24,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:24,593 INFO L276 IsEmpty]: Start isEmpty. Operand 9074 states and 26644 transitions. [2019-11-15 22:25:24,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:25:24,601 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:24,601 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] [2019-11-15 22:25:24,601 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:24,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:24,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1483252059, now seen corresponding path program 1 times [2019-11-15 22:25:24,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:24,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888967376] [2019-11-15 22:25:24,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:24,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:24,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:24,724 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 22:25:24,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888967376] [2019-11-15 22:25:24,725 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:24,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:25:24,725 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214678334] [2019-11-15 22:25:24,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:25:24,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:24,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:25:24,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:25:24,727 INFO L87 Difference]: Start difference. First operand 9074 states and 26644 transitions. Second operand 6 states. [2019-11-15 22:25:25,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:25,206 INFO L93 Difference]: Finished difference Result 10384 states and 29895 transitions. [2019-11-15 22:25:25,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:25:25,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-15 22:25:25,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:25,220 INFO L225 Difference]: With dead ends: 10384 [2019-11-15 22:25:25,220 INFO L226 Difference]: Without dead ends: 10384 [2019-11-15 22:25:25,220 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:25:25,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10384 states. [2019-11-15 22:25:25,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10384 to 10081. [2019-11-15 22:25:25,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10081 states. [2019-11-15 22:25:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10081 states to 10081 states and 29118 transitions. [2019-11-15 22:25:25,360 INFO L78 Accepts]: Start accepts. Automaton has 10081 states and 29118 transitions. Word has length 67 [2019-11-15 22:25:25,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:25,360 INFO L462 AbstractCegarLoop]: Abstraction has 10081 states and 29118 transitions. [2019-11-15 22:25:25,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:25:25,361 INFO L276 IsEmpty]: Start isEmpty. Operand 10081 states and 29118 transitions. [2019-11-15 22:25:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:25:25,370 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:25,370 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] [2019-11-15 22:25:25,371 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:25,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:25,371 INFO L82 PathProgramCache]: Analyzing trace with hash -593957284, now seen corresponding path program 1 times [2019-11-15 22:25:25,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:25,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458994318] [2019-11-15 22:25:25,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:25,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:25,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:25,473 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 22:25:25,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458994318] [2019-11-15 22:25:25,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:25,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:25:25,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951373431] [2019-11-15 22:25:25,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:25:25,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:25,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:25:25,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:25:25,475 INFO L87 Difference]: Start difference. First operand 10081 states and 29118 transitions. Second operand 6 states. [2019-11-15 22:25:25,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:25,808 INFO L93 Difference]: Finished difference Result 11998 states and 33625 transitions. [2019-11-15 22:25:25,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:25:25,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-15 22:25:25,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:25,822 INFO L225 Difference]: With dead ends: 11998 [2019-11-15 22:25:25,822 INFO L226 Difference]: Without dead ends: 11998 [2019-11-15 22:25:25,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:25:25,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11998 states. [2019-11-15 22:25:25,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11998 to 10300. [2019-11-15 22:25:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10300 states. [2019-11-15 22:25:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10300 states to 10300 states and 29170 transitions. [2019-11-15 22:25:25,962 INFO L78 Accepts]: Start accepts. Automaton has 10300 states and 29170 transitions. Word has length 67 [2019-11-15 22:25:25,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:25,963 INFO L462 AbstractCegarLoop]: Abstraction has 10300 states and 29170 transitions. [2019-11-15 22:25:25,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:25:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 10300 states and 29170 transitions. [2019-11-15 22:25:25,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:25:25,972 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:25,973 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] [2019-11-15 22:25:25,973 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:25,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:25,973 INFO L82 PathProgramCache]: Analyzing trace with hash -382606371, now seen corresponding path program 1 times [2019-11-15 22:25:25,974 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:25,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517423685] [2019-11-15 22:25:25,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:25,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:25,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:26,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 22:25:26,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517423685] [2019-11-15 22:25:26,064 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:26,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:25:26,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836732609] [2019-11-15 22:25:26,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:25:26,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:26,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:25:26,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:25:26,068 INFO L87 Difference]: Start difference. First operand 10300 states and 29170 transitions. Second operand 5 states. [2019-11-15 22:25:26,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:26,397 INFO L93 Difference]: Finished difference Result 12575 states and 35463 transitions. [2019-11-15 22:25:26,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:25:26,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-15 22:25:26,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:26,413 INFO L225 Difference]: With dead ends: 12575 [2019-11-15 22:25:26,413 INFO L226 Difference]: Without dead ends: 12575 [2019-11-15 22:25:26,414 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 22:25:26,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12575 states. [2019-11-15 22:25:26,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12575 to 11075. [2019-11-15 22:25:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11075 states. [2019-11-15 22:25:26,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11075 states to 11075 states and 31104 transitions. [2019-11-15 22:25:26,562 INFO L78 Accepts]: Start accepts. Automaton has 11075 states and 31104 transitions. Word has length 67 [2019-11-15 22:25:26,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:26,562 INFO L462 AbstractCegarLoop]: Abstraction has 11075 states and 31104 transitions. [2019-11-15 22:25:26,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:25:26,562 INFO L276 IsEmpty]: Start isEmpty. Operand 11075 states and 31104 transitions. [2019-11-15 22:25:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:25:26,569 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:26,570 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] [2019-11-15 22:25:26,570 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:26,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:26,570 INFO L82 PathProgramCache]: Analyzing trace with hash -893140548, now seen corresponding path program 1 times [2019-11-15 22:25:26,570 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:26,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613373008] [2019-11-15 22:25:26,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:26,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:26,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:26,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 22:25:26,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613373008] [2019-11-15 22:25:26,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:26,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:25:26,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638431167] [2019-11-15 22:25:26,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:25:26,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:26,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:25:26,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:25:26,639 INFO L87 Difference]: Start difference. First operand 11075 states and 31104 transitions. Second operand 5 states. [2019-11-15 22:25:26,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:26,676 INFO L93 Difference]: Finished difference Result 4403 states and 10324 transitions. [2019-11-15 22:25:26,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:25:26,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-15 22:25:26,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:26,679 INFO L225 Difference]: With dead ends: 4403 [2019-11-15 22:25:26,679 INFO L226 Difference]: Without dead ends: 3645 [2019-11-15 22:25:26,680 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 22:25:26,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3645 states. [2019-11-15 22:25:26,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3645 to 3159. [2019-11-15 22:25:26,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3159 states. [2019-11-15 22:25:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3159 states to 3159 states and 7275 transitions. [2019-11-15 22:25:26,712 INFO L78 Accepts]: Start accepts. Automaton has 3159 states and 7275 transitions. Word has length 67 [2019-11-15 22:25:26,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:26,712 INFO L462 AbstractCegarLoop]: Abstraction has 3159 states and 7275 transitions. [2019-11-15 22:25:26,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:25:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3159 states and 7275 transitions. [2019-11-15 22:25:26,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 22:25:26,715 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:26,715 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, 1, 1] [2019-11-15 22:25:26,715 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:26,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:26,715 INFO L82 PathProgramCache]: Analyzing trace with hash -878698336, now seen corresponding path program 1 times [2019-11-15 22:25:26,715 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:26,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996113452] [2019-11-15 22:25:26,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:26,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:26,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:26,838 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 22:25:26,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996113452] [2019-11-15 22:25:26,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:26,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:25:26,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989921854] [2019-11-15 22:25:26,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:25:26,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:26,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:25:26,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:25:26,841 INFO L87 Difference]: Start difference. First operand 3159 states and 7275 transitions. Second operand 7 states. [2019-11-15 22:25:27,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:27,572 INFO L93 Difference]: Finished difference Result 4568 states and 10605 transitions. [2019-11-15 22:25:27,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:25:27,572 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-11-15 22:25:27,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:27,576 INFO L225 Difference]: With dead ends: 4568 [2019-11-15 22:25:27,577 INFO L226 Difference]: Without dead ends: 4550 [2019-11-15 22:25:27,577 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:25:27,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2019-11-15 22:25:27,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 3925. [2019-11-15 22:25:27,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3925 states. [2019-11-15 22:25:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 9171 transitions. [2019-11-15 22:25:27,620 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 9171 transitions. Word has length 84 [2019-11-15 22:25:27,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:27,620 INFO L462 AbstractCegarLoop]: Abstraction has 3925 states and 9171 transitions. [2019-11-15 22:25:27,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:25:27,620 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 9171 transitions. [2019-11-15 22:25:27,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 22:25:27,624 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:27,624 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, 1, 1] [2019-11-15 22:25:27,624 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:27,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:27,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1619317601, now seen corresponding path program 1 times [2019-11-15 22:25:27,625 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:27,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027755998] [2019-11-15 22:25:27,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:27,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:27,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:27,785 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 22:25:27,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027755998] [2019-11-15 22:25:27,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:27,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:25:27,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260260255] [2019-11-15 22:25:27,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:25:27,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:27,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:25:27,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:25:27,789 INFO L87 Difference]: Start difference. First operand 3925 states and 9171 transitions. Second operand 6 states. [2019-11-15 22:25:28,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:28,048 INFO L93 Difference]: Finished difference Result 3510 states and 8032 transitions. [2019-11-15 22:25:28,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:25:28,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-11-15 22:25:28,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:28,053 INFO L225 Difference]: With dead ends: 3510 [2019-11-15 22:25:28,053 INFO L226 Difference]: Without dead ends: 3452 [2019-11-15 22:25:28,053 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:25:28,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3452 states. [2019-11-15 22:25:28,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3452 to 3091. [2019-11-15 22:25:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3091 states. [2019-11-15 22:25:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3091 states to 3091 states and 7081 transitions. [2019-11-15 22:25:28,092 INFO L78 Accepts]: Start accepts. Automaton has 3091 states and 7081 transitions. Word has length 84 [2019-11-15 22:25:28,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:28,093 INFO L462 AbstractCegarLoop]: Abstraction has 3091 states and 7081 transitions. [2019-11-15 22:25:28,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:25:28,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3091 states and 7081 transitions. [2019-11-15 22:25:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 22:25:28,096 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:28,097 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, 1, 1] [2019-11-15 22:25:28,097 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:28,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:28,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1849593794, now seen corresponding path program 1 times [2019-11-15 22:25:28,098 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:28,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682739092] [2019-11-15 22:25:28,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:28,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:28,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:28,165 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 22:25:28,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682739092] [2019-11-15 22:25:28,166 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:28,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:25:28,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171446746] [2019-11-15 22:25:28,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:25:28,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:28,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:25:28,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:25:28,168 INFO L87 Difference]: Start difference. First operand 3091 states and 7081 transitions. Second operand 4 states. [2019-11-15 22:25:28,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:28,203 INFO L93 Difference]: Finished difference Result 3091 states and 7063 transitions. [2019-11-15 22:25:28,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:25:28,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-15 22:25:28,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:28,207 INFO L225 Difference]: With dead ends: 3091 [2019-11-15 22:25:28,208 INFO L226 Difference]: Without dead ends: 3091 [2019-11-15 22:25:28,208 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:25:28,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3091 states. [2019-11-15 22:25:28,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3091 to 2643. [2019-11-15 22:25:28,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2643 states. [2019-11-15 22:25:28,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 6019 transitions. [2019-11-15 22:25:28,246 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 6019 transitions. Word has length 84 [2019-11-15 22:25:28,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:28,247 INFO L462 AbstractCegarLoop]: Abstraction has 2643 states and 6019 transitions. [2019-11-15 22:25:28,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:25:28,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 6019 transitions. [2019-11-15 22:25:28,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 22:25:28,250 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:28,251 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, 1, 1] [2019-11-15 22:25:28,251 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:28,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:28,251 INFO L82 PathProgramCache]: Analyzing trace with hash -457891742, now seen corresponding path program 1 times [2019-11-15 22:25:28,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:28,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177597379] [2019-11-15 22:25:28,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:28,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:28,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:28,405 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 22:25:28,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177597379] [2019-11-15 22:25:28,406 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:28,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:25:28,406 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239413427] [2019-11-15 22:25:28,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:25:28,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:28,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:25:28,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:25:28,407 INFO L87 Difference]: Start difference. First operand 2643 states and 6019 transitions. Second operand 7 states. [2019-11-15 22:25:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:28,594 INFO L93 Difference]: Finished difference Result 3048 states and 6871 transitions. [2019-11-15 22:25:28,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:25:28,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-11-15 22:25:28,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:28,597 INFO L225 Difference]: With dead ends: 3048 [2019-11-15 22:25:28,597 INFO L226 Difference]: Without dead ends: 3048 [2019-11-15 22:25:28,597 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:25:28,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3048 states. [2019-11-15 22:25:28,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3048 to 2957. [2019-11-15 22:25:28,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2957 states. [2019-11-15 22:25:28,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2957 states and 6696 transitions. [2019-11-15 22:25:28,626 INFO L78 Accepts]: Start accepts. Automaton has 2957 states and 6696 transitions. Word has length 84 [2019-11-15 22:25:28,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:28,627 INFO L462 AbstractCegarLoop]: Abstraction has 2957 states and 6696 transitions. [2019-11-15 22:25:28,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:25:28,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2957 states and 6696 transitions. [2019-11-15 22:25:28,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 22:25:28,630 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:28,630 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, 1, 1] [2019-11-15 22:25:28,630 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:28,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:28,631 INFO L82 PathProgramCache]: Analyzing trace with hash 429611939, now seen corresponding path program 1 times [2019-11-15 22:25:28,631 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:28,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617576919] [2019-11-15 22:25:28,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:28,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:28,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:28,718 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 22:25:28,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617576919] [2019-11-15 22:25:28,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:25:28,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:25:28,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619751120] [2019-11-15 22:25:28,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:25:28,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:28,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:25:28,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:25:28,720 INFO L87 Difference]: Start difference. First operand 2957 states and 6696 transitions. Second operand 6 states. [2019-11-15 22:25:28,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:28,774 INFO L93 Difference]: Finished difference Result 5112 states and 11658 transitions. [2019-11-15 22:25:28,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:25:28,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-11-15 22:25:28,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:28,776 INFO L225 Difference]: With dead ends: 5112 [2019-11-15 22:25:28,776 INFO L226 Difference]: Without dead ends: 2245 [2019-11-15 22:25:28,776 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:25:28,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2019-11-15 22:25:28,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2245. [2019-11-15 22:25:28,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-11-15 22:25:28,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 5111 transitions. [2019-11-15 22:25:28,824 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 5111 transitions. Word has length 84 [2019-11-15 22:25:28,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:28,824 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 5111 transitions. [2019-11-15 22:25:28,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:25:28,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 5111 transitions. [2019-11-15 22:25:28,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 22:25:28,827 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:28,827 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, 1, 1] [2019-11-15 22:25:28,827 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:25:28,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:28,827 INFO L82 PathProgramCache]: Analyzing trace with hash 605039045, now seen corresponding path program 2 times [2019-11-15 22:25:28,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:28,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181822534] [2019-11-15 22:25:28,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:28,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:28,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:25:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:25:28,920 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:25:28,920 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:25:29,102 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 22:25:29,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:25:29 BasicIcfg [2019-11-15 22:25:29,104 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:25:29,104 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:25:29,105 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:25:29,105 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:25:29,105 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:24:58" (3/4) ... [2019-11-15 22:25:29,108 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 22:25:29,236 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_674e3948-2783-4252-a024-c572ac872959/bin/uautomizer/witness.graphml [2019-11-15 22:25:29,236 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:25:29,238 INFO L168 Benchmark]: Toolchain (without parser) took 32978.64 ms. Allocated memory was 1.0 GB in the beginning and 3.6 GB in the end (delta: 2.5 GB). Free memory was 944.7 MB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 405.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:29,239 INFO L168 Benchmark]: CDTParser took 0.28 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 22:25:29,239 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.2 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -215.3 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:29,240 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:29,240 INFO L168 Benchmark]: Boogie Preprocessor took 71.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:25:29,240 INFO L168 Benchmark]: RCFGBuilder took 927.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:29,241 INFO L168 Benchmark]: TraceAbstraction took 30967.02 ms. Allocated memory was 1.2 GB in the beginning and 3.6 GB in the end (delta: 2.3 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 317.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:29,241 INFO L168 Benchmark]: Witness Printer took 131.58 ms. Allocated memory is still 3.6 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:29,243 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.28 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 814.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.2 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -215.3 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 927.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30967.02 ms. Allocated memory was 1.2 GB in the beginning and 3.6 GB in the end (delta: 2.3 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 317.1 MB. Max. memory is 11.5 GB. * Witness Printer took 131.58 ms. Allocated memory is still 3.6 GB. Free memory was 3.1 GB in the beginning and 3.1 GB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [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] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L707] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L708] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L709] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L710] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L711] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L712] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L713] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L714] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L715] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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}] [L716] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L717] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L718] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L719] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L722] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, 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] [L723] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L799] 0 pthread_t t1643; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L800] FCALL, FORK 0 pthread_create(&t1643, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L801] 0 pthread_t t1644; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L802] FCALL, FORK 0 pthread_create(&t1644, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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] [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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] [L736] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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] [L736] 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) [L737] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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] [L777] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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] [L737] 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)) [L738] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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] [L738] 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)) [L739] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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] [L739] 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)) [L740] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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] [L740] 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)) [L741] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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] [L741] 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)) [L742] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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] [L742] 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)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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] [L744] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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] [L744] 1 x = x$flush_delayed ? x$mem_tmp : x [L745] 1 x$flush_delayed = (_Bool)0 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 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) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] 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 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L780] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] 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 [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 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) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 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 [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 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 [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 195 locations, 3 error locations. Result: UNSAFE, OverallTime: 30.8s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 13.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5449 SDtfs, 6499 SDslu, 10920 SDs, 0 SdLazy, 4428 SolverSat, 340 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 53 SyntacticMatches, 11 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57889occurred 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: 12.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 57036 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1465 NumberOfCodeBlocks, 1465 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1359 ConstructedInterpolants, 0 QuantifiedInterpolants, 245283 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...