./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038_power.opt_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_32cb0011-f7e6-426a-b414-70669dd5ea99/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_32cb0011-f7e6-426a-b414-70669dd5ea99/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_32cb0011-f7e6-426a-b414-70669dd5ea99/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_32cb0011-f7e6-426a-b414-70669dd5ea99/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_32cb0011-f7e6-426a-b414-70669dd5ea99/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_32cb0011-f7e6-426a-b414-70669dd5ea99/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 1f549157edce047f70132d5e80287afe42e5ae9c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:09:11,300 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:09:11,301 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:09:11,310 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:09:11,310 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:09:11,311 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:09:11,312 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:09:11,313 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:09:11,314 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:09:11,315 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:09:11,316 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:09:11,316 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:09:11,317 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:09:11,317 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:09:11,318 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:09:11,319 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:09:11,319 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:09:11,321 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:09:11,322 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:09:11,323 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:09:11,324 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:09:11,325 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:09:11,327 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:09:11,327 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:09:11,327 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:09:11,328 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:09:11,329 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:09:11,329 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:09:11,330 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:09:11,331 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:09:11,331 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:09:11,331 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:09:11,332 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:09:11,332 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:09:11,332 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:09:11,333 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:09:11,333 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_32cb0011-f7e6-426a-b414-70669dd5ea99/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 13:09:11,342 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:09:11,342 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:09:11,343 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:09:11,343 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:09:11,343 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:09:11,343 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:09:11,343 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:09:11,344 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:09:11,344 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:09:11,344 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:09:11,344 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:09:11,344 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:09:11,344 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:09:11,344 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:09:11,344 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:09:11,344 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:09:11,344 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:09:11,344 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:09:11,344 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:09:11,345 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:09:11,345 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:09:11,345 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:09:11,345 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:09:11,345 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:09:11,345 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:09:11,345 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:09:11,345 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:09:11,345 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:09:11,345 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:09:11,345 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 13:09:11,345 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_32cb0011-f7e6-426a-b414-70669dd5ea99/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 -> 1f549157edce047f70132d5e80287afe42e5ae9c [2018-11-28 13:09:11,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:09:11,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:09:11,383 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:09:11,384 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:09:11,384 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:09:11,385 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_32cb0011-f7e6-426a-b414-70669dd5ea99/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix038_power.opt_false-unreach-call.i [2018-11-28 13:09:11,434 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_32cb0011-f7e6-426a-b414-70669dd5ea99/bin-2019/uautomizer/data/80b98b278/c82ffb1f822f40bdb750b8bd64e05261/FLAGe9e12513f [2018-11-28 13:09:11,784 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:09:11,785 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_32cb0011-f7e6-426a-b414-70669dd5ea99/sv-benchmarks/c/pthread-wmm/mix038_power.opt_false-unreach-call.i [2018-11-28 13:09:11,793 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_32cb0011-f7e6-426a-b414-70669dd5ea99/bin-2019/uautomizer/data/80b98b278/c82ffb1f822f40bdb750b8bd64e05261/FLAGe9e12513f [2018-11-28 13:09:11,802 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_32cb0011-f7e6-426a-b414-70669dd5ea99/bin-2019/uautomizer/data/80b98b278/c82ffb1f822f40bdb750b8bd64e05261 [2018-11-28 13:09:11,803 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:09:11,804 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:09:11,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:09:11,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:09:11,807 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:09:11,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:09:11" (1/1) ... [2018-11-28 13:09:11,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e115a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:11, skipping insertion in model container [2018-11-28 13:09:11,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:09:11" (1/1) ... [2018-11-28 13:09:11,814 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:09:11,842 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:09:12,066 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:09:12,075 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:09:12,164 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:09:12,211 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:09:12,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:12 WrapperNode [2018-11-28 13:09:12,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:09:12,212 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:09:12,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:09:12,212 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:09:12,219 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:09:12" (1/1) ... [2018-11-28 13:09:12,232 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:09:12" (1/1) ... [2018-11-28 13:09:12,253 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:09:12,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:09:12,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:09:12,254 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:09:12,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:12" (1/1) ... [2018-11-28 13:09:12,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:12" (1/1) ... [2018-11-28 13:09:12,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:12" (1/1) ... [2018-11-28 13:09:12,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:12" (1/1) ... [2018-11-28 13:09:12,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:12" (1/1) ... [2018-11-28 13:09:12,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:12" (1/1) ... [2018-11-28 13:09:12,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:12" (1/1) ... [2018-11-28 13:09:12,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:09:12,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:09:12,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:09:12,281 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:09:12,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32cb0011-f7e6-426a-b414-70669dd5ea99/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:09:12,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:09:12,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:09:12,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 13:09:12,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:09:12,320 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 13:09:12,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 13:09:12,321 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 13:09:12,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 13:09:12,321 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-11-28 13:09:12,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-11-28 13:09:12,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 13:09:12,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:09:12,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:09:12,322 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:09:12,770 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:09:12,770 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 13:09:12,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:09:12 BoogieIcfgContainer [2018-11-28 13:09:12,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:09:12,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:09:12,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:09:12,774 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:09:12,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:09:11" (1/3) ... [2018-11-28 13:09:12,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17aecda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:09:12, skipping insertion in model container [2018-11-28 13:09:12,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:12" (2/3) ... [2018-11-28 13:09:12,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17aecda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:09:12, skipping insertion in model container [2018-11-28 13:09:12,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:09:12" (3/3) ... [2018-11-28 13:09:12,777 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_power.opt_false-unreach-call.i [2018-11-28 13:09:12,808 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,808 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,808 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,808 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,808 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,808 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,809 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,809 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,809 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,809 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,810 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,811 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,821 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,822 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,823 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,824 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,824 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,824 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,824 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,825 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,825 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,825 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,825 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,825 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,825 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,826 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,826 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,826 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,826 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,826 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,826 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,826 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,827 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,827 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,827 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,827 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,827 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,827 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,827 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,828 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,828 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,828 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,828 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,828 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,828 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,829 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,829 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,829 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,829 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,829 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,829 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,829 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,829 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,830 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:09:12,845 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 13:09:12,845 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:09:12,856 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 13:09:12,871 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 13:09:12,892 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:09:12,893 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:09:12,893 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:09:12,893 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:09:12,893 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:09:12,893 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:09:12,893 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:09:12,893 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:09:12,893 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:09:12,902 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146places, 177 transitions [2018-11-28 13:09:36,891 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149045 states. [2018-11-28 13:09:36,892 INFO L276 IsEmpty]: Start isEmpty. Operand 149045 states. [2018-11-28 13:09:36,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 13:09:36,901 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:36,901 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] [2018-11-28 13:09:36,904 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:36,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:36,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1389776375, now seen corresponding path program 1 times [2018-11-28 13:09:36,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:36,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:36,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:36,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:36,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:37,120 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:09:37,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:37,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:09:37,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:09:37,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:09:37,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:09:37,135 INFO L87 Difference]: Start difference. First operand 149045 states. Second operand 4 states. [2018-11-28 13:09:41,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:41,176 INFO L93 Difference]: Finished difference Result 257065 states and 1188604 transitions. [2018-11-28 13:09:41,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:09:41,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-11-28 13:09:41,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:41,890 INFO L225 Difference]: With dead ends: 257065 [2018-11-28 13:09:41,890 INFO L226 Difference]: Without dead ends: 174815 [2018-11-28 13:09:41,892 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:09:43,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174815 states. [2018-11-28 13:09:45,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174815 to 110555. [2018-11-28 13:09:45,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110555 states. [2018-11-28 13:09:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110555 states to 110555 states and 511486 transitions. [2018-11-28 13:09:45,820 INFO L78 Accepts]: Start accepts. Automaton has 110555 states and 511486 transitions. Word has length 46 [2018-11-28 13:09:45,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:45,821 INFO L480 AbstractCegarLoop]: Abstraction has 110555 states and 511486 transitions. [2018-11-28 13:09:45,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:09:45,821 INFO L276 IsEmpty]: Start isEmpty. Operand 110555 states and 511486 transitions. [2018-11-28 13:09:45,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 13:09:45,833 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:45,835 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] [2018-11-28 13:09:45,835 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:45,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:45,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1733656626, now seen corresponding path program 1 times [2018-11-28 13:09:45,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:45,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:45,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:45,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:45,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:45,917 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:09:45,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:45,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:09:45,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:09:45,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:09:45,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:09:45,919 INFO L87 Difference]: Start difference. First operand 110555 states and 511486 transitions. Second operand 5 states. [2018-11-28 13:09:50,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:50,702 INFO L93 Difference]: Finished difference Result 240605 states and 1068741 transitions. [2018-11-28 13:09:50,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:09:50,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-28 13:09:50,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:51,349 INFO L225 Difference]: With dead ends: 240605 [2018-11-28 13:09:51,349 INFO L226 Difference]: Without dead ends: 237055 [2018-11-28 13:09:51,350 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:09:52,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237055 states. [2018-11-28 13:09:54,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237055 to 160435. [2018-11-28 13:09:54,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160435 states. [2018-11-28 13:09:55,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160435 states to 160435 states and 716930 transitions. [2018-11-28 13:09:55,025 INFO L78 Accepts]: Start accepts. Automaton has 160435 states and 716930 transitions. Word has length 54 [2018-11-28 13:09:55,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:55,025 INFO L480 AbstractCegarLoop]: Abstraction has 160435 states and 716930 transitions. [2018-11-28 13:09:55,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:09:55,025 INFO L276 IsEmpty]: Start isEmpty. Operand 160435 states and 716930 transitions. [2018-11-28 13:09:55,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 13:09:55,037 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:55,037 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] [2018-11-28 13:09:55,038 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:55,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:55,039 INFO L82 PathProgramCache]: Analyzing trace with hash 665822922, now seen corresponding path program 1 times [2018-11-28 13:09:55,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:55,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:55,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:55,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:55,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:55,105 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:09:55,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:55,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:09:55,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:09:55,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:09:55,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:09:55,106 INFO L87 Difference]: Start difference. First operand 160435 states and 716930 transitions. Second operand 5 states. [2018-11-28 13:09:57,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:57,397 INFO L93 Difference]: Finished difference Result 317175 states and 1405287 transitions. [2018-11-28 13:09:57,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:09:57,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-11-28 13:09:57,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:58,163 INFO L225 Difference]: With dead ends: 317175 [2018-11-28 13:09:58,163 INFO L226 Difference]: Without dead ends: 314275 [2018-11-28 13:09:58,163 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:09:59,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314275 states. [2018-11-28 13:10:07,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314275 to 178275. [2018-11-28 13:10:07,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178275 states. [2018-11-28 13:10:08,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178275 states to 178275 states and 791492 transitions. [2018-11-28 13:10:08,443 INFO L78 Accepts]: Start accepts. Automaton has 178275 states and 791492 transitions. Word has length 55 [2018-11-28 13:10:08,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:08,444 INFO L480 AbstractCegarLoop]: Abstraction has 178275 states and 791492 transitions. [2018-11-28 13:10:08,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:10:08,444 INFO L276 IsEmpty]: Start isEmpty. Operand 178275 states and 791492 transitions. [2018-11-28 13:10:08,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 13:10:08,463 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:08,463 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] [2018-11-28 13:10:08,463 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:08,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:08,463 INFO L82 PathProgramCache]: Analyzing trace with hash -137196688, now seen corresponding path program 1 times [2018-11-28 13:10:08,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:08,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:08,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:08,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:08,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:08,509 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:10:08,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:08,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:10:08,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:10:08,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:10:08,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:10:08,510 INFO L87 Difference]: Start difference. First operand 178275 states and 791492 transitions. Second operand 3 states. [2018-11-28 13:10:09,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:09,771 INFO L93 Difference]: Finished difference Result 231655 states and 1011276 transitions. [2018-11-28 13:10:09,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:10:09,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-11-28 13:10:09,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:10,470 INFO L225 Difference]: With dead ends: 231655 [2018-11-28 13:10:10,470 INFO L226 Difference]: Without dead ends: 231655 [2018-11-28 13:10:10,470 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:10:11,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231655 states. [2018-11-28 13:10:15,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231655 to 202940. [2018-11-28 13:10:15,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202940 states. [2018-11-28 13:10:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202940 states to 202940 states and 893564 transitions. [2018-11-28 13:10:22,295 INFO L78 Accepts]: Start accepts. Automaton has 202940 states and 893564 transitions. Word has length 57 [2018-11-28 13:10:22,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:22,295 INFO L480 AbstractCegarLoop]: Abstraction has 202940 states and 893564 transitions. [2018-11-28 13:10:22,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:10:22,295 INFO L276 IsEmpty]: Start isEmpty. Operand 202940 states and 893564 transitions. [2018-11-28 13:10:22,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-28 13:10:22,326 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:22,326 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:10:22,326 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:22,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:22,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1048459579, now seen corresponding path program 1 times [2018-11-28 13:10:22,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:22,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:22,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:22,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:22,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:22,405 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:10:22,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:22,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:10:22,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:10:22,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:10:22,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:10:22,406 INFO L87 Difference]: Start difference. First operand 202940 states and 893564 transitions. Second operand 6 states. [2018-11-28 13:10:24,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:24,703 INFO L93 Difference]: Finished difference Result 356175 states and 1552272 transitions. [2018-11-28 13:10:24,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 13:10:24,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-11-28 13:10:24,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:25,566 INFO L225 Difference]: With dead ends: 356175 [2018-11-28 13:10:25,566 INFO L226 Difference]: Without dead ends: 352825 [2018-11-28 13:10:25,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:10:27,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352825 states. [2018-11-28 13:10:31,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352825 to 205745. [2018-11-28 13:10:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205745 states. [2018-11-28 13:10:32,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205745 states to 205745 states and 906783 transitions. [2018-11-28 13:10:32,175 INFO L78 Accepts]: Start accepts. Automaton has 205745 states and 906783 transitions. Word has length 61 [2018-11-28 13:10:32,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:32,175 INFO L480 AbstractCegarLoop]: Abstraction has 205745 states and 906783 transitions. [2018-11-28 13:10:32,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:10:32,175 INFO L276 IsEmpty]: Start isEmpty. Operand 205745 states and 906783 transitions. [2018-11-28 13:10:32,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-28 13:10:32,804 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:32,804 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:10:32,805 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:32,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:32,805 INFO L82 PathProgramCache]: Analyzing trace with hash -639670917, now seen corresponding path program 1 times [2018-11-28 13:10:32,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:32,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:32,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:32,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:32,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:32,887 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:10:32,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:32,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:10:32,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:10:32,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:10:32,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:10:32,888 INFO L87 Difference]: Start difference. First operand 205745 states and 906783 transitions. Second operand 7 states. [2018-11-28 13:10:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:39,816 INFO L93 Difference]: Finished difference Result 363445 states and 1539808 transitions. [2018-11-28 13:10:39,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 13:10:39,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-11-28 13:10:39,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:40,763 INFO L225 Difference]: With dead ends: 363445 [2018-11-28 13:10:40,763 INFO L226 Difference]: Without dead ends: 363445 [2018-11-28 13:10:40,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:10:42,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363445 states. [2018-11-28 13:10:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363445 to 273285. [2018-11-28 13:10:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273285 states. [2018-11-28 13:10:47,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273285 states to 273285 states and 1180560 transitions. [2018-11-28 13:10:47,856 INFO L78 Accepts]: Start accepts. Automaton has 273285 states and 1180560 transitions. Word has length 61 [2018-11-28 13:10:47,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:47,856 INFO L480 AbstractCegarLoop]: Abstraction has 273285 states and 1180560 transitions. [2018-11-28 13:10:47,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:10:47,856 INFO L276 IsEmpty]: Start isEmpty. Operand 273285 states and 1180560 transitions. [2018-11-28 13:10:47,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-28 13:10:47,901 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:47,902 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:10:47,902 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:47,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:47,902 INFO L82 PathProgramCache]: Analyzing trace with hash 247832764, now seen corresponding path program 1 times [2018-11-28 13:10:47,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:47,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:47,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:47,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:47,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:47,952 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:10:47,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:47,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:10:47,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:10:47,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:10:47,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:10:47,953 INFO L87 Difference]: Start difference. First operand 273285 states and 1180560 transitions. Second operand 4 states. [2018-11-28 13:10:49,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:49,886 INFO L93 Difference]: Finished difference Result 238293 states and 1009124 transitions. [2018-11-28 13:10:49,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:10:49,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-11-28 13:10:49,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:50,434 INFO L225 Difference]: With dead ends: 238293 [2018-11-28 13:10:50,434 INFO L226 Difference]: Without dead ends: 230208 [2018-11-28 13:10:50,434 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:10:51,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230208 states. [2018-11-28 13:10:54,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230208 to 230208. [2018-11-28 13:10:54,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230208 states. [2018-11-28 13:10:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230208 states to 230208 states and 981402 transitions. [2018-11-28 13:10:55,497 INFO L78 Accepts]: Start accepts. Automaton has 230208 states and 981402 transitions. Word has length 61 [2018-11-28 13:10:55,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:55,498 INFO L480 AbstractCegarLoop]: Abstraction has 230208 states and 981402 transitions. [2018-11-28 13:10:55,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:10:55,498 INFO L276 IsEmpty]: Start isEmpty. Operand 230208 states and 981402 transitions. [2018-11-28 13:10:55,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 13:10:55,536 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:55,536 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:55,536 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:55,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:55,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1622064650, now seen corresponding path program 1 times [2018-11-28 13:10:55,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:55,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:55,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:55,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:55,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:55,581 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:10:55,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:55,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:10:55,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:10:55,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:10:55,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:10:55,582 INFO L87 Difference]: Start difference. First operand 230208 states and 981402 transitions. Second operand 5 states. [2018-11-28 13:10:55,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:55,826 INFO L93 Difference]: Finished difference Result 55500 states and 215291 transitions. [2018-11-28 13:10:55,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:10:55,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-11-28 13:10:55,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:55,918 INFO L225 Difference]: With dead ends: 55500 [2018-11-28 13:10:55,918 INFO L226 Difference]: Without dead ends: 48584 [2018-11-28 13:10:55,918 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:10:56,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48584 states. [2018-11-28 13:10:59,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48584 to 48344. [2018-11-28 13:10:59,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48344 states. [2018-11-28 13:10:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48344 states to 48344 states and 187078 transitions. [2018-11-28 13:10:59,960 INFO L78 Accepts]: Start accepts. Automaton has 48344 states and 187078 transitions. Word has length 62 [2018-11-28 13:10:59,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:59,960 INFO L480 AbstractCegarLoop]: Abstraction has 48344 states and 187078 transitions. [2018-11-28 13:10:59,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:10:59,960 INFO L276 IsEmpty]: Start isEmpty. Operand 48344 states and 187078 transitions. [2018-11-28 13:10:59,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 13:10:59,976 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:59,977 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] [2018-11-28 13:10:59,977 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:59,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:59,977 INFO L82 PathProgramCache]: Analyzing trace with hash -735521465, now seen corresponding path program 1 times [2018-11-28 13:10:59,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:59,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:59,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:59,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:59,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:00,049 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:11:00,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:00,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:11:00,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:11:00,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:11:00,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:11:00,050 INFO L87 Difference]: Start difference. First operand 48344 states and 187078 transitions. Second operand 4 states. [2018-11-28 13:11:00,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:00,339 INFO L93 Difference]: Finished difference Result 56631 states and 218625 transitions. [2018-11-28 13:11:00,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:11:00,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-11-28 13:11:00,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:00,449 INFO L225 Difference]: With dead ends: 56631 [2018-11-28 13:11:00,449 INFO L226 Difference]: Without dead ends: 56631 [2018-11-28 13:11:00,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:11:00,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56631 states. [2018-11-28 13:11:01,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56631 to 51431. [2018-11-28 13:11:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51431 states. [2018-11-28 13:11:01,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51431 states to 51431 states and 198665 transitions. [2018-11-28 13:11:01,226 INFO L78 Accepts]: Start accepts. Automaton has 51431 states and 198665 transitions. Word has length 72 [2018-11-28 13:11:01,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:01,226 INFO L480 AbstractCegarLoop]: Abstraction has 51431 states and 198665 transitions. [2018-11-28 13:11:01,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:11:01,226 INFO L276 IsEmpty]: Start isEmpty. Operand 51431 states and 198665 transitions. [2018-11-28 13:11:01,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 13:11:01,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:01,245 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] [2018-11-28 13:11:01,245 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:01,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:01,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1007288870, now seen corresponding path program 1 times [2018-11-28 13:11:01,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:01,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:01,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:01,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:01,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:01,316 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:11:01,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:01,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:11:01,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:11:01,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:11:01,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:11:01,317 INFO L87 Difference]: Start difference. First operand 51431 states and 198665 transitions. Second operand 6 states. [2018-11-28 13:11:01,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:01,382 INFO L93 Difference]: Finished difference Result 14279 states and 47593 transitions. [2018-11-28 13:11:01,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:11:01,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-11-28 13:11:01,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:01,397 INFO L225 Difference]: With dead ends: 14279 [2018-11-28 13:11:01,397 INFO L226 Difference]: Without dead ends: 12023 [2018-11-28 13:11:01,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:11:01,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12023 states. [2018-11-28 13:11:01,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12023 to 11433. [2018-11-28 13:11:01,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11433 states. [2018-11-28 13:11:01,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11433 states to 11433 states and 37545 transitions. [2018-11-28 13:11:01,525 INFO L78 Accepts]: Start accepts. Automaton has 11433 states and 37545 transitions. Word has length 72 [2018-11-28 13:11:01,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:01,525 INFO L480 AbstractCegarLoop]: Abstraction has 11433 states and 37545 transitions. [2018-11-28 13:11:01,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:11:01,525 INFO L276 IsEmpty]: Start isEmpty. Operand 11433 states and 37545 transitions. [2018-11-28 13:11:01,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 13:11:01,537 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:01,537 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:01,537 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:01,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:01,538 INFO L82 PathProgramCache]: Analyzing trace with hash -498394890, now seen corresponding path program 1 times [2018-11-28 13:11:01,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:01,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:01,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:01,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:01,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:01,890 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:11:01,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:01,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:11:01,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:11:01,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:11:01,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:11:01,891 INFO L87 Difference]: Start difference. First operand 11433 states and 37545 transitions. Second operand 4 states. [2018-11-28 13:11:02,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:02,060 INFO L93 Difference]: Finished difference Result 15878 states and 51191 transitions. [2018-11-28 13:11:02,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:11:02,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-11-28 13:11:02,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:02,079 INFO L225 Difference]: With dead ends: 15878 [2018-11-28 13:11:02,079 INFO L226 Difference]: Without dead ends: 15878 [2018-11-28 13:11:02,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:11:02,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15878 states. [2018-11-28 13:11:02,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15878 to 13895. [2018-11-28 13:11:02,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13895 states. [2018-11-28 13:11:02,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13895 states to 13895 states and 45044 transitions. [2018-11-28 13:11:02,234 INFO L78 Accepts]: Start accepts. Automaton has 13895 states and 45044 transitions. Word has length 91 [2018-11-28 13:11:02,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:02,234 INFO L480 AbstractCegarLoop]: Abstraction has 13895 states and 45044 transitions. [2018-11-28 13:11:02,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:11:02,235 INFO L276 IsEmpty]: Start isEmpty. Operand 13895 states and 45044 transitions. [2018-11-28 13:11:02,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 13:11:02,249 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:02,249 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:02,249 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:02,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:02,250 INFO L82 PathProgramCache]: Analyzing trace with hash -147594953, now seen corresponding path program 1 times [2018-11-28 13:11:02,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:02,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:02,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:02,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:02,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:02,290 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:11:02,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:02,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:11:02,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:11:02,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:11:02,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:11:02,291 INFO L87 Difference]: Start difference. First operand 13895 states and 45044 transitions. Second operand 3 states. [2018-11-28 13:11:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:02,411 INFO L93 Difference]: Finished difference Result 15005 states and 48497 transitions. [2018-11-28 13:11:02,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:11:02,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-11-28 13:11:02,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:02,428 INFO L225 Difference]: With dead ends: 15005 [2018-11-28 13:11:02,428 INFO L226 Difference]: Without dead ends: 15005 [2018-11-28 13:11:02,428 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:11:02,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15005 states. [2018-11-28 13:11:02,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15005 to 14505. [2018-11-28 13:11:02,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14505 states. [2018-11-28 13:11:02,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14505 states to 14505 states and 46952 transitions. [2018-11-28 13:11:02,585 INFO L78 Accepts]: Start accepts. Automaton has 14505 states and 46952 transitions. Word has length 91 [2018-11-28 13:11:02,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:02,585 INFO L480 AbstractCegarLoop]: Abstraction has 14505 states and 46952 transitions. [2018-11-28 13:11:02,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:11:02,585 INFO L276 IsEmpty]: Start isEmpty. Operand 14505 states and 46952 transitions. [2018-11-28 13:11:02,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 13:11:02,600 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:02,600 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:02,600 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:02,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:02,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1550289063, now seen corresponding path program 2 times [2018-11-28 13:11:02,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:02,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:02,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:02,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:02,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:02,747 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:11:02,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:02,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:11:02,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:11:02,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:11:02,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:11:02,748 INFO L87 Difference]: Start difference. First operand 14505 states and 46952 transitions. Second operand 9 states. [2018-11-28 13:11:02,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:02,928 INFO L93 Difference]: Finished difference Result 17362 states and 55727 transitions. [2018-11-28 13:11:02,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 13:11:02,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2018-11-28 13:11:02,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:02,947 INFO L225 Difference]: With dead ends: 17362 [2018-11-28 13:11:02,948 INFO L226 Difference]: Without dead ends: 17362 [2018-11-28 13:11:02,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:11:02,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17362 states. [2018-11-28 13:11:03,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17362 to 14570. [2018-11-28 13:11:03,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14570 states. [2018-11-28 13:11:03,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14570 states to 14570 states and 47129 transitions. [2018-11-28 13:11:03,114 INFO L78 Accepts]: Start accepts. Automaton has 14570 states and 47129 transitions. Word has length 91 [2018-11-28 13:11:03,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:03,114 INFO L480 AbstractCegarLoop]: Abstraction has 14570 states and 47129 transitions. [2018-11-28 13:11:03,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:11:03,114 INFO L276 IsEmpty]: Start isEmpty. Operand 14570 states and 47129 transitions. [2018-11-28 13:11:03,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 13:11:03,128 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:03,129 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:03,129 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:03,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:03,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1992475579, now seen corresponding path program 3 times [2018-11-28 13:11:03,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:03,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:03,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:03,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:11:03,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:03,202 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:11:03,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:03,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:11:03,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:11:03,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:11:03,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:11:03,203 INFO L87 Difference]: Start difference. First operand 14570 states and 47129 transitions. Second operand 5 states. [2018-11-28 13:11:03,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:03,377 INFO L93 Difference]: Finished difference Result 18322 states and 58640 transitions. [2018-11-28 13:11:03,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:11:03,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-28 13:11:03,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:03,397 INFO L225 Difference]: With dead ends: 18322 [2018-11-28 13:11:03,398 INFO L226 Difference]: Without dead ends: 18322 [2018-11-28 13:11:03,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 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:11:03,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18322 states. [2018-11-28 13:11:03,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18322 to 15055. [2018-11-28 13:11:03,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15055 states. [2018-11-28 13:11:03,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15055 states to 15055 states and 48542 transitions. [2018-11-28 13:11:03,577 INFO L78 Accepts]: Start accepts. Automaton has 15055 states and 48542 transitions. Word has length 91 [2018-11-28 13:11:03,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:03,577 INFO L480 AbstractCegarLoop]: Abstraction has 15055 states and 48542 transitions. [2018-11-28 13:11:03,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:11:03,577 INFO L276 IsEmpty]: Start isEmpty. Operand 15055 states and 48542 transitions. [2018-11-28 13:11:03,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 13:11:03,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:03,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:03,593 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:03,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:03,593 INFO L82 PathProgramCache]: Analyzing trace with hash -969986468, now seen corresponding path program 2 times [2018-11-28 13:11:03,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:03,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:03,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:03,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:11:03,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:03,693 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:11:03,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:03,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:11:03,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:11:03,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:11:03,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:11:03,694 INFO L87 Difference]: Start difference. First operand 15055 states and 48542 transitions. Second operand 7 states. [2018-11-28 13:11:04,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:04,017 INFO L93 Difference]: Finished difference Result 27728 states and 89797 transitions. [2018-11-28 13:11:04,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:11:04,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-11-28 13:11:04,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:04,052 INFO L225 Difference]: With dead ends: 27728 [2018-11-28 13:11:04,053 INFO L226 Difference]: Without dead ends: 27728 [2018-11-28 13:11:04,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:11:04,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27728 states. [2018-11-28 13:11:04,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27728 to 17726. [2018-11-28 13:11:04,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17726 states. [2018-11-28 13:11:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17726 states to 17726 states and 57679 transitions. [2018-11-28 13:11:04,466 INFO L78 Accepts]: Start accepts. Automaton has 17726 states and 57679 transitions. Word has length 91 [2018-11-28 13:11:04,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:04,466 INFO L480 AbstractCegarLoop]: Abstraction has 17726 states and 57679 transitions. [2018-11-28 13:11:04,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:11:04,466 INFO L276 IsEmpty]: Start isEmpty. Operand 17726 states and 57679 transitions. [2018-11-28 13:11:04,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 13:11:04,481 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:04,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:04,481 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:04,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:04,482 INFO L82 PathProgramCache]: Analyzing trace with hash -82482787, now seen corresponding path program 1 times [2018-11-28 13:11:04,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:04,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:04,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:04,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:11:04,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:04,563 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:11:04,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:04,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:11:04,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:11:04,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:11:04,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:11:04,564 INFO L87 Difference]: Start difference. First operand 17726 states and 57679 transitions. Second operand 6 states. [2018-11-28 13:11:04,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:04,642 INFO L93 Difference]: Finished difference Result 21545 states and 69164 transitions. [2018-11-28 13:11:04,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:11:04,642 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-11-28 13:11:04,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:04,667 INFO L225 Difference]: With dead ends: 21545 [2018-11-28 13:11:04,667 INFO L226 Difference]: Without dead ends: 21545 [2018-11-28 13:11:04,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:11:04,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21545 states. [2018-11-28 13:11:04,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21545 to 16211. [2018-11-28 13:11:04,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16211 states. [2018-11-28 13:11:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16211 states to 16211 states and 51961 transitions. [2018-11-28 13:11:04,862 INFO L78 Accepts]: Start accepts. Automaton has 16211 states and 51961 transitions. Word has length 91 [2018-11-28 13:11:04,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:04,863 INFO L480 AbstractCegarLoop]: Abstraction has 16211 states and 51961 transitions. [2018-11-28 13:11:04,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:11:04,863 INFO L276 IsEmpty]: Start isEmpty. Operand 16211 states and 51961 transitions. [2018-11-28 13:11:04,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 13:11:04,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:04,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:04,876 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:04,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:04,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1247771485, now seen corresponding path program 1 times [2018-11-28 13:11:04,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:04,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:04,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:04,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:04,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:05,026 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:11:05,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:05,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:11:05,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:11:05,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:11:05,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:11:05,027 INFO L87 Difference]: Start difference. First operand 16211 states and 51961 transitions. Second operand 6 states. [2018-11-28 13:11:05,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:05,212 INFO L93 Difference]: Finished difference Result 15443 states and 48825 transitions. [2018-11-28 13:11:05,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:11:05,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-11-28 13:11:05,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:05,229 INFO L225 Difference]: With dead ends: 15443 [2018-11-28 13:11:05,229 INFO L226 Difference]: Without dead ends: 15443 [2018-11-28 13:11:05,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:11:05,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15443 states. [2018-11-28 13:11:05,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15443 to 12741. [2018-11-28 13:11:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12741 states. [2018-11-28 13:11:05,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12741 states to 12741 states and 40618 transitions. [2018-11-28 13:11:05,373 INFO L78 Accepts]: Start accepts. Automaton has 12741 states and 40618 transitions. Word has length 91 [2018-11-28 13:11:05,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:05,374 INFO L480 AbstractCegarLoop]: Abstraction has 12741 states and 40618 transitions. [2018-11-28 13:11:05,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:11:05,374 INFO L276 IsEmpty]: Start isEmpty. Operand 12741 states and 40618 transitions. [2018-11-28 13:11:05,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 13:11:05,386 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:05,386 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:05,386 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:05,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:05,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1249892320, now seen corresponding path program 1 times [2018-11-28 13:11:05,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:05,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:05,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:05,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:05,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:05,468 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:11:05,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:05,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:11:05,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:11:05,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:11:05,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:11:05,469 INFO L87 Difference]: Start difference. First operand 12741 states and 40618 transitions. Second operand 6 states. [2018-11-28 13:11:05,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:05,803 INFO L93 Difference]: Finished difference Result 16641 states and 52728 transitions. [2018-11-28 13:11:05,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:11:05,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-28 13:11:05,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:05,824 INFO L225 Difference]: With dead ends: 16641 [2018-11-28 13:11:05,824 INFO L226 Difference]: Without dead ends: 16266 [2018-11-28 13:11:05,825 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:11:05,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16266 states. [2018-11-28 13:11:05,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16266 to 15261. [2018-11-28 13:11:05,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15261 states. [2018-11-28 13:11:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15261 states to 15261 states and 48579 transitions. [2018-11-28 13:11:06,007 INFO L78 Accepts]: Start accepts. Automaton has 15261 states and 48579 transitions. Word has length 93 [2018-11-28 13:11:06,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:06,007 INFO L480 AbstractCegarLoop]: Abstraction has 15261 states and 48579 transitions. [2018-11-28 13:11:06,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:11:06,007 INFO L276 IsEmpty]: Start isEmpty. Operand 15261 states and 48579 transitions. [2018-11-28 13:11:06,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 13:11:06,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:06,025 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:06,025 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:06,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:06,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1600692257, now seen corresponding path program 1 times [2018-11-28 13:11:06,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:06,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:06,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:06,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:06,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:06,108 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:11:06,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:06,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:11:06,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:11:06,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:11:06,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:11:06,109 INFO L87 Difference]: Start difference. First operand 15261 states and 48579 transitions. Second operand 6 states. [2018-11-28 13:11:06,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:06,338 INFO L93 Difference]: Finished difference Result 18581 states and 57280 transitions. [2018-11-28 13:11:06,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:11:06,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-28 13:11:06,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:06,362 INFO L225 Difference]: With dead ends: 18581 [2018-11-28 13:11:06,362 INFO L226 Difference]: Without dead ends: 18581 [2018-11-28 13:11:06,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:11:06,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18581 states. [2018-11-28 13:11:06,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18581 to 15531. [2018-11-28 13:11:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15531 states. [2018-11-28 13:11:06,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15531 states to 15531 states and 48385 transitions. [2018-11-28 13:11:06,574 INFO L78 Accepts]: Start accepts. Automaton has 15531 states and 48385 transitions. Word has length 93 [2018-11-28 13:11:06,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:06,575 INFO L480 AbstractCegarLoop]: Abstraction has 15531 states and 48385 transitions. [2018-11-28 13:11:06,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:11:06,575 INFO L276 IsEmpty]: Start isEmpty. Operand 15531 states and 48385 transitions. [2018-11-28 13:11:06,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 13:11:06,593 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:06,593 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:06,593 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:06,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:06,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1732661022, now seen corresponding path program 1 times [2018-11-28 13:11:06,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:06,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:06,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:06,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:06,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:06,668 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:11:06,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:06,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:11:06,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:11:06,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:11:06,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:11:06,669 INFO L87 Difference]: Start difference. First operand 15531 states and 48385 transitions. Second operand 5 states. [2018-11-28 13:11:06,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:06,738 INFO L93 Difference]: Finished difference Result 15531 states and 48321 transitions. [2018-11-28 13:11:06,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:11:06,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-28 13:11:06,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:06,755 INFO L225 Difference]: With dead ends: 15531 [2018-11-28 13:11:06,755 INFO L226 Difference]: Without dead ends: 15531 [2018-11-28 13:11:06,755 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:11:06,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15531 states. [2018-11-28 13:11:06,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15531 to 15531. [2018-11-28 13:11:06,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15531 states. [2018-11-28 13:11:06,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15531 states to 15531 states and 48321 transitions. [2018-11-28 13:11:06,923 INFO L78 Accepts]: Start accepts. Automaton has 15531 states and 48321 transitions. Word has length 93 [2018-11-28 13:11:06,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:06,923 INFO L480 AbstractCegarLoop]: Abstraction has 15531 states and 48321 transitions. [2018-11-28 13:11:06,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:11:06,923 INFO L276 IsEmpty]: Start isEmpty. Operand 15531 states and 48321 transitions. [2018-11-28 13:11:06,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 13:11:06,937 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:06,937 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:06,937 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:06,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:06,937 INFO L82 PathProgramCache]: Analyzing trace with hash -845157341, now seen corresponding path program 1 times [2018-11-28 13:11:06,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:06,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:06,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:06,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:06,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:07,086 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:11:07,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:07,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 13:11:07,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:11:07,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:11:07,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:11:07,088 INFO L87 Difference]: Start difference. First operand 15531 states and 48321 transitions. Second operand 10 states. [2018-11-28 13:11:07,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:07,915 INFO L93 Difference]: Finished difference Result 25784 states and 80022 transitions. [2018-11-28 13:11:07,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 13:11:07,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-11-28 13:11:07,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:07,937 INFO L225 Difference]: With dead ends: 25784 [2018-11-28 13:11:07,937 INFO L226 Difference]: Without dead ends: 18046 [2018-11-28 13:11:07,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-11-28 13:11:07,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18046 states. [2018-11-28 13:11:08,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18046 to 15751. [2018-11-28 13:11:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15751 states. [2018-11-28 13:11:08,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15751 states to 15751 states and 48587 transitions. [2018-11-28 13:11:08,125 INFO L78 Accepts]: Start accepts. Automaton has 15751 states and 48587 transitions. Word has length 93 [2018-11-28 13:11:08,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:08,125 INFO L480 AbstractCegarLoop]: Abstraction has 15751 states and 48587 transitions. [2018-11-28 13:11:08,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:11:08,125 INFO L276 IsEmpty]: Start isEmpty. Operand 15751 states and 48587 transitions. [2018-11-28 13:11:08,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 13:11:08,140 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:08,141 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:08,141 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:08,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:08,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2068881051, now seen corresponding path program 2 times [2018-11-28 13:11:08,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:08,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:08,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:08,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:08,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:08,282 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:11:08,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:08,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 13:11:08,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:11:08,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:11:08,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:11:08,283 INFO L87 Difference]: Start difference. First operand 15751 states and 48587 transitions. Second operand 10 states. [2018-11-28 13:11:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:08,877 INFO L93 Difference]: Finished difference Result 29139 states and 89472 transitions. [2018-11-28 13:11:08,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:11:08,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-11-28 13:11:08,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:08,894 INFO L225 Difference]: With dead ends: 29139 [2018-11-28 13:11:08,894 INFO L226 Difference]: Without dead ends: 13763 [2018-11-28 13:11:08,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-11-28 13:11:08,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13763 states. [2018-11-28 13:11:09,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13763 to 13763. [2018-11-28 13:11:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13763 states. [2018-11-28 13:11:09,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13763 states to 13763 states and 42215 transitions. [2018-11-28 13:11:09,052 INFO L78 Accepts]: Start accepts. Automaton has 13763 states and 42215 transitions. Word has length 93 [2018-11-28 13:11:09,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:09,053 INFO L480 AbstractCegarLoop]: Abstraction has 13763 states and 42215 transitions. [2018-11-28 13:11:09,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:11:09,053 INFO L276 IsEmpty]: Start isEmpty. Operand 13763 states and 42215 transitions. [2018-11-28 13:11:09,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 13:11:09,067 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:09,067 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:09,067 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:09,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:09,067 INFO L82 PathProgramCache]: Analyzing trace with hash 516953587, now seen corresponding path program 3 times [2018-11-28 13:11:09,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:09,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:09,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:09,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:11:09,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:09,157 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:11:09,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:09,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:11:09,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:11:09,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:11:09,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:11:09,158 INFO L87 Difference]: Start difference. First operand 13763 states and 42215 transitions. Second operand 7 states. [2018-11-28 13:11:09,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:09,593 INFO L93 Difference]: Finished difference Result 24004 states and 73599 transitions. [2018-11-28 13:11:09,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:11:09,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-11-28 13:11:09,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:09,606 INFO L225 Difference]: With dead ends: 24004 [2018-11-28 13:11:09,606 INFO L226 Difference]: Without dead ends: 9850 [2018-11-28 13:11:09,606 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:11:09,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9850 states. [2018-11-28 13:11:09,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9850 to 9850. [2018-11-28 13:11:09,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9850 states. [2018-11-28 13:11:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9850 states to 9850 states and 30173 transitions. [2018-11-28 13:11:09,711 INFO L78 Accepts]: Start accepts. Automaton has 9850 states and 30173 transitions. Word has length 93 [2018-11-28 13:11:09,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:09,712 INFO L480 AbstractCegarLoop]: Abstraction has 9850 states and 30173 transitions. [2018-11-28 13:11:09,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:11:09,712 INFO L276 IsEmpty]: Start isEmpty. Operand 9850 states and 30173 transitions. [2018-11-28 13:11:09,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 13:11:09,721 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:09,721 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:09,721 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:09,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:09,722 INFO L82 PathProgramCache]: Analyzing trace with hash 2028411384, now seen corresponding path program 1 times [2018-11-28 13:11:09,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:09,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:09,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:09,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:11:09,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:09,797 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:11:09,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:09,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:11:09,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:11:09,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:11:09,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:11:09,799 INFO L87 Difference]: Start difference. First operand 9850 states and 30173 transitions. Second operand 7 states. [2018-11-28 13:11:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:10,083 INFO L93 Difference]: Finished difference Result 11604 states and 35638 transitions. [2018-11-28 13:11:10,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:11:10,084 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-11-28 13:11:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:10,096 INFO L225 Difference]: With dead ends: 11604 [2018-11-28 13:11:10,096 INFO L226 Difference]: Without dead ends: 11604 [2018-11-28 13:11:10,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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:11:10,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11604 states. [2018-11-28 13:11:10,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11604 to 10168. [2018-11-28 13:11:10,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10168 states. [2018-11-28 13:11:10,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10168 states to 10168 states and 31309 transitions. [2018-11-28 13:11:10,216 INFO L78 Accepts]: Start accepts. Automaton has 10168 states and 31309 transitions. Word has length 93 [2018-11-28 13:11:10,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:10,216 INFO L480 AbstractCegarLoop]: Abstraction has 10168 states and 31309 transitions. [2018-11-28 13:11:10,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:11:10,217 INFO L276 IsEmpty]: Start isEmpty. Operand 10168 states and 31309 transitions. [2018-11-28 13:11:10,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 13:11:10,225 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:10,225 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:10,226 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:10,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:10,226 INFO L82 PathProgramCache]: Analyzing trace with hash -804975913, now seen corresponding path program 4 times [2018-11-28 13:11:10,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:10,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:10,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:10,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:10,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:10,369 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:11:10,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:10,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 13:11:10,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 13:11:10,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 13:11:10,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:11:10,370 INFO L87 Difference]: Start difference. First operand 10168 states and 31309 transitions. Second operand 11 states. [2018-11-28 13:11:11,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:11,108 INFO L93 Difference]: Finished difference Result 16380 states and 50496 transitions. [2018-11-28 13:11:11,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 13:11:11,108 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2018-11-28 13:11:11,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:11,125 INFO L225 Difference]: With dead ends: 16380 [2018-11-28 13:11:11,125 INFO L226 Difference]: Without dead ends: 10854 [2018-11-28 13:11:11,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-11-28 13:11:11,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10854 states. [2018-11-28 13:11:11,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10854 to 10078. [2018-11-28 13:11:11,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10078 states. [2018-11-28 13:11:11,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10078 states to 10078 states and 31061 transitions. [2018-11-28 13:11:11,296 INFO L78 Accepts]: Start accepts. Automaton has 10078 states and 31061 transitions. Word has length 93 [2018-11-28 13:11:11,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:11,296 INFO L480 AbstractCegarLoop]: Abstraction has 10078 states and 31061 transitions. [2018-11-28 13:11:11,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 13:11:11,296 INFO L276 IsEmpty]: Start isEmpty. Operand 10078 states and 31061 transitions. [2018-11-28 13:11:11,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 13:11:11,305 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:11,305 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:11,305 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:11,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:11,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1054598123, now seen corresponding path program 5 times [2018-11-28 13:11:11,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:11,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:11,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:11,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:11:11,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:11:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:11:11,363 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 13:11:11,473 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 13:11:11,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:11:11 BasicIcfg [2018-11-28 13:11:11,474 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:11:11,476 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:11:11,476 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:11:11,476 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:11:11,476 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:09:12" (3/4) ... [2018-11-28 13:11:11,478 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 13:11:11,599 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_32cb0011-f7e6-426a-b414-70669dd5ea99/bin-2019/uautomizer/witness.graphml [2018-11-28 13:11:11,599 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:11:11,600 INFO L168 Benchmark]: Toolchain (without parser) took 119796.38 ms. Allocated memory was 1.0 GB in the beginning and 8.1 GB in the end (delta: 7.1 GB). Free memory was 950.6 MB in the beginning and 6.2 GB in the end (delta: -5.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-11-28 13:11:11,601 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:11:11,602 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-11-28 13:11:11,602 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:11:11,602 INFO L168 Benchmark]: Boogie Preprocessor took 26.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:11:11,602 INFO L168 Benchmark]: RCFGBuilder took 490.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:11:11,603 INFO L168 Benchmark]: TraceAbstraction took 118702.80 ms. Allocated memory was 1.1 GB in the beginning and 8.1 GB in the end (delta: 7.0 GB). Free memory was 1.0 GB in the beginning and 6.3 GB in the end (delta: -5.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-11-28 13:11:11,603 INFO L168 Benchmark]: Witness Printer took 123.81 ms. Allocated memory is still 8.1 GB. Free memory was 6.3 GB in the beginning and 6.2 GB in the end (delta: 64.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. [2018-11-28 13:11:11,604 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 406.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 490.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 118702.80 ms. Allocated memory was 1.1 GB in the beginning and 8.1 GB in the end (delta: 7.0 GB). Free memory was 1.0 GB in the beginning and 6.3 GB in the end (delta: -5.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 123.81 ms. Allocated memory is still 8.1 GB. Free memory was 6.3 GB in the beginning and 6.2 GB in the end (delta: 64.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L676] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L678] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L680] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L692] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L693] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L694] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L695] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L696] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L697] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L698] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L699] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L700] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L701] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L702] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L704] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L705] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L706] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] -1 pthread_t t1006; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] FCALL, FORK -1 pthread_create(&t1006, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] -1 pthread_t t1007; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] FCALL, FORK -1 pthread_create(&t1007, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] -1 pthread_t t1008; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] FCALL, FORK -1 pthread_create(&t1008, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L753] 0 y$w_buff1 = y$w_buff0 [L754] 0 y$w_buff0 = 1 [L755] 0 y$w_buff1_used = y$w_buff0_used [L756] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L758] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L759] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L760] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L761] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L762] 0 y$r_buff0_thd3 = (_Bool)1 [L765] 0 z = 1 [L768] 0 __unbuffered_p2_EAX = z [L771] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 a = 1 [L713] 1 x = 1 [L718] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] 2 x = 2 [L728] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L729] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L730] 2 y$flush_delayed = weak$$choice2 [L731] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L775] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L776] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L776] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L733] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L734] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L735] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L736] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L778] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L781] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L738] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 2 y = y$flush_delayed ? y$mem_tmp : y [L741] 2 y$flush_delayed = (_Bool)0 [L746] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L808] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L811] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L814] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 219 locations, 3 error locations. UNSAFE Result, 118.5s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 34.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6775 SDtfs, 8757 SDslu, 18358 SDs, 0 SdLazy, 6332 SolverSat, 322 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 66 SyntacticMatches, 12 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=273285occurred in iteration=6, 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: 56.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 584007 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2075 NumberOfCodeBlocks, 2075 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1957 ConstructedInterpolants, 0 QuantifiedInterpolants, 407083 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...