./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe034_power.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b6783d9a-620a-47c9-9fcf-363f37fb61bf/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b6783d9a-620a-47c9-9fcf-363f37fb61bf/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b6783d9a-620a-47c9-9fcf-363f37fb61bf/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b6783d9a-620a-47c9-9fcf-363f37fb61bf/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe034_power.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b6783d9a-620a-47c9-9fcf-363f37fb61bf/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b6783d9a-620a-47c9-9fcf-363f37fb61bf/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 966ff3b529f37ce66c3b00d371bdd2a6f0599798 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 11:31:16,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:31:16,781 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:31:16,789 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:31:16,789 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:31:16,790 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:31:16,790 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:31:16,791 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:31:16,793 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:31:16,793 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:31:16,794 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:31:16,794 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:31:16,795 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:31:16,795 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:31:16,796 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:31:16,796 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:31:16,797 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:31:16,799 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:31:16,800 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:31:16,801 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:31:16,802 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:31:16,803 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:31:16,805 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:31:16,805 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:31:16,805 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:31:16,806 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:31:16,806 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:31:16,807 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:31:16,808 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:31:16,808 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:31:16,809 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:31:16,810 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:31:16,810 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:31:16,810 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:31:16,811 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:31:16,811 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:31:16,811 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b6783d9a-620a-47c9-9fcf-363f37fb61bf/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 11:31:16,821 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:31:16,821 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:31:16,822 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:31:16,822 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:31:16,823 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:31:16,823 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:31:16,823 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:31:16,823 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:31:16,823 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:31:16,823 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:31:16,823 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:31:16,824 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:31:16,824 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 11:31:16,824 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:31:16,824 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 11:31:16,824 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:31:16,824 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:31:16,824 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:31:16,825 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 11:31:16,825 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:31:16,825 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:31:16,825 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:31:16,825 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:31:16,825 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:31:16,825 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:31:16,825 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:31:16,826 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 11:31:16,826 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:31:16,826 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:31:16,826 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 11:31:16,826 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_b6783d9a-620a-47c9-9fcf-363f37fb61bf/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 -> 966ff3b529f37ce66c3b00d371bdd2a6f0599798 [2018-11-28 11:31:16,848 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:31:16,856 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:31:16,858 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:31:16,859 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:31:16,859 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:31:16,860 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b6783d9a-620a-47c9-9fcf-363f37fb61bf/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe034_power.oepc_false-unreach-call.i [2018-11-28 11:31:16,896 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b6783d9a-620a-47c9-9fcf-363f37fb61bf/bin-2019/uautomizer/data/2b8bd750c/26e9368dfc7542a0ae7b6702984d8123/FLAG58be0e0f6 [2018-11-28 11:31:17,290 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:31:17,291 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b6783d9a-620a-47c9-9fcf-363f37fb61bf/sv-benchmarks/c/pthread-wmm/safe034_power.oepc_false-unreach-call.i [2018-11-28 11:31:17,305 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b6783d9a-620a-47c9-9fcf-363f37fb61bf/bin-2019/uautomizer/data/2b8bd750c/26e9368dfc7542a0ae7b6702984d8123/FLAG58be0e0f6 [2018-11-28 11:31:17,658 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b6783d9a-620a-47c9-9fcf-363f37fb61bf/bin-2019/uautomizer/data/2b8bd750c/26e9368dfc7542a0ae7b6702984d8123 [2018-11-28 11:31:17,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:31:17,660 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:31:17,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:31:17,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:31:17,664 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:31:17,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:31:17" (1/1) ... [2018-11-28 11:31:17,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d1437d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:31:17, skipping insertion in model container [2018-11-28 11:31:17,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:31:17" (1/1) ... [2018-11-28 11:31:17,671 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:31:17,696 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:31:17,919 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:31:17,929 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:31:18,031 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:31:18,068 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:31:18,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:31:18 WrapperNode [2018-11-28 11:31:18,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:31:18,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:31:18,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:31:18,069 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:31:18,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:31:18" (1/1) ... [2018-11-28 11:31:18,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:31:18" (1/1) ... [2018-11-28 11:31:18,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:31:18,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:31:18,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:31:18,112 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:31:18,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:31:18" (1/1) ... [2018-11-28 11:31:18,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:31:18" (1/1) ... [2018-11-28 11:31:18,123 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:31:18" (1/1) ... [2018-11-28 11:31:18,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:31:18" (1/1) ... [2018-11-28 11:31:18,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:31:18" (1/1) ... [2018-11-28 11:31:18,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:31:18" (1/1) ... [2018-11-28 11:31:18,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:31:18" (1/1) ... [2018-11-28 11:31:18,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:31:18,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:31:18,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:31:18,138 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:31:18,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:31:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6783d9a-620a-47c9-9fcf-363f37fb61bf/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 11:31:18,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:31:18,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:31:18,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 11:31:18,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:31:18,174 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 11:31:18,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 11:31:18,174 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 11:31:18,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 11:31:18,174 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-11-28 11:31:18,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-11-28 11:31:18,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 11:31:18,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:31:18,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:31:18,175 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 11:31:18,563 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:31:18,564 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 11:31:18,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:31:18 BoogieIcfgContainer [2018-11-28 11:31:18,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:31:18,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:31:18,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:31:18,566 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:31:18,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:31:17" (1/3) ... [2018-11-28 11:31:18,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f28829a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:31:18, skipping insertion in model container [2018-11-28 11:31:18,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:31:18" (2/3) ... [2018-11-28 11:31:18,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f28829a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:31:18, skipping insertion in model container [2018-11-28 11:31:18,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:31:18" (3/3) ... [2018-11-28 11:31:18,569 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc_false-unreach-call.i [2018-11-28 11:31:18,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,596 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,596 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,597 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,597 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,598 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,598 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,598 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,599 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,602 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,602 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,602 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,602 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,602 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,602 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,605 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,605 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,605 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,605 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,605 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,605 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,613 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,613 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,613 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,614 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,614 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,614 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,614 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,614 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,614 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,614 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,615 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,615 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,615 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,615 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,615 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,615 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,616 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,616 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,616 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,616 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,616 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,616 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,616 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,617 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,617 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,617 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,617 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,617 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,617 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,617 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,618 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,618 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,618 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,618 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,618 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,618 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,618 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,618 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,619 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 11:31:18,631 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 11:31:18,631 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:31:18,636 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 11:31:18,646 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 11:31:18,661 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:31:18,661 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:31:18,662 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 11:31:18,662 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:31:18,662 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:31:18,662 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:31:18,662 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:31:18,662 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:31:18,662 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:31:18,672 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 144places, 175 transitions [2018-11-28 11:31:40,492 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149043 states. [2018-11-28 11:31:40,494 INFO L276 IsEmpty]: Start isEmpty. Operand 149043 states. [2018-11-28 11:31:40,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 11:31:40,504 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:31:40,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:31:40,506 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:31:40,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:31:40,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1284724798, now seen corresponding path program 1 times [2018-11-28 11:31:40,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:31:40,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:31:40,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:31:40,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:31:40,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:31:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:31:40,695 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 11:31:40,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:31:40,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:31:40,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:31:40,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:31:40,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:31:40,709 INFO L87 Difference]: Start difference. First operand 149043 states. Second operand 4 states. [2018-11-28 11:31:42,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:31:42,669 INFO L93 Difference]: Finished difference Result 257063 states and 1188602 transitions. [2018-11-28 11:31:42,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:31:42,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-28 11:31:42,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:31:43,290 INFO L225 Difference]: With dead ends: 257063 [2018-11-28 11:31:43,291 INFO L226 Difference]: Without dead ends: 174813 [2018-11-28 11:31:43,292 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 11:31:44,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174813 states. [2018-11-28 11:31:49,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174813 to 110553. [2018-11-28 11:31:49,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110553 states. [2018-11-28 11:31:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110553 states to 110553 states and 511484 transitions. [2018-11-28 11:31:50,078 INFO L78 Accepts]: Start accepts. Automaton has 110553 states and 511484 transitions. Word has length 44 [2018-11-28 11:31:50,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:31:50,079 INFO L480 AbstractCegarLoop]: Abstraction has 110553 states and 511484 transitions. [2018-11-28 11:31:50,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:31:50,080 INFO L276 IsEmpty]: Start isEmpty. Operand 110553 states and 511484 transitions. [2018-11-28 11:31:50,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 11:31:50,093 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:31:50,094 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] [2018-11-28 11:31:50,094 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:31:50,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:31:50,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1885719038, now seen corresponding path program 1 times [2018-11-28 11:31:50,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:31:50,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:31:50,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:31:50,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:31:50,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:31:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:31:50,171 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 11:31:50,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:31:50,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:31:50,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:31:50,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:31:50,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:31:50,173 INFO L87 Difference]: Start difference. First operand 110553 states and 511484 transitions. Second operand 5 states. [2018-11-28 11:31:52,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:31:52,434 INFO L93 Difference]: Finished difference Result 240603 states and 1068739 transitions. [2018-11-28 11:31:52,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:31:52,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-28 11:31:52,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:31:53,088 INFO L225 Difference]: With dead ends: 240603 [2018-11-28 11:31:53,088 INFO L226 Difference]: Without dead ends: 237053 [2018-11-28 11:31:53,089 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 11:31:54,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237053 states. [2018-11-28 11:32:00,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237053 to 160433. [2018-11-28 11:32:00,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160433 states. [2018-11-28 11:32:00,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160433 states to 160433 states and 716928 transitions. [2018-11-28 11:32:00,498 INFO L78 Accepts]: Start accepts. Automaton has 160433 states and 716928 transitions. Word has length 52 [2018-11-28 11:32:00,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:32:00,498 INFO L480 AbstractCegarLoop]: Abstraction has 160433 states and 716928 transitions. [2018-11-28 11:32:00,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:32:00,499 INFO L276 IsEmpty]: Start isEmpty. Operand 160433 states and 716928 transitions. [2018-11-28 11:32:00,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 11:32:00,510 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:32:00,510 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] [2018-11-28 11:32:00,510 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:32:00,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:32:00,511 INFO L82 PathProgramCache]: Analyzing trace with hash -369709651, now seen corresponding path program 1 times [2018-11-28 11:32:00,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:32:00,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:32:00,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:00,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:32:00,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:32:00,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 11:32:00,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:32:00,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:32:00,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:32:00,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:32:00,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:32:00,583 INFO L87 Difference]: Start difference. First operand 160433 states and 716928 transitions. Second operand 5 states. [2018-11-28 11:32:02,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:32:02,834 INFO L93 Difference]: Finished difference Result 317173 states and 1405285 transitions. [2018-11-28 11:32:02,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:32:02,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-28 11:32:02,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:32:03,817 INFO L225 Difference]: With dead ends: 317173 [2018-11-28 11:32:03,817 INFO L226 Difference]: Without dead ends: 314273 [2018-11-28 11:32:03,818 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 11:32:05,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314273 states. [2018-11-28 11:32:08,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314273 to 178273. [2018-11-28 11:32:08,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178273 states. [2018-11-28 11:32:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178273 states to 178273 states and 791490 transitions. [2018-11-28 11:32:09,003 INFO L78 Accepts]: Start accepts. Automaton has 178273 states and 791490 transitions. Word has length 53 [2018-11-28 11:32:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:32:09,004 INFO L480 AbstractCegarLoop]: Abstraction has 178273 states and 791490 transitions. [2018-11-28 11:32:09,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:32:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand 178273 states and 791490 transitions. [2018-11-28 11:32:09,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 11:32:09,020 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:32:09,020 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 11:32:09,020 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:32:09,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:32:09,020 INFO L82 PathProgramCache]: Analyzing trace with hash 2073884627, now seen corresponding path program 1 times [2018-11-28 11:32:09,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:32:09,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:32:09,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:09,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:32:09,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:32:09,066 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 11:32:09,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:32:09,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:32:09,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:32:09,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:32:09,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:32:09,067 INFO L87 Difference]: Start difference. First operand 178273 states and 791490 transitions. Second operand 3 states. [2018-11-28 11:32:13,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:32:13,337 INFO L93 Difference]: Finished difference Result 231653 states and 1011274 transitions. [2018-11-28 11:32:13,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:32:13,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-11-28 11:32:13,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:32:13,908 INFO L225 Difference]: With dead ends: 231653 [2018-11-28 11:32:13,908 INFO L226 Difference]: Without dead ends: 231653 [2018-11-28 11:32:13,908 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 11:32:15,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231653 states. [2018-11-28 11:32:17,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231653 to 202938. [2018-11-28 11:32:17,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202938 states. [2018-11-28 11:32:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202938 states to 202938 states and 893562 transitions. [2018-11-28 11:32:18,959 INFO L78 Accepts]: Start accepts. Automaton has 202938 states and 893562 transitions. Word has length 55 [2018-11-28 11:32:18,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:32:18,959 INFO L480 AbstractCegarLoop]: Abstraction has 202938 states and 893562 transitions. [2018-11-28 11:32:18,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:32:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 202938 states and 893562 transitions. [2018-11-28 11:32:18,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 11:32:18,991 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:32:18,992 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] [2018-11-28 11:32:18,992 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:32:18,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:32:18,992 INFO L82 PathProgramCache]: Analyzing trace with hash -43565154, now seen corresponding path program 1 times [2018-11-28 11:32:18,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:32:18,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:32:18,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:18,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:32:18,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:32:19,068 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 11:32:19,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:32:19,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:32:19,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:32:19,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:32:19,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:32:19,069 INFO L87 Difference]: Start difference. First operand 202938 states and 893562 transitions. Second operand 6 states. [2018-11-28 11:32:20,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:32:20,953 INFO L93 Difference]: Finished difference Result 356173 states and 1552270 transitions. [2018-11-28 11:32:20,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 11:32:20,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-11-28 11:32:20,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:32:22,821 INFO L225 Difference]: With dead ends: 356173 [2018-11-28 11:32:22,821 INFO L226 Difference]: Without dead ends: 352823 [2018-11-28 11:32:22,821 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 11:32:24,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352823 states. [2018-11-28 11:32:32,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352823 to 205743. [2018-11-28 11:32:32,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205743 states. [2018-11-28 11:32:33,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205743 states to 205743 states and 906781 transitions. [2018-11-28 11:32:33,700 INFO L78 Accepts]: Start accepts. Automaton has 205743 states and 906781 transitions. Word has length 59 [2018-11-28 11:32:33,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:32:33,700 INFO L480 AbstractCegarLoop]: Abstraction has 205743 states and 906781 transitions. [2018-11-28 11:32:33,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:32:33,700 INFO L276 IsEmpty]: Start isEmpty. Operand 205743 states and 906781 transitions. [2018-11-28 11:32:33,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 11:32:33,733 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:32:33,733 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] [2018-11-28 11:32:33,733 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:32:33,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:32:33,733 INFO L82 PathProgramCache]: Analyzing trace with hash 396603386, now seen corresponding path program 1 times [2018-11-28 11:32:33,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:32:33,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:32:33,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:33,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:32:33,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:32:33,775 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 11:32:33,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:32:33,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:32:33,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:32:33,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:32:33,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:32:33,776 INFO L87 Difference]: Start difference. First operand 205743 states and 906781 transitions. Second operand 3 states. [2018-11-28 11:32:34,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:32:34,914 INFO L93 Difference]: Finished difference Result 227888 states and 1004312 transitions. [2018-11-28 11:32:34,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:32:34,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-11-28 11:32:34,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:32:35,534 INFO L225 Difference]: With dead ends: 227888 [2018-11-28 11:32:35,534 INFO L226 Difference]: Without dead ends: 227888 [2018-11-28 11:32:35,534 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 11:32:37,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227888 states. [2018-11-28 11:32:40,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227888 to 216543. [2018-11-28 11:32:40,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216543 states. [2018-11-28 11:32:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216543 states to 216543 states and 954421 transitions. [2018-11-28 11:32:40,861 INFO L78 Accepts]: Start accepts. Automaton has 216543 states and 954421 transitions. Word has length 59 [2018-11-28 11:32:40,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:32:40,861 INFO L480 AbstractCegarLoop]: Abstraction has 216543 states and 954421 transitions. [2018-11-28 11:32:40,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:32:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 216543 states and 954421 transitions. [2018-11-28 11:32:40,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 11:32:40,892 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:32:40,892 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] [2018-11-28 11:32:40,892 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:32:40,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:32:40,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1117448070, now seen corresponding path program 1 times [2018-11-28 11:32:40,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:32:40,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:32:40,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:40,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:32:40,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:32:40,980 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 11:32:40,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:32:40,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:32:40,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:32:40,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:32:40,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:32:40,981 INFO L87 Difference]: Start difference. First operand 216543 states and 954421 transitions. Second operand 6 states. [2018-11-28 11:32:43,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:32:43,294 INFO L93 Difference]: Finished difference Result 292218 states and 1274191 transitions. [2018-11-28 11:32:43,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:32:43,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-11-28 11:32:43,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:32:49,608 INFO L225 Difference]: With dead ends: 292218 [2018-11-28 11:32:49,608 INFO L226 Difference]: Without dead ends: 286523 [2018-11-28 11:32:49,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:32:50,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286523 states. [2018-11-28 11:32:54,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286523 to 261028. [2018-11-28 11:32:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261028 states. [2018-11-28 11:32:55,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261028 states to 261028 states and 1142704 transitions. [2018-11-28 11:32:55,095 INFO L78 Accepts]: Start accepts. Automaton has 261028 states and 1142704 transitions. Word has length 59 [2018-11-28 11:32:55,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:32:55,096 INFO L480 AbstractCegarLoop]: Abstraction has 261028 states and 1142704 transitions. [2018-11-28 11:32:55,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:32:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand 261028 states and 1142704 transitions. [2018-11-28 11:32:55,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 11:32:55,133 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:32:55,134 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] [2018-11-28 11:32:55,134 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:32:55,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:32:55,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1380567867, now seen corresponding path program 1 times [2018-11-28 11:32:55,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:32:55,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:32:55,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:55,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:32:55,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:32:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:32:55,237 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 11:32:55,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:32:55,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:32:55,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:32:55,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:32:55,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:32:55,238 INFO L87 Difference]: Start difference. First operand 261028 states and 1142704 transitions. Second operand 7 states. [2018-11-28 11:32:57,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:32:57,992 INFO L93 Difference]: Finished difference Result 379443 states and 1607921 transitions. [2018-11-28 11:32:57,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 11:32:57,993 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-11-28 11:32:57,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:32:59,751 INFO L225 Difference]: With dead ends: 379443 [2018-11-28 11:32:59,751 INFO L226 Difference]: Without dead ends: 379443 [2018-11-28 11:32:59,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:33:01,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379443 states. [2018-11-28 11:33:05,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379443 to 308618. [2018-11-28 11:33:05,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308618 states. [2018-11-28 11:33:06,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308618 states to 308618 states and 1326661 transitions. [2018-11-28 11:33:06,996 INFO L78 Accepts]: Start accepts. Automaton has 308618 states and 1326661 transitions. Word has length 59 [2018-11-28 11:33:06,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:33:06,996 INFO L480 AbstractCegarLoop]: Abstraction has 308618 states and 1326661 transitions. [2018-11-28 11:33:06,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:33:06,996 INFO L276 IsEmpty]: Start isEmpty. Operand 308618 states and 1326661 transitions. [2018-11-28 11:33:07,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 11:33:07,043 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:33:07,043 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] [2018-11-28 11:33:07,044 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:33:07,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:07,044 INFO L82 PathProgramCache]: Analyzing trace with hash -2026895748, now seen corresponding path program 1 times [2018-11-28 11:33:07,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:07,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:07,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:07,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:07,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:07,090 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 11:33:07,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:33:07,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:33:07,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:33:07,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:33:07,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:33:07,091 INFO L87 Difference]: Start difference. First operand 308618 states and 1326661 transitions. Second operand 4 states. [2018-11-28 11:33:13,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:13,406 INFO L93 Difference]: Finished difference Result 267151 states and 1127019 transitions. [2018-11-28 11:33:13,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:33:13,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-11-28 11:33:13,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:33:14,061 INFO L225 Difference]: With dead ends: 267151 [2018-11-28 11:33:14,061 INFO L226 Difference]: Without dead ends: 259066 [2018-11-28 11:33:14,061 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 11:33:15,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259066 states. [2018-11-28 11:33:18,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259066 to 259066. [2018-11-28 11:33:18,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259066 states. [2018-11-28 11:33:19,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259066 states to 259066 states and 1099297 transitions. [2018-11-28 11:33:19,041 INFO L78 Accepts]: Start accepts. Automaton has 259066 states and 1099297 transitions. Word has length 59 [2018-11-28 11:33:19,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:33:19,041 INFO L480 AbstractCegarLoop]: Abstraction has 259066 states and 1099297 transitions. [2018-11-28 11:33:19,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:33:19,041 INFO L276 IsEmpty]: Start isEmpty. Operand 259066 states and 1099297 transitions. [2018-11-28 11:33:19,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 11:33:19,078 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:33:19,078 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] [2018-11-28 11:33:19,078 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:33:19,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:19,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1169735306, now seen corresponding path program 1 times [2018-11-28 11:33:19,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:19,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:19,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:19,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:19,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:19,135 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 11:33:19,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:33:19,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:33:19,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:33:19,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:33:19,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:33:19,136 INFO L87 Difference]: Start difference. First operand 259066 states and 1099297 transitions. Second operand 5 states. [2018-11-28 11:33:20,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:20,054 INFO L93 Difference]: Finished difference Result 57898 states and 224521 transitions. [2018-11-28 11:33:20,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:33:20,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-11-28 11:33:20,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:33:20,159 INFO L225 Difference]: With dead ends: 57898 [2018-11-28 11:33:20,159 INFO L226 Difference]: Without dead ends: 50982 [2018-11-28 11:33:20,160 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 11:33:20,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50982 states. [2018-11-28 11:33:20,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50982 to 50742. [2018-11-28 11:33:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50742 states. [2018-11-28 11:33:20,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50742 states to 50742 states and 196308 transitions. [2018-11-28 11:33:20,825 INFO L78 Accepts]: Start accepts. Automaton has 50742 states and 196308 transitions. Word has length 60 [2018-11-28 11:33:20,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:33:20,826 INFO L480 AbstractCegarLoop]: Abstraction has 50742 states and 196308 transitions. [2018-11-28 11:33:20,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:33:20,826 INFO L276 IsEmpty]: Start isEmpty. Operand 50742 states and 196308 transitions. [2018-11-28 11:33:20,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 11:33:20,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:33:20,841 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] [2018-11-28 11:33:20,841 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:33:20,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:20,841 INFO L82 PathProgramCache]: Analyzing trace with hash -779552109, now seen corresponding path program 1 times [2018-11-28 11:33:20,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:20,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:20,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:20,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:20,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:20,899 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 11:33:20,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:33:20,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:33:20,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:33:20,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:33:20,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:33:20,900 INFO L87 Difference]: Start difference. First operand 50742 states and 196308 transitions. Second operand 4 states. [2018-11-28 11:33:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:21,182 INFO L93 Difference]: Finished difference Result 59861 states and 230927 transitions. [2018-11-28 11:33:21,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:33:21,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2018-11-28 11:33:21,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:33:21,288 INFO L225 Difference]: With dead ends: 59861 [2018-11-28 11:33:21,288 INFO L226 Difference]: Without dead ends: 59861 [2018-11-28 11:33:21,288 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 11:33:21,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59861 states. [2018-11-28 11:33:22,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59861 to 53957. [2018-11-28 11:33:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53957 states. [2018-11-28 11:33:22,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53957 states to 53957 states and 208375 transitions. [2018-11-28 11:33:22,627 INFO L78 Accepts]: Start accepts. Automaton has 53957 states and 208375 transitions. Word has length 70 [2018-11-28 11:33:22,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:33:22,627 INFO L480 AbstractCegarLoop]: Abstraction has 53957 states and 208375 transitions. [2018-11-28 11:33:22,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:33:22,627 INFO L276 IsEmpty]: Start isEmpty. Operand 53957 states and 208375 transitions. [2018-11-28 11:33:22,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 11:33:22,644 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:33:22,644 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] [2018-11-28 11:33:22,644 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:33:22,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:22,644 INFO L82 PathProgramCache]: Analyzing trace with hash 963258226, now seen corresponding path program 1 times [2018-11-28 11:33:22,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:22,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:22,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:22,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:22,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:22,717 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 11:33:22,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:33:22,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:33:22,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:33:22,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:33:22,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:33:22,717 INFO L87 Difference]: Start difference. First operand 53957 states and 208375 transitions. Second operand 6 states. [2018-11-28 11:33:22,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:22,786 INFO L93 Difference]: Finished difference Result 14405 states and 48007 transitions. [2018-11-28 11:33:22,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:33:22,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-11-28 11:33:22,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:33:22,801 INFO L225 Difference]: With dead ends: 14405 [2018-11-28 11:33:22,801 INFO L226 Difference]: Without dead ends: 12149 [2018-11-28 11:33:22,801 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 11:33:22,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12149 states. [2018-11-28 11:33:22,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12149 to 11559. [2018-11-28 11:33:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11559 states. [2018-11-28 11:33:22,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11559 states to 11559 states and 37959 transitions. [2018-11-28 11:33:22,916 INFO L78 Accepts]: Start accepts. Automaton has 11559 states and 37959 transitions. Word has length 70 [2018-11-28 11:33:22,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:33:22,916 INFO L480 AbstractCegarLoop]: Abstraction has 11559 states and 37959 transitions. [2018-11-28 11:33:22,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:33:22,916 INFO L276 IsEmpty]: Start isEmpty. Operand 11559 states and 37959 transitions. [2018-11-28 11:33:22,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-28 11:33:22,925 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:33:22,926 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] [2018-11-28 11:33:22,926 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:33:22,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:22,926 INFO L82 PathProgramCache]: Analyzing trace with hash 571080501, now seen corresponding path program 1 times [2018-11-28 11:33:22,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:22,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:22,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:22,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:22,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:22,996 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 11:33:22,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:33:22,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:33:22,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:33:22,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:33:22,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:33:22,997 INFO L87 Difference]: Start difference. First operand 11559 states and 37959 transitions. Second operand 4 states. [2018-11-28 11:33:23,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:23,127 INFO L93 Difference]: Finished difference Result 16004 states and 51605 transitions. [2018-11-28 11:33:23,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:33:23,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-11-28 11:33:23,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:33:23,145 INFO L225 Difference]: With dead ends: 16004 [2018-11-28 11:33:23,145 INFO L226 Difference]: Without dead ends: 16004 [2018-11-28 11:33:23,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:33:23,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16004 states. [2018-11-28 11:33:23,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16004 to 14021. [2018-11-28 11:33:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14021 states. [2018-11-28 11:33:23,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14021 states to 14021 states and 45458 transitions. [2018-11-28 11:33:23,292 INFO L78 Accepts]: Start accepts. Automaton has 14021 states and 45458 transitions. Word has length 89 [2018-11-28 11:33:23,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:33:23,292 INFO L480 AbstractCegarLoop]: Abstraction has 14021 states and 45458 transitions. [2018-11-28 11:33:23,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:33:23,293 INFO L276 IsEmpty]: Start isEmpty. Operand 14021 states and 45458 transitions. [2018-11-28 11:33:23,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-28 11:33:23,305 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:33:23,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] [2018-11-28 11:33:23,305 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:33:23,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:23,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1506128842, now seen corresponding path program 1 times [2018-11-28 11:33:23,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:23,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:23,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:23,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:23,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:23,395 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 11:33:23,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:33:23,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:33:23,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:33:23,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:33:23,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:33:23,396 INFO L87 Difference]: Start difference. First operand 14021 states and 45458 transitions. Second operand 6 states. [2018-11-28 11:33:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:23,645 INFO L93 Difference]: Finished difference Result 20726 states and 66747 transitions. [2018-11-28 11:33:23,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:33:23,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-11-28 11:33:23,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:33:23,668 INFO L225 Difference]: With dead ends: 20726 [2018-11-28 11:33:23,668 INFO L226 Difference]: Without dead ends: 20598 [2018-11-28 11:33:23,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:33:23,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20598 states. [2018-11-28 11:33:23,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20598 to 17591. [2018-11-28 11:33:23,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17591 states. [2018-11-28 11:33:23,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17591 states to 17591 states and 56905 transitions. [2018-11-28 11:33:23,881 INFO L78 Accepts]: Start accepts. Automaton has 17591 states and 56905 transitions. Word has length 89 [2018-11-28 11:33:23,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:33:23,881 INFO L480 AbstractCegarLoop]: Abstraction has 17591 states and 56905 transitions. [2018-11-28 11:33:23,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:33:23,882 INFO L276 IsEmpty]: Start isEmpty. Operand 17591 states and 56905 transitions. [2018-11-28 11:33:23,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-28 11:33:23,898 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:33:23,898 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] [2018-11-28 11:33:23,898 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:33:23,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:23,898 INFO L82 PathProgramCache]: Analyzing trace with hash 991887095, now seen corresponding path program 1 times [2018-11-28 11:33:23,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:23,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:23,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:23,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:23,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:23,994 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 11:33:23,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:33:23,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:33:23,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:33:23,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:33:23,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:33:23,995 INFO L87 Difference]: Start difference. First operand 17591 states and 56905 transitions. Second operand 7 states. [2018-11-28 11:33:24,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:24,360 INFO L93 Difference]: Finished difference Result 33210 states and 107799 transitions. [2018-11-28 11:33:24,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:33:24,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-11-28 11:33:24,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:33:24,398 INFO L225 Difference]: With dead ends: 33210 [2018-11-28 11:33:24,398 INFO L226 Difference]: Without dead ends: 33210 [2018-11-28 11:33:24,399 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 11:33:24,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33210 states. [2018-11-28 11:33:24,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33210 to 21509. [2018-11-28 11:33:24,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21509 states. [2018-11-28 11:33:24,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21509 states to 21509 states and 70038 transitions. [2018-11-28 11:33:24,730 INFO L78 Accepts]: Start accepts. Automaton has 21509 states and 70038 transitions. Word has length 89 [2018-11-28 11:33:24,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:33:24,730 INFO L480 AbstractCegarLoop]: Abstraction has 21509 states and 70038 transitions. [2018-11-28 11:33:24,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:33:24,730 INFO L276 IsEmpty]: Start isEmpty. Operand 21509 states and 70038 transitions. [2018-11-28 11:33:24,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-28 11:33:24,750 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:33:24,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:33:24,750 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:33:24,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:24,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1879390776, now seen corresponding path program 1 times [2018-11-28 11:33:24,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:24,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:24,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:24,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:24,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:24,873 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 11:33:24,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:33:24,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:33:24,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:33:24,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:33:24,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:33:24,874 INFO L87 Difference]: Start difference. First operand 21509 states and 70038 transitions. Second operand 6 states. [2018-11-28 11:33:25,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:25,172 INFO L93 Difference]: Finished difference Result 23057 states and 74259 transitions. [2018-11-28 11:33:25,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:33:25,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-11-28 11:33:25,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:33:25,200 INFO L225 Difference]: With dead ends: 23057 [2018-11-28 11:33:25,200 INFO L226 Difference]: Without dead ends: 23057 [2018-11-28 11:33:25,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:33:25,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23057 states. [2018-11-28 11:33:25,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23057 to 18925. [2018-11-28 11:33:25,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18925 states. [2018-11-28 11:33:25,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18925 states to 18925 states and 60694 transitions. [2018-11-28 11:33:25,425 INFO L78 Accepts]: Start accepts. Automaton has 18925 states and 60694 transitions. Word has length 89 [2018-11-28 11:33:25,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:33:25,426 INFO L480 AbstractCegarLoop]: Abstraction has 18925 states and 60694 transitions. [2018-11-28 11:33:25,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:33:25,426 INFO L276 IsEmpty]: Start isEmpty. Operand 18925 states and 60694 transitions. [2018-11-28 11:33:25,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-28 11:33:25,445 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:33:25,446 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] [2018-11-28 11:33:25,446 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:33:25,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:25,446 INFO L82 PathProgramCache]: Analyzing trace with hash 684417056, now seen corresponding path program 1 times [2018-11-28 11:33:25,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:25,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:25,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:25,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:25,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:25,536 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 11:33:25,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:33:25,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:33:25,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:33:25,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:33:25,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:33:25,537 INFO L87 Difference]: Start difference. First operand 18925 states and 60694 transitions. Second operand 6 states. [2018-11-28 11:33:25,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:25,863 INFO L93 Difference]: Finished difference Result 22410 states and 70967 transitions. [2018-11-28 11:33:25,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:33:25,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-11-28 11:33:25,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:33:25,888 INFO L225 Difference]: With dead ends: 22410 [2018-11-28 11:33:25,888 INFO L226 Difference]: Without dead ends: 21890 [2018-11-28 11:33:25,889 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 11:33:25,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21890 states. [2018-11-28 11:33:26,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21890 to 20605. [2018-11-28 11:33:26,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20605 states. [2018-11-28 11:33:26,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20605 states to 20605 states and 65838 transitions. [2018-11-28 11:33:26,096 INFO L78 Accepts]: Start accepts. Automaton has 20605 states and 65838 transitions. Word has length 89 [2018-11-28 11:33:26,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:33:26,096 INFO L480 AbstractCegarLoop]: Abstraction has 20605 states and 65838 transitions. [2018-11-28 11:33:26,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:33:26,096 INFO L276 IsEmpty]: Start isEmpty. Operand 20605 states and 65838 transitions. [2018-11-28 11:33:26,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-28 11:33:26,115 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:33:26,115 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] [2018-11-28 11:33:26,115 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:33:26,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:26,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1269682249, now seen corresponding path program 2 times [2018-11-28 11:33:26,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:26,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:26,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:26,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:26,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:26,193 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 11:33:26,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:33:26,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:33:26,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:33:26,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:33:26,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:33:26,196 INFO L87 Difference]: Start difference. First operand 20605 states and 65838 transitions. Second operand 7 states. [2018-11-28 11:33:26,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:26,491 INFO L93 Difference]: Finished difference Result 23378 states and 74622 transitions. [2018-11-28 11:33:26,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:33:26,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-11-28 11:33:26,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:33:26,517 INFO L225 Difference]: With dead ends: 23378 [2018-11-28 11:33:26,517 INFO L226 Difference]: Without dead ends: 23378 [2018-11-28 11:33:26,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:33:26,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23378 states. [2018-11-28 11:33:26,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23378 to 20780. [2018-11-28 11:33:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20780 states. [2018-11-28 11:33:26,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20780 states to 20780 states and 66558 transitions. [2018-11-28 11:33:26,734 INFO L78 Accepts]: Start accepts. Automaton has 20780 states and 66558 transitions. Word has length 89 [2018-11-28 11:33:26,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:33:26,734 INFO L480 AbstractCegarLoop]: Abstraction has 20780 states and 66558 transitions. [2018-11-28 11:33:26,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:33:26,735 INFO L276 IsEmpty]: Start isEmpty. Operand 20780 states and 66558 transitions. [2018-11-28 11:33:26,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-28 11:33:26,753 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:33:26,753 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] [2018-11-28 11:33:26,753 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:33:26,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:26,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1325686785, now seen corresponding path program 1 times [2018-11-28 11:33:26,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:26,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:26,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:26,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:33:26,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:26,894 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 11:33:26,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:33:26,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:33:26,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:33:26,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:33:26,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:33:26,895 INFO L87 Difference]: Start difference. First operand 20780 states and 66558 transitions. Second operand 6 states. [2018-11-28 11:33:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:27,094 INFO L93 Difference]: Finished difference Result 22800 states and 71524 transitions. [2018-11-28 11:33:27,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:33:27,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-11-28 11:33:27,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:33:27,120 INFO L225 Difference]: With dead ends: 22800 [2018-11-28 11:33:27,120 INFO L226 Difference]: Without dead ends: 22800 [2018-11-28 11:33:27,120 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 11:33:27,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22800 states. [2018-11-28 11:33:27,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22800 to 21185. [2018-11-28 11:33:27,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21185 states. [2018-11-28 11:33:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21185 states to 21185 states and 66772 transitions. [2018-11-28 11:33:27,342 INFO L78 Accepts]: Start accepts. Automaton has 21185 states and 66772 transitions. Word has length 89 [2018-11-28 11:33:27,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:33:27,342 INFO L480 AbstractCegarLoop]: Abstraction has 21185 states and 66772 transitions. [2018-11-28 11:33:27,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:33:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 21185 states and 66772 transitions. [2018-11-28 11:33:27,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-28 11:33:27,361 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:33:27,362 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] [2018-11-28 11:33:27,362 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:33:27,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:27,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1580423330, now seen corresponding path program 1 times [2018-11-28 11:33:27,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:27,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:27,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:27,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:27,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:33:27,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:33:27,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:33:27,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:33:27,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:33:27,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:33:27,445 INFO L87 Difference]: Start difference. First operand 21185 states and 66772 transitions. Second operand 6 states. [2018-11-28 11:33:27,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:27,506 INFO L93 Difference]: Finished difference Result 19713 states and 60964 transitions. [2018-11-28 11:33:27,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:33:27,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-11-28 11:33:27,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:33:27,527 INFO L225 Difference]: With dead ends: 19713 [2018-11-28 11:33:27,527 INFO L226 Difference]: Without dead ends: 19713 [2018-11-28 11:33:27,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:33:27,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19713 states. [2018-11-28 11:33:27,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19713 to 12349. [2018-11-28 11:33:27,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12349 states. [2018-11-28 11:33:27,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12349 states to 12349 states and 38204 transitions. [2018-11-28 11:33:27,687 INFO L78 Accepts]: Start accepts. Automaton has 12349 states and 38204 transitions. Word has length 89 [2018-11-28 11:33:27,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:33:27,687 INFO L480 AbstractCegarLoop]: Abstraction has 12349 states and 38204 transitions. [2018-11-28 11:33:27,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:33:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 12349 states and 38204 transitions. [2018-11-28 11:33:27,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 11:33:27,697 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:33:27,697 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 11:33:27,698 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:33:27,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:27,698 INFO L82 PathProgramCache]: Analyzing trace with hash 2049629289, now seen corresponding path program 1 times [2018-11-28 11:33:27,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:27,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:27,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:27,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:27,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:27,775 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 11:33:27,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:33:27,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:33:27,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:33:27,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:33:27,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:33:27,776 INFO L87 Difference]: Start difference. First operand 12349 states and 38204 transitions. Second operand 6 states. [2018-11-28 11:33:27,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:27,916 INFO L93 Difference]: Finished difference Result 14279 states and 43813 transitions. [2018-11-28 11:33:27,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:33:27,916 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-11-28 11:33:27,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:33:27,931 INFO L225 Difference]: With dead ends: 14279 [2018-11-28 11:33:27,931 INFO L226 Difference]: Without dead ends: 13989 [2018-11-28 11:33:27,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:33:27,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13989 states. [2018-11-28 11:33:28,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13989 to 10869. [2018-11-28 11:33:28,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10869 states. [2018-11-28 11:33:28,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10869 states to 10869 states and 33340 transitions. [2018-11-28 11:33:28,051 INFO L78 Accepts]: Start accepts. Automaton has 10869 states and 33340 transitions. Word has length 91 [2018-11-28 11:33:28,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:33:28,051 INFO L480 AbstractCegarLoop]: Abstraction has 10869 states and 33340 transitions. [2018-11-28 11:33:28,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:33:28,051 INFO L276 IsEmpty]: Start isEmpty. Operand 10869 states and 33340 transitions. [2018-11-28 11:33:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 11:33:28,060 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:33:28,060 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 11:33:28,060 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:33:28,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:28,060 INFO L82 PathProgramCache]: Analyzing trace with hash -27580054, now seen corresponding path program 1 times [2018-11-28 11:33:28,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:28,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:28,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:28,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:28,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:28,136 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 11:33:28,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:33:28,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:33:28,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:33:28,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:33:28,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:33:28,137 INFO L87 Difference]: Start difference. First operand 10869 states and 33340 transitions. Second operand 5 states. [2018-11-28 11:33:28,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:28,172 INFO L93 Difference]: Finished difference Result 10869 states and 33276 transitions. [2018-11-28 11:33:28,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:33:28,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-28 11:33:28,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:33:28,183 INFO L225 Difference]: With dead ends: 10869 [2018-11-28 11:33:28,183 INFO L226 Difference]: Without dead ends: 10869 [2018-11-28 11:33:28,183 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 11:33:28,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10869 states. [2018-11-28 11:33:28,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10869 to 10869. [2018-11-28 11:33:28,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10869 states. [2018-11-28 11:33:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10869 states to 10869 states and 33276 transitions. [2018-11-28 11:33:28,293 INFO L78 Accepts]: Start accepts. Automaton has 10869 states and 33276 transitions. Word has length 91 [2018-11-28 11:33:28,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:33:28,293 INFO L480 AbstractCegarLoop]: Abstraction has 10869 states and 33276 transitions. [2018-11-28 11:33:28,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:33:28,293 INFO L276 IsEmpty]: Start isEmpty. Operand 10869 states and 33276 transitions. [2018-11-28 11:33:28,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 11:33:28,302 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:33:28,302 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 11:33:28,302 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:33:28,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:28,302 INFO L82 PathProgramCache]: Analyzing trace with hash 859923627, now seen corresponding path program 1 times [2018-11-28 11:33:28,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:28,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:28,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:28,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:28,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:28,389 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 11:33:28,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:33:28,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 11:33:28,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:33:28,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:33:28,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:33:28,389 INFO L87 Difference]: Start difference. First operand 10869 states and 33276 transitions. Second operand 8 states. [2018-11-28 11:33:28,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:28,662 INFO L93 Difference]: Finished difference Result 18907 states and 57783 transitions. [2018-11-28 11:33:28,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:33:28,662 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 91 [2018-11-28 11:33:28,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:33:28,673 INFO L225 Difference]: With dead ends: 18907 [2018-11-28 11:33:28,673 INFO L226 Difference]: Without dead ends: 9667 [2018-11-28 11:33:28,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-28 11:33:28,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9667 states. [2018-11-28 11:33:28,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9667 to 9097. [2018-11-28 11:33:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9097 states. [2018-11-28 11:33:28,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9097 states to 9097 states and 27600 transitions. [2018-11-28 11:33:28,773 INFO L78 Accepts]: Start accepts. Automaton has 9097 states and 27600 transitions. Word has length 91 [2018-11-28 11:33:28,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:33:28,774 INFO L480 AbstractCegarLoop]: Abstraction has 9097 states and 27600 transitions. [2018-11-28 11:33:28,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:33:28,774 INFO L276 IsEmpty]: Start isEmpty. Operand 9097 states and 27600 transitions. [2018-11-28 11:33:28,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 11:33:28,782 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:33:28,782 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 11:33:28,782 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:33:28,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:28,783 INFO L82 PathProgramCache]: Analyzing trace with hash -407237961, now seen corresponding path program 2 times [2018-11-28 11:33:28,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:28,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:28,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:28,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:33:28,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:33:28,893 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 11:33:28,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:33:28,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 11:33:28,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 11:33:28,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 11:33:28,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:33:28,894 INFO L87 Difference]: Start difference. First operand 9097 states and 27600 transitions. Second operand 10 states. [2018-11-28 11:33:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:33:29,410 INFO L93 Difference]: Finished difference Result 16561 states and 50458 transitions. [2018-11-28 11:33:29,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:33:29,411 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2018-11-28 11:33:29,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:33:29,421 INFO L225 Difference]: With dead ends: 16561 [2018-11-28 11:33:29,421 INFO L226 Difference]: Without dead ends: 6522 [2018-11-28 11:33:29,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-28 11:33:29,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6522 states. [2018-11-28 11:33:29,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6522 to 6522. [2018-11-28 11:33:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6522 states. [2018-11-28 11:33:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6522 states to 6522 states and 19811 transitions. [2018-11-28 11:33:29,564 INFO L78 Accepts]: Start accepts. Automaton has 6522 states and 19811 transitions. Word has length 91 [2018-11-28 11:33:29,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:33:29,565 INFO L480 AbstractCegarLoop]: Abstraction has 6522 states and 19811 transitions. [2018-11-28 11:33:29,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 11:33:29,565 INFO L276 IsEmpty]: Start isEmpty. Operand 6522 states and 19811 transitions. [2018-11-28 11:33:29,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 11:33:29,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:33:29,574 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 11:33:29,574 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:33:29,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:33:29,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1988001207, now seen corresponding path program 3 times [2018-11-28 11:33:29,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:33:29,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:33:29,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:29,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:33:29,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:33:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:33:29,642 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 11:33:29,744 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 11:33:29,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:33:29 BasicIcfg [2018-11-28 11:33:29,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:33:29,747 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:33:29,747 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:33:29,748 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:33:29,749 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:31:18" (3/4) ... [2018-11-28 11:33:29,750 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 11:33:29,859 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b6783d9a-620a-47c9-9fcf-363f37fb61bf/bin-2019/uautomizer/witness.graphml [2018-11-28 11:33:29,859 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:33:29,860 INFO L168 Benchmark]: Toolchain (without parser) took 132200.09 ms. Allocated memory was 1.0 GB in the beginning and 9.0 GB in the end (delta: 8.0 GB). Free memory was 954.9 MB in the beginning and 5.3 GB in the end (delta: -4.3 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2018-11-28 11:33:29,861 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:33:29,861 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:33:29,861 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:33:29,862 INFO L168 Benchmark]: Boogie Preprocessor took 25.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:33:29,862 INFO L168 Benchmark]: RCFGBuilder took 425.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:33:29,862 INFO L168 Benchmark]: TraceAbstraction took 131181.19 ms. Allocated memory was 1.2 GB in the beginning and 9.0 GB in the end (delta: 7.8 GB). Free memory was 1.1 GB in the beginning and 5.4 GB in the end (delta: -4.3 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2018-11-28 11:33:29,862 INFO L168 Benchmark]: Witness Printer took 112.32 ms. Allocated memory is still 9.0 GB. Free memory was 5.4 GB in the beginning and 5.3 GB in the end (delta: 61.2 MB). Peak memory consumption was 61.2 MB. Max. memory is 11.5 GB. [2018-11-28 11:33:29,863 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 407.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 425.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 131181.19 ms. Allocated memory was 1.2 GB in the beginning and 9.0 GB in the end (delta: 7.8 GB). Free memory was 1.1 GB in the beginning and 5.4 GB in the end (delta: -4.3 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. * Witness Printer took 112.32 ms. Allocated memory is still 9.0 GB. Free memory was 5.4 GB in the beginning and 5.3 GB in the end (delta: 61.2 MB). Peak memory consumption was 61.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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L678] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L680] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L682] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L683] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L684] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L685] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L686] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L687] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L688] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L692] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L700] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L790] -1 pthread_t t2579; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L791] FCALL, FORK -1 pthread_create(&t2579, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L792] -1 pthread_t t2580; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L793] FCALL, FORK -1 pthread_create(&t2580, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L794] -1 pthread_t t2581; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L795] FCALL, FORK -1 pthread_create(&t2581, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_p0_EAX=0, __unbuffered_p1_EAX=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 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L706] 1 z = 2 [L711] 1 __unbuffered_p0_EAX = x [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0: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=2] [L723] 2 x = 1 [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_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, 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=2] [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_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, 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=2] [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) [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_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, 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=2] [L768] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, 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=2] [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_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, 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=2] [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_p0_EAX=0, __unbuffered_p1_EAX=0, 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))=1, x=1, 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=2] [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_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, 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=2] [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)) [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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, 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=2] [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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, 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=2] [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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, 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=2] [L740] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, 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=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=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=2] [L768] 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) [L769] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, y=1, 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=2] [L769] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L770] 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 [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, y=1, 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=2] [L770] 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 [L771] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, y=1, 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=2] [L771] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L772] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, y=1, 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=2] [L772] 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 [L775] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, y=1, 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=2] [L797] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, y=1, 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=2] [L801] 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_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, y=1, 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=2] [L801] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, y=1, 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=2] [L801] 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_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, y=1, 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=2] [L801] -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) [L802] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, y=1, 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=2] [L802] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] 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_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, y=1, 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=2] [L803] -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 [L804] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, y=1, 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=2] [L804] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] 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_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, y=1, 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=2] [L805] -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 [L808] -1 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, y=1, 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=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, y=1, 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=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=1, y=1, 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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 217 locations, 3 error locations. UNSAFE Result, 131.0s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 43.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6306 SDtfs, 8575 SDslu, 13626 SDs, 0 SdLazy, 5288 SolverSat, 365 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308618occurred in iteration=8, 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: 62.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 604449 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1866 NumberOfCodeBlocks, 1866 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1751 ConstructedInterpolants, 0 QuantifiedInterpolants, 375613 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...