./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe033_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_149e4a8c-3b24-4b66-a9f2-68ad2709de56/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_149e4a8c-3b24-4b66-a9f2-68ad2709de56/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_149e4a8c-3b24-4b66-a9f2-68ad2709de56/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_149e4a8c-3b24-4b66-a9f2-68ad2709de56/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/working_dir_149e4a8c-3b24-4b66-a9f2-68ad2709de56/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_149e4a8c-3b24-4b66-a9f2-68ad2709de56/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 d419d87a3251efcb6a9257d61f4595651f7c3aab .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-10-22 08:57:13,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:13,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:13,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:13,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:13,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:13,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:13,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:13,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:13,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:13,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:13,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:13,131 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:13,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:13,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:13,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:13,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:13,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:13,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:13,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:13,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:13,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:13,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:13,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:13,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:13,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:13,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:13,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:13,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:13,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:13,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:13,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:13,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:13,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:13,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:13,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:13,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:13,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:13,152 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:13,153 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:13,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:13,154 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_149e4a8c-3b24-4b66-a9f2-68ad2709de56/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:57:13,166 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:13,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:13,167 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:13,167 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:13,167 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:13,167 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:13,168 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:57:13,168 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:13,168 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:57:13,168 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:13,168 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:57:13,169 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:57:13,169 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:57:13,169 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:57:13,169 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:13,169 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:13,169 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:57:13,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:13,170 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:13,170 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:57:13,170 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:57:13,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:57:13,170 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:13,171 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:57:13,171 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:57:13,171 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:13,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:57:13,171 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:57:13,171 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/working_dir_149e4a8c-3b24-4b66-a9f2-68ad2709de56/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 -> d419d87a3251efcb6a9257d61f4595651f7c3aab [2019-10-22 08:57:13,195 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:13,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:13,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:13,209 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:13,209 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:13,209 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_149e4a8c-3b24-4b66-a9f2-68ad2709de56/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe033_rmo.opt.i [2019-10-22 08:57:13,253 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_149e4a8c-3b24-4b66-a9f2-68ad2709de56/bin/uautomizer/data/4060909f7/ddba00896518414db3e7bf8954fe3bb6/FLAG3bd8ba2ce [2019-10-22 08:57:13,733 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:13,734 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_149e4a8c-3b24-4b66-a9f2-68ad2709de56/sv-benchmarks/c/pthread-wmm/safe033_rmo.opt.i [2019-10-22 08:57:13,752 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_149e4a8c-3b24-4b66-a9f2-68ad2709de56/bin/uautomizer/data/4060909f7/ddba00896518414db3e7bf8954fe3bb6/FLAG3bd8ba2ce [2019-10-22 08:57:14,057 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_149e4a8c-3b24-4b66-a9f2-68ad2709de56/bin/uautomizer/data/4060909f7/ddba00896518414db3e7bf8954fe3bb6 [2019-10-22 08:57:14,059 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:14,060 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:14,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:14,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:14,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:14,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:14" (1/1) ... [2019-10-22 08:57:14,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bd48f11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:14, skipping insertion in model container [2019-10-22 08:57:14,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:14" (1/1) ... [2019-10-22 08:57:14,073 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:14,115 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:14,492 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:14,506 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:14,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:14,621 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:14,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:14 WrapperNode [2019-10-22 08:57:14,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:14,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:14,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:14,622 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:14,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:14" (1/1) ... [2019-10-22 08:57:14,647 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:14" (1/1) ... [2019-10-22 08:57:14,674 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:14,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:14,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:14,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:14,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:14" (1/1) ... [2019-10-22 08:57:14,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:14" (1/1) ... [2019-10-22 08:57:14,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:14" (1/1) ... [2019-10-22 08:57:14,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:14" (1/1) ... [2019-10-22 08:57:14,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:14" (1/1) ... [2019-10-22 08:57:14,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:14" (1/1) ... [2019-10-22 08:57:14,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:14" (1/1) ... [2019-10-22 08:57:14,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:14,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:14,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:14,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:14,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_149e4a8c-3b24-4b66-a9f2-68ad2709de56/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-10-22 08:57:14,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:57:14,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-10-22 08:57:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:57:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:57:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-10-22 08:57:14,761 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-10-22 08:57:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-10-22 08:57:14,761 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-10-22 08:57:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-10-22 08:57:14,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:14,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:14,764 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-10-22 08:57:15,222 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:15,223 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:57:15,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:15 BoogieIcfgContainer [2019-10-22 08:57:15,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:15,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:57:15,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:57:15,228 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:57:15,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:57:14" (1/3) ... [2019-10-22 08:57:15,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2955dcd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:57:15, skipping insertion in model container [2019-10-22 08:57:15,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:14" (2/3) ... [2019-10-22 08:57:15,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2955dcd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:57:15, skipping insertion in model container [2019-10-22 08:57:15,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:15" (3/3) ... [2019-10-22 08:57:15,231 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_rmo.opt.i [2019-10-22 08:57:15,285 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,286 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,286 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,287 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,287 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,287 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,287 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,287 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,288 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,288 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,288 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,288 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,289 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,289 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,289 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,289 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,290 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,290 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,290 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,290 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,290 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,291 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,291 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,292 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,292 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,292 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,293 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,293 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,294 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,294 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,294 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,294 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,294 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,294 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,295 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,295 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,295 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,295 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,295 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,295 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,296 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,296 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,296 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,296 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,296 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,296 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,297 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,297 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,297 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,297 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,297 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,297 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,298 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,298 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,298 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,298 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,298 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,298 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,298 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,299 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,299 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,299 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,299 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,299 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,299 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,303 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,303 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,304 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,304 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,304 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,304 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,305 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,305 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,306 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,306 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,306 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,306 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,306 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,306 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,306 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,307 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,307 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,307 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,307 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,307 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,307 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,308 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,308 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,308 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,308 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,308 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,308 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,308 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,309 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,309 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,309 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,309 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,309 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,310 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,310 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,310 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,310 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,310 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,310 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,310 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,311 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,311 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,311 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,311 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,311 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,311 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,314 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,315 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,315 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,316 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,316 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,316 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,316 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,316 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,317 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,317 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,317 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,317 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,317 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,317 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,318 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,318 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,318 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,318 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,318 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,318 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,318 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,319 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,319 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,319 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,319 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:15,327 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-10-22 08:57:15,327 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:57:15,338 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 08:57:15,349 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 08:57:15,366 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:57:15,367 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:57:15,367 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:57:15,367 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:15,367 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:15,367 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:57:15,367 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:15,367 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:57:15,378 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 129 places, 161 transitions [2019-10-22 08:57:17,552 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27853 states. [2019-10-22 08:57:17,554 INFO L276 IsEmpty]: Start isEmpty. Operand 27853 states. [2019-10-22 08:57:17,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 08:57:17,563 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:17,564 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:17,566 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:17,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:17,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1948189748, now seen corresponding path program 1 times [2019-10-22 08:57:17,580 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:17,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608989193] [2019-10-22 08:57:17,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:17,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:17,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:17,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608989193] [2019-10-22 08:57:17,824 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:17,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:17,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788843186] [2019-10-22 08:57:17,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:17,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:17,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:17,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:17,848 INFO L87 Difference]: Start difference. First operand 27853 states. Second operand 4 states. [2019-10-22 08:57:18,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:18,371 INFO L93 Difference]: Finished difference Result 28521 states and 108878 transitions. [2019-10-22 08:57:18,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:57:18,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-10-22 08:57:18,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:18,572 INFO L225 Difference]: With dead ends: 28521 [2019-10-22 08:57:18,573 INFO L226 Difference]: Without dead ends: 21753 [2019-10-22 08:57:18,575 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-10-22 08:57:18,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21753 states. [2019-10-22 08:57:19,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21753 to 21753. [2019-10-22 08:57:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21753 states. [2019-10-22 08:57:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21753 states to 21753 states and 83438 transitions. [2019-10-22 08:57:19,671 INFO L78 Accepts]: Start accepts. Automaton has 21753 states and 83438 transitions. Word has length 36 [2019-10-22 08:57:19,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:19,672 INFO L462 AbstractCegarLoop]: Abstraction has 21753 states and 83438 transitions. [2019-10-22 08:57:19,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:19,672 INFO L276 IsEmpty]: Start isEmpty. Operand 21753 states and 83438 transitions. [2019-10-22 08:57:19,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 08:57:19,688 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:19,688 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:19,688 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:19,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:19,689 INFO L82 PathProgramCache]: Analyzing trace with hash -2084779232, now seen corresponding path program 1 times [2019-10-22 08:57:19,689 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:19,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303834829] [2019-10-22 08:57:19,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:19,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:19,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:19,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303834829] [2019-10-22 08:57:19,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:19,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:57:19,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582197588] [2019-10-22 08:57:19,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:57:19,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:19,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:19,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:19,842 INFO L87 Difference]: Start difference. First operand 21753 states and 83438 transitions. Second operand 5 states. [2019-10-22 08:57:20,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:20,414 INFO L93 Difference]: Finished difference Result 34167 states and 124038 transitions. [2019-10-22 08:57:20,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:57:20,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-22 08:57:20,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:20,551 INFO L225 Difference]: With dead ends: 34167 [2019-10-22 08:57:20,552 INFO L226 Difference]: Without dead ends: 33599 [2019-10-22 08:57:20,553 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-10-22 08:57:21,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33599 states. [2019-10-22 08:57:21,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33599 to 31793. [2019-10-22 08:57:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31793 states. [2019-10-22 08:57:21,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31793 states to 31793 states and 116816 transitions. [2019-10-22 08:57:21,703 INFO L78 Accepts]: Start accepts. Automaton has 31793 states and 116816 transitions. Word has length 44 [2019-10-22 08:57:21,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:21,705 INFO L462 AbstractCegarLoop]: Abstraction has 31793 states and 116816 transitions. [2019-10-22 08:57:21,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:57:21,705 INFO L276 IsEmpty]: Start isEmpty. Operand 31793 states and 116816 transitions. [2019-10-22 08:57:21,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 08:57:21,710 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:21,710 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:21,710 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:21,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:21,710 INFO L82 PathProgramCache]: Analyzing trace with hash -813435401, now seen corresponding path program 1 times [2019-10-22 08:57:21,711 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:21,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921433478] [2019-10-22 08:57:21,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:21,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:21,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:21,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921433478] [2019-10-22 08:57:21,797 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:21,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:57:21,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394301418] [2019-10-22 08:57:21,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:57:21,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:21,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:21,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:21,798 INFO L87 Difference]: Start difference. First operand 31793 states and 116816 transitions. Second operand 5 states. [2019-10-22 08:57:22,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:22,582 INFO L93 Difference]: Finished difference Result 41641 states and 149740 transitions. [2019-10-22 08:57:22,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:57:22,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-22 08:57:22,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:22,710 INFO L225 Difference]: With dead ends: 41641 [2019-10-22 08:57:22,710 INFO L226 Difference]: Without dead ends: 41177 [2019-10-22 08:57:22,710 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-10-22 08:57:22,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41177 states. [2019-10-22 08:57:23,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41177 to 35361. [2019-10-22 08:57:23,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35361 states. [2019-10-22 08:57:23,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35361 states to 35361 states and 128874 transitions. [2019-10-22 08:57:23,622 INFO L78 Accepts]: Start accepts. Automaton has 35361 states and 128874 transitions. Word has length 45 [2019-10-22 08:57:23,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:23,623 INFO L462 AbstractCegarLoop]: Abstraction has 35361 states and 128874 transitions. [2019-10-22 08:57:23,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:57:23,623 INFO L276 IsEmpty]: Start isEmpty. Operand 35361 states and 128874 transitions. [2019-10-22 08:57:23,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 08:57:23,632 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:23,632 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-10-22 08:57:23,633 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:23,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:23,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1323257433, now seen corresponding path program 1 times [2019-10-22 08:57:23,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:23,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154503818] [2019-10-22 08:57:23,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:23,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:23,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:23,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:23,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154503818] [2019-10-22 08:57:23,676 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:23,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:23,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42720777] [2019-10-22 08:57:23,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:23,677 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:23,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:23,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:23,678 INFO L87 Difference]: Start difference. First operand 35361 states and 128874 transitions. Second operand 3 states. [2019-10-22 08:57:23,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:23,930 INFO L93 Difference]: Finished difference Result 45907 states and 163942 transitions. [2019-10-22 08:57:23,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:23,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-22 08:57:23,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:24,070 INFO L225 Difference]: With dead ends: 45907 [2019-10-22 08:57:24,070 INFO L226 Difference]: Without dead ends: 45907 [2019-10-22 08:57:24,071 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-10-22 08:57:24,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45907 states. [2019-10-22 08:57:25,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45907 to 40244. [2019-10-22 08:57:25,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40244 states. [2019-10-22 08:57:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40244 states to 40244 states and 145212 transitions. [2019-10-22 08:57:25,277 INFO L78 Accepts]: Start accepts. Automaton has 40244 states and 145212 transitions. Word has length 47 [2019-10-22 08:57:25,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:25,278 INFO L462 AbstractCegarLoop]: Abstraction has 40244 states and 145212 transitions. [2019-10-22 08:57:25,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 40244 states and 145212 transitions. [2019-10-22 08:57:25,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 08:57:25,293 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:25,293 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:25,294 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:25,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:25,294 INFO L82 PathProgramCache]: Analyzing trace with hash 598320720, now seen corresponding path program 1 times [2019-10-22 08:57:25,294 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:25,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563975079] [2019-10-22 08:57:25,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:25,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:25,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:25,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563975079] [2019-10-22 08:57:25,368 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:25,368 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:57:25,368 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587800504] [2019-10-22 08:57:25,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:57:25,369 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:25,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:57:25,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:57:25,369 INFO L87 Difference]: Start difference. First operand 40244 states and 145212 transitions. Second operand 6 states. [2019-10-22 08:57:25,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:25,995 INFO L93 Difference]: Finished difference Result 52463 states and 185474 transitions. [2019-10-22 08:57:25,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 08:57:25,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-10-22 08:57:25,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:26,131 INFO L225 Difference]: With dead ends: 52463 [2019-10-22 08:57:26,132 INFO L226 Difference]: Without dead ends: 51927 [2019-10-22 08:57:26,132 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:57:27,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51927 states. [2019-10-22 08:57:27,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51927 to 40895. [2019-10-22 08:57:27,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40895 states. [2019-10-22 08:57:27,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40895 states to 40895 states and 147665 transitions. [2019-10-22 08:57:27,596 INFO L78 Accepts]: Start accepts. Automaton has 40895 states and 147665 transitions. Word has length 51 [2019-10-22 08:57:27,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:27,596 INFO L462 AbstractCegarLoop]: Abstraction has 40895 states and 147665 transitions. [2019-10-22 08:57:27,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:57:27,597 INFO L276 IsEmpty]: Start isEmpty. Operand 40895 states and 147665 transitions. [2019-10-22 08:57:27,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 08:57:27,610 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:27,610 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:27,610 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:27,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:27,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1930460229, now seen corresponding path program 1 times [2019-10-22 08:57:27,611 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:27,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566601700] [2019-10-22 08:57:27,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:27,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:27,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-10-22 08:57:27,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566601700] [2019-10-22 08:57:27,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:27,719 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:57:27,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641775173] [2019-10-22 08:57:27,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:57:27,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:27,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:57:27,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:57:27,720 INFO L87 Difference]: Start difference. First operand 40895 states and 147665 transitions. Second operand 6 states. [2019-10-22 08:57:28,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:28,365 INFO L93 Difference]: Finished difference Result 56596 states and 201645 transitions. [2019-10-22 08:57:28,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:57:28,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-10-22 08:57:28,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:28,488 INFO L225 Difference]: With dead ends: 56596 [2019-10-22 08:57:28,488 INFO L226 Difference]: Without dead ends: 55457 [2019-10-22 08:57:28,488 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:57:28,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55457 states. [2019-10-22 08:57:29,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55457 to 51952. [2019-10-22 08:57:29,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51952 states. [2019-10-22 08:57:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51952 states to 51952 states and 186004 transitions. [2019-10-22 08:57:32,828 INFO L78 Accepts]: Start accepts. Automaton has 51952 states and 186004 transitions. Word has length 51 [2019-10-22 08:57:32,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:32,828 INFO L462 AbstractCegarLoop]: Abstraction has 51952 states and 186004 transitions. [2019-10-22 08:57:32,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:57:32,828 INFO L276 IsEmpty]: Start isEmpty. Operand 51952 states and 186004 transitions. [2019-10-22 08:57:32,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 08:57:32,843 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:32,843 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:32,843 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:32,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:32,843 INFO L82 PathProgramCache]: Analyzing trace with hash 567555708, now seen corresponding path program 1 times [2019-10-22 08:57:32,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:32,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89107758] [2019-10-22 08:57:32,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:32,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:32,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:32,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:32,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89107758] [2019-10-22 08:57:32,959 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:32,959 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:57:32,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477372654] [2019-10-22 08:57:32,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:57:32,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:32,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:57:32,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:57:32,961 INFO L87 Difference]: Start difference. First operand 51952 states and 186004 transitions. Second operand 7 states. [2019-10-22 08:57:33,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:33,855 INFO L93 Difference]: Finished difference Result 75635 states and 260101 transitions. [2019-10-22 08:57:33,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 08:57:33,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-10-22 08:57:33,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:34,002 INFO L225 Difference]: With dead ends: 75635 [2019-10-22 08:57:34,002 INFO L226 Difference]: Without dead ends: 75635 [2019-10-22 08:57:34,002 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:57:34,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75635 states. [2019-10-22 08:57:35,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75635 to 61470. [2019-10-22 08:57:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61470 states. [2019-10-22 08:57:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61470 states to 61470 states and 215181 transitions. [2019-10-22 08:57:35,171 INFO L78 Accepts]: Start accepts. Automaton has 61470 states and 215181 transitions. Word has length 51 [2019-10-22 08:57:35,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:35,172 INFO L462 AbstractCegarLoop]: Abstraction has 61470 states and 215181 transitions. [2019-10-22 08:57:35,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:57:35,172 INFO L276 IsEmpty]: Start isEmpty. Operand 61470 states and 215181 transitions. [2019-10-22 08:57:35,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 08:57:35,185 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:35,185 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:35,185 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:35,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:35,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1455059389, now seen corresponding path program 1 times [2019-10-22 08:57:35,186 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:35,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344495305] [2019-10-22 08:57:35,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:35,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:35,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:35,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:35,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344495305] [2019-10-22 08:57:35,243 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:35,244 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:35,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752686013] [2019-10-22 08:57:35,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:35,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:35,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:35,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:35,245 INFO L87 Difference]: Start difference. First operand 61470 states and 215181 transitions. Second operand 3 states. [2019-10-22 08:57:36,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:36,033 INFO L93 Difference]: Finished difference Result 46764 states and 162431 transitions. [2019-10-22 08:57:36,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:36,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-10-22 08:57:36,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:36,153 INFO L225 Difference]: With dead ends: 46764 [2019-10-22 08:57:36,154 INFO L226 Difference]: Without dead ends: 46184 [2019-10-22 08:57:36,154 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-10-22 08:57:36,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46184 states. [2019-10-22 08:57:36,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46184 to 44419. [2019-10-22 08:57:36,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44419 states. [2019-10-22 08:57:36,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44419 states to 44419 states and 155152 transitions. [2019-10-22 08:57:36,930 INFO L78 Accepts]: Start accepts. Automaton has 44419 states and 155152 transitions. Word has length 51 [2019-10-22 08:57:36,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:36,930 INFO L462 AbstractCegarLoop]: Abstraction has 44419 states and 155152 transitions. [2019-10-22 08:57:36,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:36,931 INFO L276 IsEmpty]: Start isEmpty. Operand 44419 states and 155152 transitions. [2019-10-22 08:57:36,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-22 08:57:36,939 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:36,939 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] [2019-10-22 08:57:36,939 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:36,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:36,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1722946808, now seen corresponding path program 1 times [2019-10-22 08:57:36,940 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:36,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856510319] [2019-10-22 08:57:36,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:36,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:36,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:37,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:37,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856510319] [2019-10-22 08:57:37,030 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:37,030 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:57:37,030 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137322261] [2019-10-22 08:57:37,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:57:37,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:37,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:57:37,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:57:37,031 INFO L87 Difference]: Start difference. First operand 44419 states and 155152 transitions. Second operand 6 states. [2019-10-22 08:57:37,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:37,526 INFO L93 Difference]: Finished difference Result 58721 states and 198367 transitions. [2019-10-22 08:57:37,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:57:37,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-10-22 08:57:37,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:37,641 INFO L225 Difference]: With dead ends: 58721 [2019-10-22 08:57:37,641 INFO L226 Difference]: Without dead ends: 58721 [2019-10-22 08:57:37,641 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-10-22 08:57:37,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58721 states. [2019-10-22 08:57:38,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58721 to 48775. [2019-10-22 08:57:38,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48775 states. [2019-10-22 08:57:38,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48775 states to 48775 states and 167868 transitions. [2019-10-22 08:57:38,499 INFO L78 Accepts]: Start accepts. Automaton has 48775 states and 167868 transitions. Word has length 52 [2019-10-22 08:57:38,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:38,500 INFO L462 AbstractCegarLoop]: Abstraction has 48775 states and 167868 transitions. [2019-10-22 08:57:38,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:57:38,500 INFO L276 IsEmpty]: Start isEmpty. Operand 48775 states and 167868 transitions. [2019-10-22 08:57:38,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-22 08:57:38,510 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:38,510 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] [2019-10-22 08:57:38,510 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:38,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:38,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1684516807, now seen corresponding path program 1 times [2019-10-22 08:57:38,510 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:38,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486255225] [2019-10-22 08:57:38,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:38,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486255225] [2019-10-22 08:57:38,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:38,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:38,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2919416] [2019-10-22 08:57:38,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:38,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:38,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:38,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:38,563 INFO L87 Difference]: Start difference. First operand 48775 states and 167868 transitions. Second operand 4 states. [2019-10-22 08:57:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:38,621 INFO L93 Difference]: Finished difference Result 10149 states and 31519 transitions. [2019-10-22 08:57:38,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:38,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-10-22 08:57:38,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:38,637 INFO L225 Difference]: With dead ends: 10149 [2019-10-22 08:57:38,637 INFO L226 Difference]: Without dead ends: 8643 [2019-10-22 08:57:38,638 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-10-22 08:57:38,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8643 states. [2019-10-22 08:57:38,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8643 to 8595. [2019-10-22 08:57:38,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8595 states. [2019-10-22 08:57:38,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8595 states to 8595 states and 26464 transitions. [2019-10-22 08:57:38,751 INFO L78 Accepts]: Start accepts. Automaton has 8595 states and 26464 transitions. Word has length 52 [2019-10-22 08:57:38,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:38,751 INFO L462 AbstractCegarLoop]: Abstraction has 8595 states and 26464 transitions. [2019-10-22 08:57:38,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:38,751 INFO L276 IsEmpty]: Start isEmpty. Operand 8595 states and 26464 transitions. [2019-10-22 08:57:38,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 08:57:38,754 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:38,754 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:38,755 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:38,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:38,755 INFO L82 PathProgramCache]: Analyzing trace with hash 911252639, now seen corresponding path program 1 times [2019-10-22 08:57:38,755 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:38,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995454314] [2019-10-22 08:57:38,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:38,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:38,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995454314] [2019-10-22 08:57:38,803 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:38,803 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:38,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613518602] [2019-10-22 08:57:38,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:38,804 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:38,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:38,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:38,804 INFO L87 Difference]: Start difference. First operand 8595 states and 26464 transitions. Second operand 4 states. [2019-10-22 08:57:38,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:38,932 INFO L93 Difference]: Finished difference Result 10214 states and 31171 transitions. [2019-10-22 08:57:38,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:38,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-10-22 08:57:38,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:38,944 INFO L225 Difference]: With dead ends: 10214 [2019-10-22 08:57:38,944 INFO L226 Difference]: Without dead ends: 10214 [2019-10-22 08:57:38,945 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-10-22 08:57:38,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10214 states. [2019-10-22 08:57:39,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10214 to 9246. [2019-10-22 08:57:39,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9246 states. [2019-10-22 08:57:39,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9246 states to 9246 states and 28325 transitions. [2019-10-22 08:57:39,058 INFO L78 Accepts]: Start accepts. Automaton has 9246 states and 28325 transitions. Word has length 61 [2019-10-22 08:57:39,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:39,059 INFO L462 AbstractCegarLoop]: Abstraction has 9246 states and 28325 transitions. [2019-10-22 08:57:39,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:39,059 INFO L276 IsEmpty]: Start isEmpty. Operand 9246 states and 28325 transitions. [2019-10-22 08:57:39,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 08:57:39,062 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:39,062 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:39,063 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:39,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:39,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1640904322, now seen corresponding path program 1 times [2019-10-22 08:57:39,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:39,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727578465] [2019-10-22 08:57:39,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:39,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:39,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:39,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727578465] [2019-10-22 08:57:39,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:39,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:57:39,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543927784] [2019-10-22 08:57:39,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:57:39,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:39,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:57:39,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:57:39,139 INFO L87 Difference]: Start difference. First operand 9246 states and 28325 transitions. Second operand 6 states. [2019-10-22 08:57:39,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:39,430 INFO L93 Difference]: Finished difference Result 12019 states and 36324 transitions. [2019-10-22 08:57:39,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 08:57:39,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-10-22 08:57:39,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:39,450 INFO L225 Difference]: With dead ends: 12019 [2019-10-22 08:57:39,451 INFO L226 Difference]: Without dead ends: 11955 [2019-10-22 08:57:39,451 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:57:39,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11955 states. [2019-10-22 08:57:39,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11955 to 10327. [2019-10-22 08:57:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10327 states. [2019-10-22 08:57:39,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10327 states to 10327 states and 31494 transitions. [2019-10-22 08:57:39,716 INFO L78 Accepts]: Start accepts. Automaton has 10327 states and 31494 transitions. Word has length 61 [2019-10-22 08:57:39,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:39,716 INFO L462 AbstractCegarLoop]: Abstraction has 10327 states and 31494 transitions. [2019-10-22 08:57:39,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:57:39,716 INFO L276 IsEmpty]: Start isEmpty. Operand 10327 states and 31494 transitions. [2019-10-22 08:57:39,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 08:57:39,722 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:39,722 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:39,722 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:39,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:39,723 INFO L82 PathProgramCache]: Analyzing trace with hash 2086982061, now seen corresponding path program 1 times [2019-10-22 08:57:39,723 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:39,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504715580] [2019-10-22 08:57:39,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:39,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:39,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:39,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:39,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504715580] [2019-10-22 08:57:39,782 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:39,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:39,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745270817] [2019-10-22 08:57:39,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:39,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:39,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:39,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:39,782 INFO L87 Difference]: Start difference. First operand 10327 states and 31494 transitions. Second operand 4 states. [2019-10-22 08:57:39,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:39,997 INFO L93 Difference]: Finished difference Result 13755 states and 41434 transitions. [2019-10-22 08:57:39,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:57:39,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-10-22 08:57:39,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:40,021 INFO L225 Difference]: With dead ends: 13755 [2019-10-22 08:57:40,021 INFO L226 Difference]: Without dead ends: 13755 [2019-10-22 08:57:40,021 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-10-22 08:57:40,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13755 states. [2019-10-22 08:57:40,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13755 to 11594. [2019-10-22 08:57:40,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11594 states. [2019-10-22 08:57:40,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11594 states to 11594 states and 35101 transitions. [2019-10-22 08:57:40,195 INFO L78 Accepts]: Start accepts. Automaton has 11594 states and 35101 transitions. Word has length 65 [2019-10-22 08:57:40,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:40,195 INFO L462 AbstractCegarLoop]: Abstraction has 11594 states and 35101 transitions. [2019-10-22 08:57:40,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:40,195 INFO L276 IsEmpty]: Start isEmpty. Operand 11594 states and 35101 transitions. [2019-10-22 08:57:40,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 08:57:40,203 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:40,203 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:40,203 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:40,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:40,204 INFO L82 PathProgramCache]: Analyzing trace with hash -963220754, now seen corresponding path program 1 times [2019-10-22 08:57:40,204 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:40,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086160732] [2019-10-22 08:57:40,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:40,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:40,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:40,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:40,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086160732] [2019-10-22 08:57:40,294 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:40,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:57:40,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395893420] [2019-10-22 08:57:40,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:57:40,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:40,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:57:40,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:57:40,295 INFO L87 Difference]: Start difference. First operand 11594 states and 35101 transitions. Second operand 6 states. [2019-10-22 08:57:40,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:40,720 INFO L93 Difference]: Finished difference Result 13087 states and 38912 transitions. [2019-10-22 08:57:40,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:57:40,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-10-22 08:57:40,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:40,743 INFO L225 Difference]: With dead ends: 13087 [2019-10-22 08:57:40,743 INFO L226 Difference]: Without dead ends: 13087 [2019-10-22 08:57:40,743 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:57:40,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13087 states. [2019-10-22 08:57:40,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13087 to 12731. [2019-10-22 08:57:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12731 states. [2019-10-22 08:57:40,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12731 states to 12731 states and 37971 transitions. [2019-10-22 08:57:40,935 INFO L78 Accepts]: Start accepts. Automaton has 12731 states and 37971 transitions. Word has length 65 [2019-10-22 08:57:40,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:40,935 INFO L462 AbstractCegarLoop]: Abstraction has 12731 states and 37971 transitions. [2019-10-22 08:57:40,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:57:40,936 INFO L276 IsEmpty]: Start isEmpty. Operand 12731 states and 37971 transitions. [2019-10-22 08:57:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 08:57:40,946 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:40,946 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:40,946 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:40,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:40,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1254537199, now seen corresponding path program 1 times [2019-10-22 08:57:40,946 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:40,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198443024] [2019-10-22 08:57:40,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:40,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:40,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:41,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:41,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198443024] [2019-10-22 08:57:41,053 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:41,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:57:41,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102070213] [2019-10-22 08:57:41,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:57:41,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:41,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:57:41,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:57:41,054 INFO L87 Difference]: Start difference. First operand 12731 states and 37971 transitions. Second operand 6 states. [2019-10-22 08:57:41,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:41,403 INFO L93 Difference]: Finished difference Result 15080 states and 43754 transitions. [2019-10-22 08:57:41,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:57:41,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-10-22 08:57:41,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:41,420 INFO L225 Difference]: With dead ends: 15080 [2019-10-22 08:57:41,420 INFO L226 Difference]: Without dead ends: 15080 [2019-10-22 08:57:41,420 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-10-22 08:57:41,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15080 states. [2019-10-22 08:57:41,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15080 to 12970. [2019-10-22 08:57:41,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12970 states. [2019-10-22 08:57:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12970 states to 12970 states and 38015 transitions. [2019-10-22 08:57:41,586 INFO L78 Accepts]: Start accepts. Automaton has 12970 states and 38015 transitions. Word has length 65 [2019-10-22 08:57:41,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:41,586 INFO L462 AbstractCegarLoop]: Abstraction has 12970 states and 38015 transitions. [2019-10-22 08:57:41,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:57:41,586 INFO L276 IsEmpty]: Start isEmpty. Operand 12970 states and 38015 transitions. [2019-10-22 08:57:41,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 08:57:41,594 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:41,594 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:41,594 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:41,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:41,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1465888112, now seen corresponding path program 1 times [2019-10-22 08:57:41,594 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:41,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331567855] [2019-10-22 08:57:41,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:41,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:41,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:41,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331567855] [2019-10-22 08:57:41,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:41,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:57:41,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133293805] [2019-10-22 08:57:41,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:57:41,651 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:41,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:41,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:41,651 INFO L87 Difference]: Start difference. First operand 12970 states and 38015 transitions. Second operand 5 states. [2019-10-22 08:57:41,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:41,908 INFO L93 Difference]: Finished difference Result 15975 states and 46599 transitions. [2019-10-22 08:57:41,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:57:41,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-22 08:57:41,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:41,925 INFO L225 Difference]: With dead ends: 15975 [2019-10-22 08:57:41,925 INFO L226 Difference]: Without dead ends: 15975 [2019-10-22 08:57:41,926 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-10-22 08:57:41,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15975 states. [2019-10-22 08:57:42,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15975 to 13913. [2019-10-22 08:57:42,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13913 states. [2019-10-22 08:57:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13913 states to 13913 states and 40445 transitions. [2019-10-22 08:57:42,105 INFO L78 Accepts]: Start accepts. Automaton has 13913 states and 40445 transitions. Word has length 65 [2019-10-22 08:57:42,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:42,105 INFO L462 AbstractCegarLoop]: Abstraction has 13913 states and 40445 transitions. [2019-10-22 08:57:42,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:57:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 13913 states and 40445 transitions. [2019-10-22 08:57:42,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 08:57:42,114 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:42,114 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:42,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:42,115 INFO L82 PathProgramCache]: Analyzing trace with hash 955353935, now seen corresponding path program 1 times [2019-10-22 08:57:42,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:42,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540006643] [2019-10-22 08:57:42,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:42,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:42,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540006643] [2019-10-22 08:57:42,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:42,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:42,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608651283] [2019-10-22 08:57:42,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:42,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:42,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:42,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:42,163 INFO L87 Difference]: Start difference. First operand 13913 states and 40445 transitions. Second operand 4 states. [2019-10-22 08:57:42,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:42,545 INFO L93 Difference]: Finished difference Result 17361 states and 50539 transitions. [2019-10-22 08:57:42,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:42,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-10-22 08:57:42,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:42,564 INFO L225 Difference]: With dead ends: 17361 [2019-10-22 08:57:42,564 INFO L226 Difference]: Without dead ends: 16849 [2019-10-22 08:57:42,565 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-10-22 08:57:42,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16849 states. [2019-10-22 08:57:42,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16849 to 16117. [2019-10-22 08:57:42,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16117 states. [2019-10-22 08:57:42,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16117 states to 16117 states and 46794 transitions. [2019-10-22 08:57:42,762 INFO L78 Accepts]: Start accepts. Automaton has 16117 states and 46794 transitions. Word has length 65 [2019-10-22 08:57:42,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:42,762 INFO L462 AbstractCegarLoop]: Abstraction has 16117 states and 46794 transitions. [2019-10-22 08:57:42,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 16117 states and 46794 transitions. [2019-10-22 08:57:42,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 08:57:42,772 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:42,772 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:42,772 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:42,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:42,773 INFO L82 PathProgramCache]: Analyzing trace with hash -841597424, now seen corresponding path program 1 times [2019-10-22 08:57:42,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:42,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360663737] [2019-10-22 08:57:42,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:42,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:42,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360663737] [2019-10-22 08:57:42,844 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:42,844 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:57:42,845 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382199731] [2019-10-22 08:57:42,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:57:42,845 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:42,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:42,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:42,845 INFO L87 Difference]: Start difference. First operand 16117 states and 46794 transitions. Second operand 5 states. [2019-10-22 08:57:42,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:42,925 INFO L93 Difference]: Finished difference Result 15693 states and 44348 transitions. [2019-10-22 08:57:42,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:42,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-22 08:57:42,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:42,942 INFO L225 Difference]: With dead ends: 15693 [2019-10-22 08:57:42,943 INFO L226 Difference]: Without dead ends: 15693 [2019-10-22 08:57:42,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:57:42,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15693 states. [2019-10-22 08:57:43,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15693 to 12231. [2019-10-22 08:57:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12231 states. [2019-10-22 08:57:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12231 states to 12231 states and 34579 transitions. [2019-10-22 08:57:43,095 INFO L78 Accepts]: Start accepts. Automaton has 12231 states and 34579 transitions. Word has length 65 [2019-10-22 08:57:43,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:43,095 INFO L462 AbstractCegarLoop]: Abstraction has 12231 states and 34579 transitions. [2019-10-22 08:57:43,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:57:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 12231 states and 34579 transitions. [2019-10-22 08:57:43,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 08:57:43,101 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:43,101 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:43,101 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:43,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:43,101 INFO L82 PathProgramCache]: Analyzing trace with hash 45906257, now seen corresponding path program 1 times [2019-10-22 08:57:43,101 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:43,101 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227428848] [2019-10-22 08:57:43,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:43,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:43,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:43,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:43,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227428848] [2019-10-22 08:57:43,176 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:43,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:57:43,176 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322045295] [2019-10-22 08:57:43,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:57:43,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:43,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:43,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:43,177 INFO L87 Difference]: Start difference. First operand 12231 states and 34579 transitions. Second operand 5 states. [2019-10-22 08:57:43,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:43,214 INFO L93 Difference]: Finished difference Result 3903 states and 9293 transitions. [2019-10-22 08:57:43,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:57:43,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-22 08:57:43,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:43,219 INFO L225 Difference]: With dead ends: 3903 [2019-10-22 08:57:43,220 INFO L226 Difference]: Without dead ends: 3241 [2019-10-22 08:57:43,220 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-10-22 08:57:43,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3241 states. [2019-10-22 08:57:43,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3241 to 3045. [2019-10-22 08:57:43,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3045 states. [2019-10-22 08:57:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3045 states to 3045 states and 7039 transitions. [2019-10-22 08:57:43,256 INFO L78 Accepts]: Start accepts. Automaton has 3045 states and 7039 transitions. Word has length 65 [2019-10-22 08:57:43,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:43,256 INFO L462 AbstractCegarLoop]: Abstraction has 3045 states and 7039 transitions. [2019-10-22 08:57:43,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:57:43,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3045 states and 7039 transitions. [2019-10-22 08:57:43,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 08:57:43,259 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:43,259 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:43,259 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:43,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:43,259 INFO L82 PathProgramCache]: Analyzing trace with hash 529305649, now seen corresponding path program 1 times [2019-10-22 08:57:43,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:43,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775664820] [2019-10-22 08:57:43,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:43,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:43,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:43,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775664820] [2019-10-22 08:57:43,363 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:43,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:57:43,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596016902] [2019-10-22 08:57:43,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:57:43,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:43,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:57:43,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:57:43,364 INFO L87 Difference]: Start difference. First operand 3045 states and 7039 transitions. Second operand 7 states. [2019-10-22 08:57:43,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:43,760 INFO L93 Difference]: Finished difference Result 3785 states and 8647 transitions. [2019-10-22 08:57:43,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 08:57:43,760 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-10-22 08:57:43,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:43,763 INFO L225 Difference]: With dead ends: 3785 [2019-10-22 08:57:43,763 INFO L226 Difference]: Without dead ends: 3751 [2019-10-22 08:57:43,763 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:57:43,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3751 states. [2019-10-22 08:57:43,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3751 to 3217. [2019-10-22 08:57:43,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3217 states. [2019-10-22 08:57:43,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 7400 transitions. [2019-10-22 08:57:43,793 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 7400 transitions. Word has length 82 [2019-10-22 08:57:43,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:43,793 INFO L462 AbstractCegarLoop]: Abstraction has 3217 states and 7400 transitions. [2019-10-22 08:57:43,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:57:43,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 7400 transitions. [2019-10-22 08:57:43,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 08:57:43,796 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:43,796 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:43,796 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:43,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:43,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1547903694, now seen corresponding path program 1 times [2019-10-22 08:57:43,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:43,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521081835] [2019-10-22 08:57:43,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:43,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:43,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:43,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521081835] [2019-10-22 08:57:43,881 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:43,881 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:57:43,881 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770531653] [2019-10-22 08:57:43,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:57:43,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:43,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:57:43,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:57:43,882 INFO L87 Difference]: Start difference. First operand 3217 states and 7400 transitions. Second operand 6 states. [2019-10-22 08:57:43,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:43,944 INFO L93 Difference]: Finished difference Result 5475 states and 12698 transitions. [2019-10-22 08:57:43,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:57:43,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-22 08:57:43,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:43,948 INFO L225 Difference]: With dead ends: 5475 [2019-10-22 08:57:43,948 INFO L226 Difference]: Without dead ends: 4879 [2019-10-22 08:57:43,948 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-10-22 08:57:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4879 states. [2019-10-22 08:57:43,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 3121. [2019-10-22 08:57:43,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2019-10-22 08:57:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 7192 transitions. [2019-10-22 08:57:43,981 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 7192 transitions. Word has length 82 [2019-10-22 08:57:43,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:43,981 INFO L462 AbstractCegarLoop]: Abstraction has 3121 states and 7192 transitions. [2019-10-22 08:57:43,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:57:43,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 7192 transitions. [2019-10-22 08:57:43,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 08:57:43,984 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:43,984 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:43,984 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:43,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:43,984 INFO L82 PathProgramCache]: Analyzing trace with hash -469329194, now seen corresponding path program 2 times [2019-10-22 08:57:43,984 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:43,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491531414] [2019-10-22 08:57:43,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:43,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:43,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:44,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491531414] [2019-10-22 08:57:44,076 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:44,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:57:44,076 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980384431] [2019-10-22 08:57:44,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:57:44,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:44,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:57:44,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:57:44,077 INFO L87 Difference]: Start difference. First operand 3121 states and 7192 transitions. Second operand 7 states. [2019-10-22 08:57:44,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:44,129 INFO L93 Difference]: Finished difference Result 5355 states and 12436 transitions. [2019-10-22 08:57:44,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:57:44,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-10-22 08:57:44,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:44,131 INFO L225 Difference]: With dead ends: 5355 [2019-10-22 08:57:44,132 INFO L226 Difference]: Without dead ends: 2338 [2019-10-22 08:57:44,132 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:57:44,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2019-10-22 08:57:44,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 2338. [2019-10-22 08:57:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2338 states. [2019-10-22 08:57:44,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 5433 transitions. [2019-10-22 08:57:44,150 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 5433 transitions. Word has length 82 [2019-10-22 08:57:44,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:44,150 INFO L462 AbstractCegarLoop]: Abstraction has 2338 states and 5433 transitions. [2019-10-22 08:57:44,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:57:44,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 5433 transitions. [2019-10-22 08:57:44,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 08:57:44,152 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:44,152 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:44,153 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:44,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:44,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2042911069, now seen corresponding path program 2 times [2019-10-22 08:57:44,153 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:44,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117765581] [2019-10-22 08:57:44,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:44,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:44,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:44,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117765581] [2019-10-22 08:57:44,240 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:44,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:57:44,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261319807] [2019-10-22 08:57:44,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:57:44,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:44,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:57:44,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:57:44,241 INFO L87 Difference]: Start difference. First operand 2338 states and 5433 transitions. Second operand 6 states. [2019-10-22 08:57:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:44,377 INFO L93 Difference]: Finished difference Result 2617 states and 6024 transitions. [2019-10-22 08:57:44,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:57:44,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-22 08:57:44,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:44,380 INFO L225 Difference]: With dead ends: 2617 [2019-10-22 08:57:44,380 INFO L226 Difference]: Without dead ends: 2575 [2019-10-22 08:57:44,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:57:44,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2019-10-22 08:57:44,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2289. [2019-10-22 08:57:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2289 states. [2019-10-22 08:57:44,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2289 states to 2289 states and 5285 transitions. [2019-10-22 08:57:44,410 INFO L78 Accepts]: Start accepts. Automaton has 2289 states and 5285 transitions. Word has length 82 [2019-10-22 08:57:44,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:44,411 INFO L462 AbstractCegarLoop]: Abstraction has 2289 states and 5285 transitions. [2019-10-22 08:57:44,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:57:44,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2289 states and 5285 transitions. [2019-10-22 08:57:44,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 08:57:44,414 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:44,414 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:44,414 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:44,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:44,415 INFO L82 PathProgramCache]: Analyzing trace with hash -34298274, now seen corresponding path program 3 times [2019-10-22 08:57:44,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:44,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639881120] [2019-10-22 08:57:44,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:44,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:44,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:44,487 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:44,487 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 08:57:44,626 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-10-22 08:57:44,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:57:44 BasicIcfg [2019-10-22 08:57:44,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:57:44,630 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:44,630 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:44,630 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:44,631 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:15" (3/4) ... [2019-10-22 08:57:44,633 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 08:57:44,769 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_149e4a8c-3b24-4b66-a9f2-68ad2709de56/bin/uautomizer/witness.graphml [2019-10-22 08:57:44,769 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:44,771 INFO L168 Benchmark]: Toolchain (without parser) took 30710.05 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.7 GB). Free memory was 939.1 MB in the beginning and 4.2 GB in the end (delta: -3.2 GB). Peak memory consumption was 501.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:44,771 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:44,771 INFO L168 Benchmark]: CACSL2BoogieTranslator took 560.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -129.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:44,771 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:44,772 INFO L168 Benchmark]: Boogie Preprocessor took 46.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:44,772 INFO L168 Benchmark]: RCFGBuilder took 503.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:44,772 INFO L168 Benchmark]: TraceAbstraction took 29404.47 ms. Allocated memory was 1.1 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: -3.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-10-22 08:57:44,773 INFO L168 Benchmark]: Witness Printer took 138.95 ms. Allocated memory is still 4.7 GB. Free memory was 4.2 GB in the beginning and 4.2 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:44,774 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 560.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -129.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 503.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29404.47 ms. Allocated memory was 1.1 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: -3.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 138.95 ms. Allocated memory is still 4.7 GB. Free memory was 4.2 GB in the beginning and 4.2 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L699] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L701] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L703] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L704] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L705] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L706] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L707] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L708] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L709] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L710] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L711] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L712] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L713] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L714] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L715] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L718] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 0 pthread_t t2571; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] FCALL, FORK 0 pthread_create(&t2571, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] 0 pthread_t t2572; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK 0 pthread_create(&t2572, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L759] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L760] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L761] 2 x$r_buff0_thd2 = (_Bool)1 [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L733] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L737] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x = x$flush_delayed ? x$mem_tmp : x [L741] 1 x$flush_delayed = (_Bool)0 [L746] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L771] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L798] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L800] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L802] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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, 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 197 locations, 3 error locations. Result: UNSAFE, OverallTime: 29.2s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5754 SDtfs, 6907 SDslu, 11318 SDs, 0 SdLazy, 4312 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 56 SyntacticMatches, 9 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61470occurred 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: 14.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 69999 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1467 NumberOfCodeBlocks, 1467 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1362 ConstructedInterpolants, 0 QuantifiedInterpolants, 244239 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...