./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe033_pso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_91126cd4-51d4-471e-894c-2aa28d4371ad/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_91126cd4-51d4-471e-894c-2aa28d4371ad/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_91126cd4-51d4-471e-894c-2aa28d4371ad/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_91126cd4-51d4-471e-894c-2aa28d4371ad/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_pso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_91126cd4-51d4-471e-894c-2aa28d4371ad/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_91126cd4-51d4-471e-894c-2aa28d4371ad/bin-2019/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 2ad3f78977fb69cd2f99ad06c218209d75543485 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-0cd3be1 [2018-11-28 13:08:03,229 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:08:03,230 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:08:03,236 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:08:03,237 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:08:03,237 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:08:03,238 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:08:03,239 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:08:03,240 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:08:03,241 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:08:03,242 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:08:03,242 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:08:03,242 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:08:03,243 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:08:03,243 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:08:03,244 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:08:03,244 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:08:03,245 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:08:03,246 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:08:03,247 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:08:03,248 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:08:03,248 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:08:03,250 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:08:03,250 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:08:03,250 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:08:03,251 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:08:03,251 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:08:03,252 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:08:03,252 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:08:03,252 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:08:03,253 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:08:03,253 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:08:03,253 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:08:03,253 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:08:03,253 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:08:03,254 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:08:03,254 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_91126cd4-51d4-471e-894c-2aa28d4371ad/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 13:08:03,261 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:08:03,261 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:08:03,262 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:08:03,262 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:08:03,263 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:08:03,263 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:08:03,263 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:08:03,263 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:08:03,263 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:08:03,264 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:08:03,264 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:08:03,264 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:08:03,264 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:08:03,264 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:08:03,264 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:08:03,265 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:08:03,265 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:08:03,265 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:08:03,265 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:08:03,265 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:08:03,265 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:08:03,265 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:08:03,266 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:08:03,266 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:08:03,266 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:08:03,266 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:08:03,266 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:08:03,266 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:08:03,267 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:08:03,267 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 13:08:03,267 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_91126cd4-51d4-471e-894c-2aa28d4371ad/bin-2019/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 -> 2ad3f78977fb69cd2f99ad06c218209d75543485 [2018-11-28 13:08:03,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:08:03,300 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:08:03,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:08:03,303 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:08:03,303 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:08:03,304 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_91126cd4-51d4-471e-894c-2aa28d4371ad/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe033_pso.oepc_false-unreach-call.i [2018-11-28 13:08:03,343 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_91126cd4-51d4-471e-894c-2aa28d4371ad/bin-2019/uautomizer/data/71e5d1a92/ebd8d4bb1b3e48d996acdaf6ded66c0f/FLAGc5b23221c [2018-11-28 13:08:03,797 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:08:03,797 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_91126cd4-51d4-471e-894c-2aa28d4371ad/sv-benchmarks/c/pthread-wmm/safe033_pso.oepc_false-unreach-call.i [2018-11-28 13:08:03,807 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_91126cd4-51d4-471e-894c-2aa28d4371ad/bin-2019/uautomizer/data/71e5d1a92/ebd8d4bb1b3e48d996acdaf6ded66c0f/FLAGc5b23221c [2018-11-28 13:08:03,817 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_91126cd4-51d4-471e-894c-2aa28d4371ad/bin-2019/uautomizer/data/71e5d1a92/ebd8d4bb1b3e48d996acdaf6ded66c0f [2018-11-28 13:08:03,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:08:03,820 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:08:03,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:08:03,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:08:03,823 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:08:03,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:08:03" (1/1) ... [2018-11-28 13:08:03,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22b7394e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:03, skipping insertion in model container [2018-11-28 13:08:03,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:08:03" (1/1) ... [2018-11-28 13:08:03,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:08:03,857 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:08:04,083 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:08:04,094 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:08:04,183 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:08:04,217 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:08:04,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:04 WrapperNode [2018-11-28 13:08:04,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:08:04,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:08:04,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:08:04,218 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:08:04,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:04" (1/1) ... [2018-11-28 13:08:04,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:04" (1/1) ... [2018-11-28 13:08:04,258 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:08:04,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:08:04,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:08:04,259 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:08:04,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:04" (1/1) ... [2018-11-28 13:08:04,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:04" (1/1) ... [2018-11-28 13:08:04,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:04" (1/1) ... [2018-11-28 13:08:04,269 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:04" (1/1) ... [2018-11-28 13:08:04,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:04" (1/1) ... [2018-11-28 13:08:04,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:04" (1/1) ... [2018-11-28 13:08:04,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:04" (1/1) ... [2018-11-28 13:08:04,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:08:04,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:08:04,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:08:04,284 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:08:04,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_91126cd4-51d4-471e-894c-2aa28d4371ad/bin-2019/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 [2018-11-28 13:08:04,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:08:04,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:08:04,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 13:08:04,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:08:04,323 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 13:08:04,323 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 13:08:04,323 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 13:08:04,324 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 13:08:04,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 13:08:04,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:08:04,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:08:04,325 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 13:08:04,728 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:08:04,728 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 13:08:04,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:08:04 BoogieIcfgContainer [2018-11-28 13:08:04,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:08:04,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:08:04,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:08:04,730 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:08:04,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:08:03" (1/3) ... [2018-11-28 13:08:04,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3b4bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:08:04, skipping insertion in model container [2018-11-28 13:08:04,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:04" (2/3) ... [2018-11-28 13:08:04,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3b4bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:08:04, skipping insertion in model container [2018-11-28 13:08:04,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:08:04" (3/3) ... [2018-11-28 13:08:04,732 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_pso.oepc_false-unreach-call.i [2018-11-28 13:08:04,757 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,757 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,758 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,758 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,771 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,772 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,772 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,772 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,772 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,772 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,772 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,772 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,772 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,773 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,773 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,773 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,773 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,773 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,773 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,773 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,774 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,774 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,774 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,774 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,774 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,774 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,774 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,775 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,775 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,775 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,775 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,775 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,775 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,775 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,776 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,776 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,776 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,776 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,776 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,776 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,776 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,777 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:08:04,785 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 13:08:04,785 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:08:04,792 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 13:08:04,806 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 13:08:04,821 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:08:04,821 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:08:04,821 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:08:04,821 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:08:04,821 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:08:04,821 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:08:04,821 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:08:04,822 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:08:04,822 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:08:04,829 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 129places, 161 transitions [2018-11-28 13:08:06,277 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27853 states. [2018-11-28 13:08:06,279 INFO L276 IsEmpty]: Start isEmpty. Operand 27853 states. [2018-11-28 13:08:06,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 13:08:06,284 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:06,285 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:06,287 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:06,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:06,291 INFO L82 PathProgramCache]: Analyzing trace with hash -743892383, now seen corresponding path program 1 times [2018-11-28 13:08:06,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:06,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:06,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:06,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:06,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:06,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:06,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:06,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:08:06,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:08:06,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:08:06,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:08:06,521 INFO L87 Difference]: Start difference. First operand 27853 states. Second operand 4 states. [2018-11-28 13:08:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:07,074 INFO L93 Difference]: Finished difference Result 47765 states and 183116 transitions. [2018-11-28 13:08:07,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:08:07,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-28 13:08:07,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:07,260 INFO L225 Difference]: With dead ends: 47765 [2018-11-28 13:08:07,260 INFO L226 Difference]: Without dead ends: 34605 [2018-11-28 13:08:07,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:08:07,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34605 states. [2018-11-28 13:08:07,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34605 to 21753. [2018-11-28 13:08:07,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21753 states. [2018-11-28 13:08:08,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21753 states to 21753 states and 83438 transitions. [2018-11-28 13:08:08,087 INFO L78 Accepts]: Start accepts. Automaton has 21753 states and 83438 transitions. Word has length 36 [2018-11-28 13:08:08,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:08,087 INFO L480 AbstractCegarLoop]: Abstraction has 21753 states and 83438 transitions. [2018-11-28 13:08:08,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:08:08,088 INFO L276 IsEmpty]: Start isEmpty. Operand 21753 states and 83438 transitions. [2018-11-28 13:08:08,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 13:08:08,094 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:08,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:08,097 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:08,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:08,098 INFO L82 PathProgramCache]: Analyzing trace with hash 243022970, now seen corresponding path program 1 times [2018-11-28 13:08:08,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:08,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:08,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:08,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:08,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:08,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:08,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:08:08,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:08:08,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:08:08,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:08:08,174 INFO L87 Difference]: Start difference. First operand 21753 states and 83438 transitions. Second operand 4 states. [2018-11-28 13:08:08,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:08,255 INFO L93 Difference]: Finished difference Result 7167 states and 23623 transitions. [2018-11-28 13:08:08,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:08:08,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-28 13:08:08,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:08,268 INFO L225 Difference]: With dead ends: 7167 [2018-11-28 13:08:08,269 INFO L226 Difference]: Without dead ends: 6321 [2018-11-28 13:08:08,269 INFO L631 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 [2018-11-28 13:08:08,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6321 states. [2018-11-28 13:08:08,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6321 to 6321. [2018-11-28 13:08:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6321 states. [2018-11-28 13:08:08,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6321 states to 6321 states and 20695 transitions. [2018-11-28 13:08:08,475 INFO L78 Accepts]: Start accepts. Automaton has 6321 states and 20695 transitions. Word has length 44 [2018-11-28 13:08:08,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:08,476 INFO L480 AbstractCegarLoop]: Abstraction has 6321 states and 20695 transitions. [2018-11-28 13:08:08,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:08:08,476 INFO L276 IsEmpty]: Start isEmpty. Operand 6321 states and 20695 transitions. [2018-11-28 13:08:08,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 13:08:08,477 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:08,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:08,477 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:08,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:08,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1181250622, now seen corresponding path program 1 times [2018-11-28 13:08:08,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:08,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:08,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:08,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:08,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:08,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:08,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:08,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:08:08,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:08:08,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:08:08,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:08:08,549 INFO L87 Difference]: Start difference. First operand 6321 states and 20695 transitions. Second operand 5 states. [2018-11-28 13:08:08,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:08,798 INFO L93 Difference]: Finished difference Result 12017 states and 38781 transitions. [2018-11-28 13:08:08,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:08:08,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-28 13:08:08,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:08,824 INFO L225 Difference]: With dead ends: 12017 [2018-11-28 13:08:08,824 INFO L226 Difference]: Without dead ends: 11942 [2018-11-28 13:08:08,824 INFO L631 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 [2018-11-28 13:08:08,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11942 states. [2018-11-28 13:08:08,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11942 to 8286. [2018-11-28 13:08:08,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8286 states. [2018-11-28 13:08:08,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8286 states to 8286 states and 26548 transitions. [2018-11-28 13:08:08,960 INFO L78 Accepts]: Start accepts. Automaton has 8286 states and 26548 transitions. Word has length 45 [2018-11-28 13:08:08,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:08,961 INFO L480 AbstractCegarLoop]: Abstraction has 8286 states and 26548 transitions. [2018-11-28 13:08:08,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:08:08,961 INFO L276 IsEmpty]: Start isEmpty. Operand 8286 states and 26548 transitions. [2018-11-28 13:08:08,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 13:08:08,963 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:08,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:08,963 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:08,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:08,963 INFO L82 PathProgramCache]: Analyzing trace with hash -2101913052, now seen corresponding path program 1 times [2018-11-28 13:08:08,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:08,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:08,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:08,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:08,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:08,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:09,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:08:09,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:08:09,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:08:09,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:08:09,000 INFO L87 Difference]: Start difference. First operand 8286 states and 26548 transitions. Second operand 3 states. [2018-11-28 13:08:09,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:09,101 INFO L93 Difference]: Finished difference Result 10982 states and 34703 transitions. [2018-11-28 13:08:09,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:08:09,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-28 13:08:09,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:09,123 INFO L225 Difference]: With dead ends: 10982 [2018-11-28 13:08:09,123 INFO L226 Difference]: Without dead ends: 10978 [2018-11-28 13:08:09,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:08:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10978 states. [2018-11-28 13:08:09,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10978 to 8504. [2018-11-28 13:08:09,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8504 states. [2018-11-28 13:08:09,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8504 states to 8504 states and 26984 transitions. [2018-11-28 13:08:09,256 INFO L78 Accepts]: Start accepts. Automaton has 8504 states and 26984 transitions. Word has length 47 [2018-11-28 13:08:09,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:09,256 INFO L480 AbstractCegarLoop]: Abstraction has 8504 states and 26984 transitions. [2018-11-28 13:08:09,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:08:09,256 INFO L276 IsEmpty]: Start isEmpty. Operand 8504 states and 26984 transitions. [2018-11-28 13:08:09,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 13:08:09,258 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:09,258 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:09,258 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:09,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:09,259 INFO L82 PathProgramCache]: Analyzing trace with hash -585625105, now seen corresponding path program 1 times [2018-11-28 13:08:09,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:09,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:09,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:09,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:09,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:09,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:09,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:09,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:08:09,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:08:09,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:08:09,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:08:09,325 INFO L87 Difference]: Start difference. First operand 8504 states and 26984 transitions. Second operand 6 states. [2018-11-28 13:08:09,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:09,661 INFO L93 Difference]: Finished difference Result 11920 states and 37195 transitions. [2018-11-28 13:08:09,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:08:09,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-11-28 13:08:09,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:09,685 INFO L225 Difference]: With dead ends: 11920 [2018-11-28 13:08:09,685 INFO L226 Difference]: Without dead ends: 11823 [2018-11-28 13:08:09,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:08:09,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11823 states. [2018-11-28 13:08:09,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11823 to 9278. [2018-11-28 13:08:09,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9278 states. [2018-11-28 13:08:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9278 states to 9278 states and 29428 transitions. [2018-11-28 13:08:09,937 INFO L78 Accepts]: Start accepts. Automaton has 9278 states and 29428 transitions. Word has length 51 [2018-11-28 13:08:09,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:09,937 INFO L480 AbstractCegarLoop]: Abstraction has 9278 states and 29428 transitions. [2018-11-28 13:08:09,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:08:09,937 INFO L276 IsEmpty]: Start isEmpty. Operand 9278 states and 29428 transitions. [2018-11-28 13:08:09,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-28 13:08:09,944 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:09,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:09,944 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:09,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:09,944 INFO L82 PathProgramCache]: Analyzing trace with hash 807716739, now seen corresponding path program 1 times [2018-11-28 13:08:09,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:09,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:09,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:09,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:09,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:10,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:10,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:10,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:08:10,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:08:10,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:08:10,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:08:10,007 INFO L87 Difference]: Start difference. First operand 9278 states and 29428 transitions. Second operand 5 states. [2018-11-28 13:08:10,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:10,044 INFO L93 Difference]: Finished difference Result 2586 states and 6693 transitions. [2018-11-28 13:08:10,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:08:10,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-11-28 13:08:10,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:10,049 INFO L225 Difference]: With dead ends: 2586 [2018-11-28 13:08:10,049 INFO L226 Difference]: Without dead ends: 2138 [2018-11-28 13:08:10,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:08:10,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2018-11-28 13:08:10,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 2125. [2018-11-28 13:08:10,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states. [2018-11-28 13:08:10,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 5339 transitions. [2018-11-28 13:08:10,082 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 5339 transitions. Word has length 61 [2018-11-28 13:08:10,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:10,082 INFO L480 AbstractCegarLoop]: Abstraction has 2125 states and 5339 transitions. [2018-11-28 13:08:10,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:08:10,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 5339 transitions. [2018-11-28 13:08:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 13:08:10,087 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:10,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:10,087 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:10,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:10,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1275074230, now seen corresponding path program 1 times [2018-11-28 13:08:10,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:10,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:10,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:10,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:10,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:10,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:10,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:10,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:08:10,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:08:10,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:08:10,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:08:10,166 INFO L87 Difference]: Start difference. First operand 2125 states and 5339 transitions. Second operand 4 states. [2018-11-28 13:08:10,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:10,330 INFO L93 Difference]: Finished difference Result 2907 states and 7134 transitions. [2018-11-28 13:08:10,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:08:10,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-28 13:08:10,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:10,337 INFO L225 Difference]: With dead ends: 2907 [2018-11-28 13:08:10,337 INFO L226 Difference]: Without dead ends: 2907 [2018-11-28 13:08:10,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:08:10,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2018-11-28 13:08:10,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 2488. [2018-11-28 13:08:10,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2488 states. [2018-11-28 13:08:10,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 6155 transitions. [2018-11-28 13:08:10,376 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 6155 transitions. Word has length 80 [2018-11-28 13:08:10,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:10,376 INFO L480 AbstractCegarLoop]: Abstraction has 2488 states and 6155 transitions. [2018-11-28 13:08:10,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:08:10,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 6155 transitions. [2018-11-28 13:08:10,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 13:08:10,381 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:10,381 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:10,381 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:10,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:10,382 INFO L82 PathProgramCache]: Analyzing trace with hash 942683723, now seen corresponding path program 1 times [2018-11-28 13:08:10,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:10,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:10,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:10,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:10,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:10,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:10,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:08:10,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:08:10,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:08:10,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:08:10,445 INFO L87 Difference]: Start difference. First operand 2488 states and 6155 transitions. Second operand 5 states. [2018-11-28 13:08:10,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:10,711 INFO L93 Difference]: Finished difference Result 2576 states and 6208 transitions. [2018-11-28 13:08:10,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:08:10,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-11-28 13:08:10,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:10,717 INFO L225 Difference]: With dead ends: 2576 [2018-11-28 13:08:10,717 INFO L226 Difference]: Without dead ends: 2576 [2018-11-28 13:08:10,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:08:10,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2018-11-28 13:08:10,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 2350. [2018-11-28 13:08:10,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2350 states. [2018-11-28 13:08:10,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 5627 transitions. [2018-11-28 13:08:10,753 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 5627 transitions. Word has length 80 [2018-11-28 13:08:10,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:10,753 INFO L480 AbstractCegarLoop]: Abstraction has 2350 states and 5627 transitions. [2018-11-28 13:08:10,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:08:10,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 5627 transitions. [2018-11-28 13:08:10,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 13:08:10,759 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:10,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:10,759 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:10,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:10,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1161737675, now seen corresponding path program 1 times [2018-11-28 13:08:10,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:10,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:10,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:10,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:10,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:10,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:10,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:08:10,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:08:10,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:08:10,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:08:10,851 INFO L87 Difference]: Start difference. First operand 2350 states and 5627 transitions. Second operand 6 states. [2018-11-28 13:08:11,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:11,329 INFO L93 Difference]: Finished difference Result 3013 states and 7078 transitions. [2018-11-28 13:08:11,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:08:11,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-28 13:08:11,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:11,337 INFO L225 Difference]: With dead ends: 3013 [2018-11-28 13:08:11,337 INFO L226 Difference]: Without dead ends: 2938 [2018-11-28 13:08:11,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:08:11,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2018-11-28 13:08:11,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 2691. [2018-11-28 13:08:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2691 states. [2018-11-28 13:08:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2691 states and 6386 transitions. [2018-11-28 13:08:11,374 INFO L78 Accepts]: Start accepts. Automaton has 2691 states and 6386 transitions. Word has length 80 [2018-11-28 13:08:11,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:11,374 INFO L480 AbstractCegarLoop]: Abstraction has 2691 states and 6386 transitions. [2018-11-28 13:08:11,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:08:11,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 6386 transitions. [2018-11-28 13:08:11,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 13:08:11,379 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:11,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:11,379 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:11,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:11,380 INFO L82 PathProgramCache]: Analyzing trace with hash -917165128, now seen corresponding path program 2 times [2018-11-28 13:08:11,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:11,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:11,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:11,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:11,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:11,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:11,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:11,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:08:11,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:08:11,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:08:11,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:08:11,497 INFO L87 Difference]: Start difference. First operand 2691 states and 6386 transitions. Second operand 7 states. [2018-11-28 13:08:12,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:12,216 INFO L93 Difference]: Finished difference Result 3245 states and 7717 transitions. [2018-11-28 13:08:12,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:08:12,217 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2018-11-28 13:08:12,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:12,223 INFO L225 Difference]: With dead ends: 3245 [2018-11-28 13:08:12,223 INFO L226 Difference]: Without dead ends: 3245 [2018-11-28 13:08:12,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:08:12,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3245 states. [2018-11-28 13:08:12,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3245 to 2728. [2018-11-28 13:08:12,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2728 states. [2018-11-28 13:08:12,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2728 states and 6508 transitions. [2018-11-28 13:08:12,324 INFO L78 Accepts]: Start accepts. Automaton has 2728 states and 6508 transitions. Word has length 80 [2018-11-28 13:08:12,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:12,325 INFO L480 AbstractCegarLoop]: Abstraction has 2728 states and 6508 transitions. [2018-11-28 13:08:12,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:08:12,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 6508 transitions. [2018-11-28 13:08:12,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 13:08:12,329 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:12,329 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:12,329 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:12,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:12,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1123125780, now seen corresponding path program 1 times [2018-11-28 13:08:12,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:12,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:12,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:12,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:08:12,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:12,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:12,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:08:12,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:08:12,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:08:12,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:08:12,446 INFO L87 Difference]: Start difference. First operand 2728 states and 6508 transitions. Second operand 6 states. [2018-11-28 13:08:12,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:12,710 INFO L93 Difference]: Finished difference Result 3125 states and 7212 transitions. [2018-11-28 13:08:12,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:08:12,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-28 13:08:12,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:12,715 INFO L225 Difference]: With dead ends: 3125 [2018-11-28 13:08:12,715 INFO L226 Difference]: Without dead ends: 3125 [2018-11-28 13:08:12,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:08:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2018-11-28 13:08:12,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 2804. [2018-11-28 13:08:12,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2804 states. [2018-11-28 13:08:12,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2804 states and 6524 transitions. [2018-11-28 13:08:12,754 INFO L78 Accepts]: Start accepts. Automaton has 2804 states and 6524 transitions. Word has length 80 [2018-11-28 13:08:12,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:12,754 INFO L480 AbstractCegarLoop]: Abstraction has 2804 states and 6524 transitions. [2018-11-28 13:08:12,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:08:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2804 states and 6524 transitions. [2018-11-28 13:08:12,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 13:08:12,760 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:12,760 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:12,760 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:12,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:12,760 INFO L82 PathProgramCache]: Analyzing trace with hash 868389235, now seen corresponding path program 1 times [2018-11-28 13:08:12,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:12,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:12,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:12,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:12,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:12,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:12,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:12,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:08:12,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:08:12,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:08:12,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:08:12,839 INFO L87 Difference]: Start difference. First operand 2804 states and 6524 transitions. Second operand 4 states. [2018-11-28 13:08:12,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:12,996 INFO L93 Difference]: Finished difference Result 3012 states and 7060 transitions. [2018-11-28 13:08:12,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:08:12,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-28 13:08:12,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:13,001 INFO L225 Difference]: With dead ends: 3012 [2018-11-28 13:08:13,001 INFO L226 Difference]: Without dead ends: 3012 [2018-11-28 13:08:13,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:08:13,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3012 states. [2018-11-28 13:08:13,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3012 to 2868. [2018-11-28 13:08:13,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2868 states. [2018-11-28 13:08:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2868 states to 2868 states and 6700 transitions. [2018-11-28 13:08:13,039 INFO L78 Accepts]: Start accepts. Automaton has 2868 states and 6700 transitions. Word has length 80 [2018-11-28 13:08:13,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:13,039 INFO L480 AbstractCegarLoop]: Abstraction has 2868 states and 6700 transitions. [2018-11-28 13:08:13,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:08:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2868 states and 6700 transitions. [2018-11-28 13:08:13,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 13:08:13,044 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:13,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:13,045 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:13,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:13,045 INFO L82 PathProgramCache]: Analyzing trace with hash -939065228, now seen corresponding path program 1 times [2018-11-28 13:08:13,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:13,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:13,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:13,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:13,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:13,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:13,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:13,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:08:13,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:08:13,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:08:13,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:08:13,185 INFO L87 Difference]: Start difference. First operand 2868 states and 6700 transitions. Second operand 6 states. [2018-11-28 13:08:13,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:13,265 INFO L93 Difference]: Finished difference Result 2820 states and 6468 transitions. [2018-11-28 13:08:13,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:08:13,265 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-28 13:08:13,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:13,268 INFO L225 Difference]: With dead ends: 2820 [2018-11-28 13:08:13,269 INFO L226 Difference]: Without dead ends: 2820 [2018-11-28 13:08:13,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:08:13,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2018-11-28 13:08:13,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2549. [2018-11-28 13:08:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2549 states. [2018-11-28 13:08:13,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 5856 transitions. [2018-11-28 13:08:13,302 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 5856 transitions. Word has length 80 [2018-11-28 13:08:13,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:13,302 INFO L480 AbstractCegarLoop]: Abstraction has 2549 states and 5856 transitions. [2018-11-28 13:08:13,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:08:13,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 5856 transitions. [2018-11-28 13:08:13,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 13:08:13,306 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:13,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:13,307 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:13,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:13,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1552684854, now seen corresponding path program 1 times [2018-11-28 13:08:13,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:13,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:13,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:13,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:13,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:13,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:13,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:08:13,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:08:13,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:08:13,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:08:13,448 INFO L87 Difference]: Start difference. First operand 2549 states and 5856 transitions. Second operand 6 states. [2018-11-28 13:08:13,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:13,710 INFO L93 Difference]: Finished difference Result 2935 states and 6669 transitions. [2018-11-28 13:08:13,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:08:13,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-11-28 13:08:13,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:13,714 INFO L225 Difference]: With dead ends: 2935 [2018-11-28 13:08:13,714 INFO L226 Difference]: Without dead ends: 2877 [2018-11-28 13:08:13,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:08:13,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2018-11-28 13:08:13,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 2253. [2018-11-28 13:08:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2253 states. [2018-11-28 13:08:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 5120 transitions. [2018-11-28 13:08:13,746 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 5120 transitions. Word has length 82 [2018-11-28 13:08:13,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:13,746 INFO L480 AbstractCegarLoop]: Abstraction has 2253 states and 5120 transitions. [2018-11-28 13:08:13,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:08:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 5120 transitions. [2018-11-28 13:08:13,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 13:08:13,750 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:13,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:13,751 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:13,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:13,751 INFO L82 PathProgramCache]: Analyzing trace with hash -524524489, now seen corresponding path program 1 times [2018-11-28 13:08:13,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:13,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:13,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:13,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:13,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:13,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:13,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:08:13,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:08:13,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:08:13,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:08:13,838 INFO L87 Difference]: Start difference. First operand 2253 states and 5120 transitions. Second operand 5 states. [2018-11-28 13:08:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:13,866 INFO L93 Difference]: Finished difference Result 2253 states and 5104 transitions. [2018-11-28 13:08:13,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:08:13,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-11-28 13:08:13,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:13,869 INFO L225 Difference]: With dead ends: 2253 [2018-11-28 13:08:13,869 INFO L226 Difference]: Without dead ends: 2253 [2018-11-28 13:08:13,870 INFO L631 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 [2018-11-28 13:08:13,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2018-11-28 13:08:13,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 2253. [2018-11-28 13:08:13,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2253 states. [2018-11-28 13:08:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 5104 transitions. [2018-11-28 13:08:13,896 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 5104 transitions. Word has length 82 [2018-11-28 13:08:13,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:13,897 INFO L480 AbstractCegarLoop]: Abstraction has 2253 states and 5104 transitions. [2018-11-28 13:08:13,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:08:13,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 5104 transitions. [2018-11-28 13:08:13,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 13:08:13,900 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:13,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:13,900 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:13,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:13,900 INFO L82 PathProgramCache]: Analyzing trace with hash 362979192, now seen corresponding path program 1 times [2018-11-28 13:08:13,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:13,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:13,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:13,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:13,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:14,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:14,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:08:14,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:08:14,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:08:14,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:08:14,009 INFO L87 Difference]: Start difference. First operand 2253 states and 5104 transitions. Second operand 7 states. [2018-11-28 13:08:14,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:14,258 INFO L93 Difference]: Finished difference Result 3937 states and 8982 transitions. [2018-11-28 13:08:14,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:08:14,259 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-11-28 13:08:14,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:14,261 INFO L225 Difference]: With dead ends: 3937 [2018-11-28 13:08:14,262 INFO L226 Difference]: Without dead ends: 1652 [2018-11-28 13:08:14,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:08:14,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2018-11-28 13:08:14,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1652. [2018-11-28 13:08:14,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2018-11-28 13:08:14,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 3759 transitions. [2018-11-28 13:08:14,285 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 3759 transitions. Word has length 82 [2018-11-28 13:08:14,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:14,285 INFO L480 AbstractCegarLoop]: Abstraction has 1652 states and 3759 transitions. [2018-11-28 13:08:14,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:08:14,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 3759 transitions. [2018-11-28 13:08:14,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 13:08:14,288 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:14,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:14,288 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:14,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:14,288 INFO L82 PathProgramCache]: Analyzing trace with hash 553638956, now seen corresponding path program 2 times [2018-11-28 13:08:14,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:14,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:14,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:14,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:14,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:14,341 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 13:08:14,434 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 13:08:14,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:08:14 BasicIcfg [2018-11-28 13:08:14,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:08:14,435 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:08:14,436 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:08:14,437 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:08:14,438 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:08:04" (3/4) ... [2018-11-28 13:08:14,440 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 13:08:14,536 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_91126cd4-51d4-471e-894c-2aa28d4371ad/bin-2019/uautomizer/witness.graphml [2018-11-28 13:08:14,537 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:08:14,537 INFO L168 Benchmark]: Toolchain (without parser) took 10718.09 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 801.1 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -146.4 MB). Peak memory consumption was 654.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:08:14,539 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:08:14,539 INFO L168 Benchmark]: CACSL2BoogieTranslator took 397.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:08:14,540 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:08:14,540 INFO L168 Benchmark]: Boogie Preprocessor took 25.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:08:14,540 INFO L168 Benchmark]: RCFGBuilder took 444.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:08:14,540 INFO L168 Benchmark]: TraceAbstraction took 9706.75 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 675.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -76.3 MB). Peak memory consumption was 599.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:08:14,540 INFO L168 Benchmark]: Witness Printer took 101.11 ms. Allocated memory is still 1.8 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:08:14,542 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 397.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 444.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9706.75 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 675.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -76.3 MB). Peak memory consumption was 599.0 MB. Max. memory is 11.5 GB. * Witness Printer took 101.11 ms. Allocated memory is still 1.8 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L676] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L678] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L679] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L680] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L681] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L682] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L683] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L684] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L685] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L686] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L687] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L688] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L689] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L690] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L691] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L692] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L694] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L695] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L696] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L766] -1 pthread_t t2567; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] FCALL, FORK -1 pthread_create(&t2567, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L768] -1 pthread_t t2568; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] FCALL, FORK -1 pthread_create(&t2568, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L730] 0 x$w_buff1 = x$w_buff0 [L731] 0 x$w_buff0 = 1 [L732] 0 x$w_buff1_used = x$w_buff0_used [L733] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L735] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L736] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L737] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L738] 0 x$r_buff0_thd2 = (_Bool)1 [L741] 0 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L700] 1 y = 2 [L705] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L706] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L707] 1 x$flush_delayed = weak$$choice2 [L708] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L709] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L709] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L710] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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] [L744] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L710] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L711] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L711] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L712] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L712] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L713] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L713] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L714] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L714] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L715] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L715] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L716] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] 1 x = x$flush_delayed ? x$mem_tmp : x [L718] 1 x$flush_delayed = (_Bool)0 [L723] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L745] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L745] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L746] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L747] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L748] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L748] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L751] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L771] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L776] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L777] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L778] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L779] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L782] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 197 locations, 3 error locations. UNSAFE Result, 9.6s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3511 SDtfs, 4141 SDslu, 6304 SDs, 0 SdLazy, 2701 SolverSat, 166 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 38 SyntacticMatches, 9 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27853occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 24309 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1172 NumberOfCodeBlocks, 1172 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1074 ConstructedInterpolants, 0 QuantifiedInterpolants, 218073 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...