./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix034_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_395f55e3-8442-4bbb-9f4e-093be0b208f4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_395f55e3-8442-4bbb-9f4e-093be0b208f4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_395f55e3-8442-4bbb-9f4e-093be0b208f4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_395f55e3-8442-4bbb-9f4e-093be0b208f4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix034_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_395f55e3-8442-4bbb-9f4e-093be0b208f4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_395f55e3-8442-4bbb-9f4e-093be0b208f4/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f2d48c0072e6644ba6f943ccec98c56855dec7d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:35:13,758 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:35:13,760 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:35:13,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:35:13,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:35:13,776 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:35:13,778 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:35:13,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:35:13,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:35:13,795 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:35:13,796 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:35:13,798 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:35:13,798 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:35:13,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:35:13,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:35:13,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:35:13,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:35:13,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:35:13,806 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:35:13,809 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:35:13,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:35:13,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:35:13,817 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:35:13,818 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:35:13,821 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:35:13,821 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:35:13,821 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:35:13,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:35:13,823 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:35:13,824 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:35:13,824 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:35:13,825 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:35:13,826 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:35:13,826 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:35:13,828 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:35:13,828 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:35:13,829 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:35:13,829 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:35:13,829 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:35:13,830 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:35:13,831 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:35:13,832 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_395f55e3-8442-4bbb-9f4e-093be0b208f4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:35:13,855 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:35:13,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:35:13,867 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:35:13,867 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:35:13,868 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:35:13,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:35:13,868 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:35:13,868 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:35:13,869 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:35:13,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:35:13,869 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:35:13,869 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:35:13,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:35:13,870 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:35:13,870 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:35:13,871 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:35:13,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:35:13,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:35:13,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:35:13,872 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:35:13,872 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:35:13,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:35:13,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:35:13,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:35:13,873 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:35:13,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:35:13,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:35:13,874 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:35:13,875 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_395f55e3-8442-4bbb-9f4e-093be0b208f4/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f2d48c0072e6644ba6f943ccec98c56855dec7d [2019-11-15 22:35:13,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:35:13,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:35:13,925 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:35:13,926 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:35:13,926 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:35:13,927 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_395f55e3-8442-4bbb-9f4e-093be0b208f4/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix034_power.oepc.i [2019-11-15 22:35:13,979 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_395f55e3-8442-4bbb-9f4e-093be0b208f4/bin/uautomizer/data/434d43825/824d48aee7bd49aaaeb73fd11bd2304f/FLAG9fa2be9c8 [2019-11-15 22:35:14,456 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:35:14,457 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_395f55e3-8442-4bbb-9f4e-093be0b208f4/sv-benchmarks/c/pthread-wmm/mix034_power.oepc.i [2019-11-15 22:35:14,475 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_395f55e3-8442-4bbb-9f4e-093be0b208f4/bin/uautomizer/data/434d43825/824d48aee7bd49aaaeb73fd11bd2304f/FLAG9fa2be9c8 [2019-11-15 22:35:14,490 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_395f55e3-8442-4bbb-9f4e-093be0b208f4/bin/uautomizer/data/434d43825/824d48aee7bd49aaaeb73fd11bd2304f [2019-11-15 22:35:14,493 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:35:14,494 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:35:14,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:35:14,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:35:14,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:35:14,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:35:14" (1/1) ... [2019-11-15 22:35:14,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20921137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:35:14, skipping insertion in model container [2019-11-15 22:35:14,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:35:14" (1/1) ... [2019-11-15 22:35:14,508 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:35:14,551 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:35:15,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:35:15,056 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:35:15,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:35:15,195 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:35:15,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:35:15 WrapperNode [2019-11-15 22:35:15,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:35:15,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:35:15,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:35:15,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:35:15,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:35:15" (1/1) ... [2019-11-15 22:35:15,220 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:35:15" (1/1) ... [2019-11-15 22:35:15,246 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:35:15,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:35:15,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:35:15,247 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:35:15,254 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:35:15" (1/1) ... [2019-11-15 22:35:15,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:35:15" (1/1) ... [2019-11-15 22:35:15,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:35:15" (1/1) ... [2019-11-15 22:35:15,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:35:15" (1/1) ... [2019-11-15 22:35:15,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:35:15" (1/1) ... [2019-11-15 22:35:15,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:35:15" (1/1) ... [2019-11-15 22:35:15,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:35:15" (1/1) ... [2019-11-15 22:35:15,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:35:15,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:35:15,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:35:15,290 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:35:15,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:35:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_395f55e3-8442-4bbb-9f4e-093be0b208f4/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:35:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:35:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 22:35:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:35:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:35:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 22:35:15,359 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 22:35:15,359 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 22:35:15,359 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 22:35:15,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 22:35:15,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:35:15,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:35:15,361 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 22:35:15,976 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:35:15,977 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 22:35:15,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:35:15 BoogieIcfgContainer [2019-11-15 22:35:15,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:35:15,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:35:15,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:35:15,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:35:15,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:35:14" (1/3) ... [2019-11-15 22:35:15,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e432a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:35:15, skipping insertion in model container [2019-11-15 22:35:15,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:35:15" (2/3) ... [2019-11-15 22:35:15,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e432a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:35:15, skipping insertion in model container [2019-11-15 22:35:15,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:35:15" (3/3) ... [2019-11-15 22:35:15,984 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_power.oepc.i [2019-11-15 22:35:16,035 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,035 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,035 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,036 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,036 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,036 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,036 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,036 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,037 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,038 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,038 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,038 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,038 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,038 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,039 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,039 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,039 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,039 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,039 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,040 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,040 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,040 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,040 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,041 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,041 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,041 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,041 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,041 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,042 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,042 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,042 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,042 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,042 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,043 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,047 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,047 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,047 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,048 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,048 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,048 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,048 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,049 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,049 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,049 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,049 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,050 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,050 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,051 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,051 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,051 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,051 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,052 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,052 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,052 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,052 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,052 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,053 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,053 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,054 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,054 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,054 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,054 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,054 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,054 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,055 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,055 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,055 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,055 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,055 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,056 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,056 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,056 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,056 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,057 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,057 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,057 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,057 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,057 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,057 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,058 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,058 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,058 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,058 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,058 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,059 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,059 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,059 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,059 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,059 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,059 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,060 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,060 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,060 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,060 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,061 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,061 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,061 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,061 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,061 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,061 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,062 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,065 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,065 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,065 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,066 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,066 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,066 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,067 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,067 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,075 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,076 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,076 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,076 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,077 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,077 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,077 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,077 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,077 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,077 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,078 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,078 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,078 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,078 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,078 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,078 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,078 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,079 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,079 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,079 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,079 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,079 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,079 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,080 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,080 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,080 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,080 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,080 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,080 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,081 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,081 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,081 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,081 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,081 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,081 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,082 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,082 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,082 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,082 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:35:16,091 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 22:35:16,091 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:35:16,098 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 22:35:16,110 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 22:35:16,129 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:35:16,129 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:35:16,129 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:35:16,129 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:35:16,130 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:35:16,130 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:35:16,130 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:35:16,130 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:35:16,147 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142 places, 180 transitions [2019-11-15 22:35:18,455 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32592 states. [2019-11-15 22:35:18,458 INFO L276 IsEmpty]: Start isEmpty. Operand 32592 states. [2019-11-15 22:35:18,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:35:18,466 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:18,467 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:18,469 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:18,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:18,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1615524494, now seen corresponding path program 1 times [2019-11-15 22:35:18,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:18,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273127106] [2019-11-15 22:35:18,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:18,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:18,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:18,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:18,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273127106] [2019-11-15 22:35:18,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:18,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:35:18,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112526269] [2019-11-15 22:35:18,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:35:18,794 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:18,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:35:18,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:35:18,809 INFO L87 Difference]: Start difference. First operand 32592 states. Second operand 4 states. [2019-11-15 22:35:19,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:19,710 INFO L93 Difference]: Finished difference Result 33592 states and 129569 transitions. [2019-11-15 22:35:19,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:35:19,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 22:35:19,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:19,977 INFO L225 Difference]: With dead ends: 33592 [2019-11-15 22:35:19,977 INFO L226 Difference]: Without dead ends: 25704 [2019-11-15 22:35:19,980 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:35:20,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25704 states. [2019-11-15 22:35:21,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25704 to 25704. [2019-11-15 22:35:21,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25704 states. [2019-11-15 22:35:21,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25704 states to 25704 states and 99585 transitions. [2019-11-15 22:35:21,401 INFO L78 Accepts]: Start accepts. Automaton has 25704 states and 99585 transitions. Word has length 35 [2019-11-15 22:35:21,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:21,402 INFO L462 AbstractCegarLoop]: Abstraction has 25704 states and 99585 transitions. [2019-11-15 22:35:21,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:35:21,403 INFO L276 IsEmpty]: Start isEmpty. Operand 25704 states and 99585 transitions. [2019-11-15 22:35:21,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 22:35:21,412 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:21,412 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:21,413 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:21,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:21,413 INFO L82 PathProgramCache]: Analyzing trace with hash -815760078, now seen corresponding path program 1 times [2019-11-15 22:35:21,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:21,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915178935] [2019-11-15 22:35:21,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:21,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:21,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:21,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:21,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915178935] [2019-11-15 22:35:21,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:21,497 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:35:21,497 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241549612] [2019-11-15 22:35:21,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:35:21,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:21,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:35:21,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:35:21,499 INFO L87 Difference]: Start difference. First operand 25704 states and 99585 transitions. Second operand 5 states. [2019-11-15 22:35:22,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:22,460 INFO L93 Difference]: Finished difference Result 41082 states and 150432 transitions. [2019-11-15 22:35:22,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:35:22,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-15 22:35:22,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:22,626 INFO L225 Difference]: With dead ends: 41082 [2019-11-15 22:35:22,626 INFO L226 Difference]: Without dead ends: 40546 [2019-11-15 22:35:22,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:35:22,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40546 states. [2019-11-15 22:35:24,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40546 to 38926. [2019-11-15 22:35:24,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38926 states. [2019-11-15 22:35:24,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38926 states to 38926 states and 143582 transitions. [2019-11-15 22:35:24,166 INFO L78 Accepts]: Start accepts. Automaton has 38926 states and 143582 transitions. Word has length 47 [2019-11-15 22:35:24,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:24,168 INFO L462 AbstractCegarLoop]: Abstraction has 38926 states and 143582 transitions. [2019-11-15 22:35:24,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:35:24,169 INFO L276 IsEmpty]: Start isEmpty. Operand 38926 states and 143582 transitions. [2019-11-15 22:35:24,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 22:35:24,181 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:24,181 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:24,181 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:24,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:24,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1217511206, now seen corresponding path program 1 times [2019-11-15 22:35:24,182 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:24,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131431538] [2019-11-15 22:35:24,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:24,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:24,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:24,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:24,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131431538] [2019-11-15 22:35:24,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:24,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:35:24,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021276091] [2019-11-15 22:35:24,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:35:24,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:24,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:35:24,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:35:24,314 INFO L87 Difference]: Start difference. First operand 38926 states and 143582 transitions. Second operand 5 states. [2019-11-15 22:35:24,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:24,906 INFO L93 Difference]: Finished difference Result 49779 states and 180634 transitions. [2019-11-15 22:35:24,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:35:24,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-15 22:35:24,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:25,859 INFO L225 Difference]: With dead ends: 49779 [2019-11-15 22:35:25,859 INFO L226 Difference]: Without dead ends: 49275 [2019-11-15 22:35:25,860 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:35:26,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49275 states. [2019-11-15 22:35:26,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49275 to 42678. [2019-11-15 22:35:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42678 states. [2019-11-15 22:35:26,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42678 states to 42678 states and 156593 transitions. [2019-11-15 22:35:26,882 INFO L78 Accepts]: Start accepts. Automaton has 42678 states and 156593 transitions. Word has length 48 [2019-11-15 22:35:26,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:26,882 INFO L462 AbstractCegarLoop]: Abstraction has 42678 states and 156593 transitions. [2019-11-15 22:35:26,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:35:26,882 INFO L276 IsEmpty]: Start isEmpty. Operand 42678 states and 156593 transitions. [2019-11-15 22:35:26,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 22:35:26,892 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:26,892 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:26,892 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:26,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:26,893 INFO L82 PathProgramCache]: Analyzing trace with hash -825933952, now seen corresponding path program 1 times [2019-11-15 22:35:26,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:26,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797711170] [2019-11-15 22:35:26,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:26,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:26,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:26,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:26,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797711170] [2019-11-15 22:35:26,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:26,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:35:26,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456019987] [2019-11-15 22:35:26,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:35:26,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:26,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:35:26,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:35:26,939 INFO L87 Difference]: Start difference. First operand 42678 states and 156593 transitions. Second operand 3 states. [2019-11-15 22:35:27,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:27,231 INFO L93 Difference]: Finished difference Result 61088 states and 221431 transitions. [2019-11-15 22:35:27,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:35:27,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-15 22:35:27,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:28,218 INFO L225 Difference]: With dead ends: 61088 [2019-11-15 22:35:28,218 INFO L226 Difference]: Without dead ends: 61088 [2019-11-15 22:35:28,218 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:35:28,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61088 states. [2019-11-15 22:35:29,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61088 to 48017. [2019-11-15 22:35:29,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48017 states. [2019-11-15 22:35:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48017 states to 48017 states and 174180 transitions. [2019-11-15 22:35:29,159 INFO L78 Accepts]: Start accepts. Automaton has 48017 states and 174180 transitions. Word has length 50 [2019-11-15 22:35:29,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:29,159 INFO L462 AbstractCegarLoop]: Abstraction has 48017 states and 174180 transitions. [2019-11-15 22:35:29,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:35:29,159 INFO L276 IsEmpty]: Start isEmpty. Operand 48017 states and 174180 transitions. [2019-11-15 22:35:29,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 22:35:29,176 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:29,177 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:29,177 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:29,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:29,177 INFO L82 PathProgramCache]: Analyzing trace with hash 810527103, now seen corresponding path program 1 times [2019-11-15 22:35:29,178 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:29,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392508725] [2019-11-15 22:35:29,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:29,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:29,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:29,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392508725] [2019-11-15 22:35:29,304 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:29,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:35:29,304 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539130656] [2019-11-15 22:35:29,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:35:29,305 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:29,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:35:29,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:35:29,306 INFO L87 Difference]: Start difference. First operand 48017 states and 174180 transitions. Second operand 6 states. [2019-11-15 22:35:32,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:32,626 INFO L93 Difference]: Finished difference Result 63757 states and 229380 transitions. [2019-11-15 22:35:32,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:35:32,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-15 22:35:32,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:32,757 INFO L225 Difference]: With dead ends: 63757 [2019-11-15 22:35:32,758 INFO L226 Difference]: Without dead ends: 63757 [2019-11-15 22:35:32,758 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:35:33,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63757 states. [2019-11-15 22:35:33,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63757 to 59950. [2019-11-15 22:35:33,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59950 states. [2019-11-15 22:35:33,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59950 states to 59950 states and 215673 transitions. [2019-11-15 22:35:33,883 INFO L78 Accepts]: Start accepts. Automaton has 59950 states and 215673 transitions. Word has length 54 [2019-11-15 22:35:33,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:33,884 INFO L462 AbstractCegarLoop]: Abstraction has 59950 states and 215673 transitions. [2019-11-15 22:35:33,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:35:33,884 INFO L276 IsEmpty]: Start isEmpty. Operand 59950 states and 215673 transitions. [2019-11-15 22:35:33,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 22:35:33,902 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:33,902 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:33,903 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:33,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:33,903 INFO L82 PathProgramCache]: Analyzing trace with hash -986424256, now seen corresponding path program 1 times [2019-11-15 22:35:33,903 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:33,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416005015] [2019-11-15 22:35:33,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:33,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:33,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:34,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:34,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416005015] [2019-11-15 22:35:34,026 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:34,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:35:34,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316999986] [2019-11-15 22:35:34,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:35:34,028 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:34,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:35:34,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:35:34,029 INFO L87 Difference]: Start difference. First operand 59950 states and 215673 transitions. Second operand 7 states. [2019-11-15 22:35:35,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:35,652 INFO L93 Difference]: Finished difference Result 83686 states and 290098 transitions. [2019-11-15 22:35:35,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:35:35,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-15 22:35:35,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:35,813 INFO L225 Difference]: With dead ends: 83686 [2019-11-15 22:35:35,813 INFO L226 Difference]: Without dead ends: 83686 [2019-11-15 22:35:35,814 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:35:36,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83686 states. [2019-11-15 22:35:37,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83686 to 71013. [2019-11-15 22:35:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71013 states. [2019-11-15 22:35:37,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71013 states to 71013 states and 249887 transitions. [2019-11-15 22:35:37,292 INFO L78 Accepts]: Start accepts. Automaton has 71013 states and 249887 transitions. Word has length 54 [2019-11-15 22:35:37,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:37,293 INFO L462 AbstractCegarLoop]: Abstraction has 71013 states and 249887 transitions. [2019-11-15 22:35:37,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:35:37,294 INFO L276 IsEmpty]: Start isEmpty. Operand 71013 states and 249887 transitions. [2019-11-15 22:35:37,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 22:35:37,307 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:37,307 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:37,308 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:37,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:37,308 INFO L82 PathProgramCache]: Analyzing trace with hash -98920575, now seen corresponding path program 1 times [2019-11-15 22:35:37,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:37,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130863649] [2019-11-15 22:35:37,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:37,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:37,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:37,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:37,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130863649] [2019-11-15 22:35:37,386 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:37,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:35:37,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763613860] [2019-11-15 22:35:37,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:35:37,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:37,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:35:37,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:35:37,388 INFO L87 Difference]: Start difference. First operand 71013 states and 249887 transitions. Second operand 3 states. [2019-11-15 22:35:37,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:37,620 INFO L93 Difference]: Finished difference Result 54022 states and 188919 transitions. [2019-11-15 22:35:37,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:35:37,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-15 22:35:37,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:37,743 INFO L225 Difference]: With dead ends: 54022 [2019-11-15 22:35:37,743 INFO L226 Difference]: Without dead ends: 54022 [2019-11-15 22:35:37,744 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:35:38,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54022 states. [2019-11-15 22:35:39,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54022 to 53407. [2019-11-15 22:35:39,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53407 states. [2019-11-15 22:35:39,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53407 states to 53407 states and 187038 transitions. [2019-11-15 22:35:39,367 INFO L78 Accepts]: Start accepts. Automaton has 53407 states and 187038 transitions. Word has length 54 [2019-11-15 22:35:39,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:39,368 INFO L462 AbstractCegarLoop]: Abstraction has 53407 states and 187038 transitions. [2019-11-15 22:35:39,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:35:39,368 INFO L276 IsEmpty]: Start isEmpty. Operand 53407 states and 187038 transitions. [2019-11-15 22:35:39,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 22:35:39,377 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:39,377 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:39,377 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:39,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:39,377 INFO L82 PathProgramCache]: Analyzing trace with hash -698836789, now seen corresponding path program 1 times [2019-11-15 22:35:39,377 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:39,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102474703] [2019-11-15 22:35:39,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:39,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:39,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:39,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:39,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102474703] [2019-11-15 22:35:39,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:39,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:35:39,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160421298] [2019-11-15 22:35:39,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:35:39,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:39,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:35:39,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:35:39,494 INFO L87 Difference]: Start difference. First operand 53407 states and 187038 transitions. Second operand 6 states. [2019-11-15 22:35:40,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:40,283 INFO L93 Difference]: Finished difference Result 68647 states and 237302 transitions. [2019-11-15 22:35:40,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:35:40,283 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-15 22:35:40,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:40,428 INFO L225 Difference]: With dead ends: 68647 [2019-11-15 22:35:40,428 INFO L226 Difference]: Without dead ends: 68079 [2019-11-15 22:35:40,429 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:35:40,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68079 states. [2019-11-15 22:35:41,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68079 to 53491. [2019-11-15 22:35:41,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53491 states. [2019-11-15 22:35:41,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53491 states to 53491 states and 187735 transitions. [2019-11-15 22:35:41,745 INFO L78 Accepts]: Start accepts. Automaton has 53491 states and 187735 transitions. Word has length 54 [2019-11-15 22:35:41,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:41,746 INFO L462 AbstractCegarLoop]: Abstraction has 53491 states and 187735 transitions. [2019-11-15 22:35:41,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:35:41,746 INFO L276 IsEmpty]: Start isEmpty. Operand 53491 states and 187735 transitions. [2019-11-15 22:35:41,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 22:35:41,760 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:41,761 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:41,761 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:41,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:41,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1459554400, now seen corresponding path program 1 times [2019-11-15 22:35:41,761 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:41,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527324757] [2019-11-15 22:35:41,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:41,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:41,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:41,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527324757] [2019-11-15 22:35:41,886 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:41,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:35:41,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868514207] [2019-11-15 22:35:41,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:35:41,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:41,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:35:41,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:35:41,888 INFO L87 Difference]: Start difference. First operand 53491 states and 187735 transitions. Second operand 6 states. [2019-11-15 22:35:43,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:43,048 INFO L93 Difference]: Finished difference Result 67850 states and 231361 transitions. [2019-11-15 22:35:43,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:35:43,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-15 22:35:43,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:43,198 INFO L225 Difference]: With dead ends: 67850 [2019-11-15 22:35:43,198 INFO L226 Difference]: Without dead ends: 67850 [2019-11-15 22:35:43,198 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:35:43,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67850 states. [2019-11-15 22:35:44,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67850 to 59082. [2019-11-15 22:35:44,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59082 states. [2019-11-15 22:35:44,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59082 states to 59082 states and 204131 transitions. [2019-11-15 22:35:44,388 INFO L78 Accepts]: Start accepts. Automaton has 59082 states and 204131 transitions. Word has length 55 [2019-11-15 22:35:44,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:44,388 INFO L462 AbstractCegarLoop]: Abstraction has 59082 states and 204131 transitions. [2019-11-15 22:35:44,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:35:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 59082 states and 204131 transitions. [2019-11-15 22:35:44,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 22:35:44,402 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:44,402 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:44,403 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:44,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:44,404 INFO L82 PathProgramCache]: Analyzing trace with hash -572050719, now seen corresponding path program 1 times [2019-11-15 22:35:44,404 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:44,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020977379] [2019-11-15 22:35:44,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:44,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:44,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:44,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020977379] [2019-11-15 22:35:44,512 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:44,512 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:35:44,512 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572447090] [2019-11-15 22:35:44,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:35:44,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:44,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:35:44,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:35:44,513 INFO L87 Difference]: Start difference. First operand 59082 states and 204131 transitions. Second operand 4 states. [2019-11-15 22:35:44,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:44,560 INFO L93 Difference]: Finished difference Result 10213 states and 31247 transitions. [2019-11-15 22:35:44,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:35:44,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-11-15 22:35:44,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:44,571 INFO L225 Difference]: With dead ends: 10213 [2019-11-15 22:35:44,571 INFO L226 Difference]: Without dead ends: 8508 [2019-11-15 22:35:44,572 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:35:44,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8508 states. [2019-11-15 22:35:44,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8508 to 8460. [2019-11-15 22:35:44,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2019-11-15 22:35:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 25326 transitions. [2019-11-15 22:35:44,675 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 25326 transitions. Word has length 55 [2019-11-15 22:35:44,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:44,675 INFO L462 AbstractCegarLoop]: Abstraction has 8460 states and 25326 transitions. [2019-11-15 22:35:44,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:35:44,675 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 25326 transitions. [2019-11-15 22:35:44,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 22:35:44,678 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:44,678 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:44,678 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:44,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:44,678 INFO L82 PathProgramCache]: Analyzing trace with hash 672105094, now seen corresponding path program 1 times [2019-11-15 22:35:44,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:44,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593965111] [2019-11-15 22:35:44,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:44,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:44,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:44,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:44,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593965111] [2019-11-15 22:35:44,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:44,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:35:44,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688428651] [2019-11-15 22:35:44,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:35:44,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:44,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:35:44,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:35:44,748 INFO L87 Difference]: Start difference. First operand 8460 states and 25326 transitions. Second operand 6 states. [2019-11-15 22:35:45,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:45,169 INFO L93 Difference]: Finished difference Result 10741 states and 31734 transitions. [2019-11-15 22:35:45,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:35:45,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-11-15 22:35:45,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:45,186 INFO L225 Difference]: With dead ends: 10741 [2019-11-15 22:35:45,186 INFO L226 Difference]: Without dead ends: 10680 [2019-11-15 22:35:45,186 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:35:45,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10680 states. [2019-11-15 22:35:45,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10680 to 9961. [2019-11-15 22:35:45,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9961 states. [2019-11-15 22:35:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9961 states to 9961 states and 29612 transitions. [2019-11-15 22:35:45,332 INFO L78 Accepts]: Start accepts. Automaton has 9961 states and 29612 transitions. Word has length 62 [2019-11-15 22:35:45,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:45,333 INFO L462 AbstractCegarLoop]: Abstraction has 9961 states and 29612 transitions. [2019-11-15 22:35:45,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:35:45,333 INFO L276 IsEmpty]: Start isEmpty. Operand 9961 states and 29612 transitions. [2019-11-15 22:35:45,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:35:45,338 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:45,338 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:45,338 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:45,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:45,338 INFO L82 PathProgramCache]: Analyzing trace with hash -727186746, now seen corresponding path program 1 times [2019-11-15 22:35:45,339 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:45,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992785305] [2019-11-15 22:35:45,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:45,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:45,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:45,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:45,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992785305] [2019-11-15 22:35:45,436 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:45,436 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:35:45,436 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805264623] [2019-11-15 22:35:45,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:35:45,436 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:45,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:35:45,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:35:45,437 INFO L87 Difference]: Start difference. First operand 9961 states and 29612 transitions. Second operand 4 states. [2019-11-15 22:35:45,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:45,650 INFO L93 Difference]: Finished difference Result 12779 states and 37556 transitions. [2019-11-15 22:35:45,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:35:45,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-15 22:35:45,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:45,667 INFO L225 Difference]: With dead ends: 12779 [2019-11-15 22:35:45,667 INFO L226 Difference]: Without dead ends: 12779 [2019-11-15 22:35:45,667 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:35:45,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12779 states. [2019-11-15 22:35:45,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12779 to 11120. [2019-11-15 22:35:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11120 states. [2019-11-15 22:35:45,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11120 states to 11120 states and 32800 transitions. [2019-11-15 22:35:45,809 INFO L78 Accepts]: Start accepts. Automaton has 11120 states and 32800 transitions. Word has length 68 [2019-11-15 22:35:45,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:45,810 INFO L462 AbstractCegarLoop]: Abstraction has 11120 states and 32800 transitions. [2019-11-15 22:35:45,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:35:45,810 INFO L276 IsEmpty]: Start isEmpty. Operand 11120 states and 32800 transitions. [2019-11-15 22:35:45,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:35:45,816 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:45,816 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:45,816 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:45,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:45,817 INFO L82 PathProgramCache]: Analyzing trace with hash 517577735, now seen corresponding path program 1 times [2019-11-15 22:35:45,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:45,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845602268] [2019-11-15 22:35:45,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:45,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:45,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:45,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:45,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845602268] [2019-11-15 22:35:45,973 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:45,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:35:45,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786666608] [2019-11-15 22:35:45,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:35:45,974 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:45,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:35:45,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:35:45,975 INFO L87 Difference]: Start difference. First operand 11120 states and 32800 transitions. Second operand 6 states. [2019-11-15 22:35:46,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:46,508 INFO L93 Difference]: Finished difference Result 12254 states and 35521 transitions. [2019-11-15 22:35:46,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:35:46,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-15 22:35:46,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:46,522 INFO L225 Difference]: With dead ends: 12254 [2019-11-15 22:35:46,522 INFO L226 Difference]: Without dead ends: 12254 [2019-11-15 22:35:46,523 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:35:46,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12254 states. [2019-11-15 22:35:46,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12254 to 11959. [2019-11-15 22:35:46,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11959 states. [2019-11-15 22:35:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11959 states to 11959 states and 34775 transitions. [2019-11-15 22:35:46,667 INFO L78 Accepts]: Start accepts. Automaton has 11959 states and 34775 transitions. Word has length 68 [2019-11-15 22:35:46,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:46,668 INFO L462 AbstractCegarLoop]: Abstraction has 11959 states and 34775 transitions. [2019-11-15 22:35:46,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:35:46,668 INFO L276 IsEmpty]: Start isEmpty. Operand 11959 states and 34775 transitions. [2019-11-15 22:35:46,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:35:46,675 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:46,675 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:46,675 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:46,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:46,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1559631608, now seen corresponding path program 1 times [2019-11-15 22:35:46,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:46,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102218554] [2019-11-15 22:35:46,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:46,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:46,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:46,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:46,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102218554] [2019-11-15 22:35:46,792 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:46,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:35:46,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476613671] [2019-11-15 22:35:46,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:35:46,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:46,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:35:46,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:35:46,793 INFO L87 Difference]: Start difference. First operand 11959 states and 34775 transitions. Second operand 6 states. [2019-11-15 22:35:47,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:47,285 INFO L93 Difference]: Finished difference Result 13808 states and 38964 transitions. [2019-11-15 22:35:47,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:35:47,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-15 22:35:47,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:47,302 INFO L225 Difference]: With dead ends: 13808 [2019-11-15 22:35:47,302 INFO L226 Difference]: Without dead ends: 13808 [2019-11-15 22:35:47,303 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:35:47,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13808 states. [2019-11-15 22:35:47,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13808 to 12522. [2019-11-15 22:35:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12522 states. [2019-11-15 22:35:47,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12522 states to 12522 states and 35774 transitions. [2019-11-15 22:35:47,469 INFO L78 Accepts]: Start accepts. Automaton has 12522 states and 35774 transitions. Word has length 68 [2019-11-15 22:35:47,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:47,470 INFO L462 AbstractCegarLoop]: Abstraction has 12522 states and 35774 transitions. [2019-11-15 22:35:47,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:35:47,470 INFO L276 IsEmpty]: Start isEmpty. Operand 12522 states and 35774 transitions. [2019-11-15 22:35:47,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:35:47,479 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:47,480 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:47,480 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:47,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:47,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1348280695, now seen corresponding path program 1 times [2019-11-15 22:35:47,480 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:47,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679037810] [2019-11-15 22:35:47,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:47,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:47,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:47,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:47,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679037810] [2019-11-15 22:35:47,557 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:47,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:35:47,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293714577] [2019-11-15 22:35:47,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:35:47,558 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:47,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:35:47,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:35:47,559 INFO L87 Difference]: Start difference. First operand 12522 states and 35774 transitions. Second operand 5 states. [2019-11-15 22:35:47,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:47,883 INFO L93 Difference]: Finished difference Result 16038 states and 45579 transitions. [2019-11-15 22:35:47,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:35:47,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-15 22:35:47,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:47,905 INFO L225 Difference]: With dead ends: 16038 [2019-11-15 22:35:47,905 INFO L226 Difference]: Without dead ends: 16038 [2019-11-15 22:35:47,905 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:35:47,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16038 states. [2019-11-15 22:35:48,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16038 to 14892. [2019-11-15 22:35:48,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14892 states. [2019-11-15 22:35:48,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14892 states to 14892 states and 42227 transitions. [2019-11-15 22:35:48,105 INFO L78 Accepts]: Start accepts. Automaton has 14892 states and 42227 transitions. Word has length 68 [2019-11-15 22:35:48,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:48,106 INFO L462 AbstractCegarLoop]: Abstraction has 14892 states and 42227 transitions. [2019-11-15 22:35:48,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:35:48,106 INFO L276 IsEmpty]: Start isEmpty. Operand 14892 states and 42227 transitions. [2019-11-15 22:35:48,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:35:48,116 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:48,116 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:48,116 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:48,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:48,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1858814872, now seen corresponding path program 1 times [2019-11-15 22:35:48,117 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:48,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128236443] [2019-11-15 22:35:48,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:48,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:48,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:48,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:48,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128236443] [2019-11-15 22:35:48,175 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:48,175 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:35:48,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509040967] [2019-11-15 22:35:48,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:35:48,176 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:48,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:35:48,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:35:48,176 INFO L87 Difference]: Start difference. First operand 14892 states and 42227 transitions. Second operand 4 states. [2019-11-15 22:35:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:48,681 INFO L93 Difference]: Finished difference Result 18321 states and 52088 transitions. [2019-11-15 22:35:48,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:35:48,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-15 22:35:48,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:48,706 INFO L225 Difference]: With dead ends: 18321 [2019-11-15 22:35:48,706 INFO L226 Difference]: Without dead ends: 18144 [2019-11-15 22:35:48,706 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:35:48,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18144 states. [2019-11-15 22:35:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18144 to 17301. [2019-11-15 22:35:48,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17301 states. [2019-11-15 22:35:48,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17301 states to 17301 states and 49086 transitions. [2019-11-15 22:35:48,940 INFO L78 Accepts]: Start accepts. Automaton has 17301 states and 49086 transitions. Word has length 68 [2019-11-15 22:35:48,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:48,940 INFO L462 AbstractCegarLoop]: Abstraction has 17301 states and 49086 transitions. [2019-11-15 22:35:48,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:35:48,940 INFO L276 IsEmpty]: Start isEmpty. Operand 17301 states and 49086 transitions. [2019-11-15 22:35:48,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:35:48,948 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:48,948 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:48,948 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:48,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:48,948 INFO L82 PathProgramCache]: Analyzing trace with hash 639201065, now seen corresponding path program 1 times [2019-11-15 22:35:48,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:48,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939666574] [2019-11-15 22:35:48,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:48,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:48,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:49,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:49,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939666574] [2019-11-15 22:35:49,043 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:49,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:35:49,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561186079] [2019-11-15 22:35:49,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:35:49,044 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:49,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:35:49,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:35:49,044 INFO L87 Difference]: Start difference. First operand 17301 states and 49086 transitions. Second operand 5 states. [2019-11-15 22:35:49,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:49,151 INFO L93 Difference]: Finished difference Result 16587 states and 45829 transitions. [2019-11-15 22:35:49,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:35:49,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-15 22:35:49,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:49,177 INFO L225 Difference]: With dead ends: 16587 [2019-11-15 22:35:49,178 INFO L226 Difference]: Without dead ends: 16587 [2019-11-15 22:35:49,178 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:35:49,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16587 states. [2019-11-15 22:35:49,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16587 to 14096. [2019-11-15 22:35:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14096 states. [2019-11-15 22:35:49,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14096 states to 14096 states and 38807 transitions. [2019-11-15 22:35:49,373 INFO L78 Accepts]: Start accepts. Automaton has 14096 states and 38807 transitions. Word has length 68 [2019-11-15 22:35:49,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:49,373 INFO L462 AbstractCegarLoop]: Abstraction has 14096 states and 38807 transitions. [2019-11-15 22:35:49,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:35:49,373 INFO L276 IsEmpty]: Start isEmpty. Operand 14096 states and 38807 transitions. [2019-11-15 22:35:49,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:35:49,379 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:49,379 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:49,379 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:49,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:49,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1526704746, now seen corresponding path program 1 times [2019-11-15 22:35:49,379 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:49,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724608528] [2019-11-15 22:35:49,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:49,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:49,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:49,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:49,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724608528] [2019-11-15 22:35:49,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:49,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:35:49,451 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171560832] [2019-11-15 22:35:49,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:35:49,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:49,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:35:49,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:35:49,452 INFO L87 Difference]: Start difference. First operand 14096 states and 38807 transitions. Second operand 5 states. [2019-11-15 22:35:49,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:49,513 INFO L93 Difference]: Finished difference Result 5057 states and 11952 transitions. [2019-11-15 22:35:49,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:35:49,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-15 22:35:49,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:49,519 INFO L225 Difference]: With dead ends: 5057 [2019-11-15 22:35:49,519 INFO L226 Difference]: Without dead ends: 4415 [2019-11-15 22:35:49,519 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:35:49,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4415 states. [2019-11-15 22:35:49,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4415 to 4403. [2019-11-15 22:35:49,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4403 states. [2019-11-15 22:35:49,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4403 states to 4403 states and 10064 transitions. [2019-11-15 22:35:49,569 INFO L78 Accepts]: Start accepts. Automaton has 4403 states and 10064 transitions. Word has length 68 [2019-11-15 22:35:49,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:49,569 INFO L462 AbstractCegarLoop]: Abstraction has 4403 states and 10064 transitions. [2019-11-15 22:35:49,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:35:49,569 INFO L276 IsEmpty]: Start isEmpty. Operand 4403 states and 10064 transitions. [2019-11-15 22:35:49,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:35:49,572 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:49,572 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:49,573 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:49,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:49,573 INFO L82 PathProgramCache]: Analyzing trace with hash 237281463, now seen corresponding path program 1 times [2019-11-15 22:35:49,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:49,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175785791] [2019-11-15 22:35:49,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:49,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:49,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:49,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:49,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175785791] [2019-11-15 22:35:49,609 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:49,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:35:49,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813545670] [2019-11-15 22:35:49,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:35:49,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:49,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:35:49,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:35:49,610 INFO L87 Difference]: Start difference. First operand 4403 states and 10064 transitions. Second operand 3 states. [2019-11-15 22:35:49,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:49,648 INFO L93 Difference]: Finished difference Result 5379 states and 12070 transitions. [2019-11-15 22:35:49,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:35:49,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-11-15 22:35:49,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:49,655 INFO L225 Difference]: With dead ends: 5379 [2019-11-15 22:35:49,655 INFO L226 Difference]: Without dead ends: 5379 [2019-11-15 22:35:49,656 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:35:49,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2019-11-15 22:35:49,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 4363. [2019-11-15 22:35:49,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4363 states. [2019-11-15 22:35:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4363 states to 4363 states and 9681 transitions. [2019-11-15 22:35:49,719 INFO L78 Accepts]: Start accepts. Automaton has 4363 states and 9681 transitions. Word has length 68 [2019-11-15 22:35:49,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:49,720 INFO L462 AbstractCegarLoop]: Abstraction has 4363 states and 9681 transitions. [2019-11-15 22:35:49,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:35:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 4363 states and 9681 transitions. [2019-11-15 22:35:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 22:35:49,725 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:49,725 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:49,726 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:49,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:49,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1029691817, now seen corresponding path program 1 times [2019-11-15 22:35:49,726 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:49,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834177503] [2019-11-15 22:35:49,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:49,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:49,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:49,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834177503] [2019-11-15 22:35:49,816 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:49,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:35:49,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91075880] [2019-11-15 22:35:49,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:35:49,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:49,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:35:49,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:35:49,818 INFO L87 Difference]: Start difference. First operand 4363 states and 9681 transitions. Second operand 7 states. [2019-11-15 22:35:50,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:50,200 INFO L93 Difference]: Finished difference Result 5136 states and 11285 transitions. [2019-11-15 22:35:50,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:35:50,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-11-15 22:35:50,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:50,204 INFO L225 Difference]: With dead ends: 5136 [2019-11-15 22:35:50,204 INFO L226 Difference]: Without dead ends: 5083 [2019-11-15 22:35:50,205 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:35:50,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5083 states. [2019-11-15 22:35:50,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5083 to 4435. [2019-11-15 22:35:50,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4435 states. [2019-11-15 22:35:50,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4435 states to 4435 states and 9733 transitions. [2019-11-15 22:35:50,255 INFO L78 Accepts]: Start accepts. Automaton has 4435 states and 9733 transitions. Word has length 74 [2019-11-15 22:35:50,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:50,255 INFO L462 AbstractCegarLoop]: Abstraction has 4435 states and 9733 transitions. [2019-11-15 22:35:50,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:35:50,255 INFO L276 IsEmpty]: Start isEmpty. Operand 4435 states and 9733 transitions. [2019-11-15 22:35:50,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:35:50,259 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:50,259 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:50,259 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:50,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:50,260 INFO L82 PathProgramCache]: Analyzing trace with hash 2110925138, now seen corresponding path program 1 times [2019-11-15 22:35:50,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:50,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049597812] [2019-11-15 22:35:50,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:50,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:50,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:50,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049597812] [2019-11-15 22:35:50,328 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:50,328 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:35:50,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105557296] [2019-11-15 22:35:50,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:35:50,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:50,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:35:50,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:35:50,330 INFO L87 Difference]: Start difference. First operand 4435 states and 9733 transitions. Second operand 5 states. [2019-11-15 22:35:50,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:50,646 INFO L93 Difference]: Finished difference Result 5310 states and 11604 transitions. [2019-11-15 22:35:50,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:35:50,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 22:35:50,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:50,653 INFO L225 Difference]: With dead ends: 5310 [2019-11-15 22:35:50,653 INFO L226 Difference]: Without dead ends: 5310 [2019-11-15 22:35:50,654 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:35:50,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5310 states. [2019-11-15 22:35:50,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5310 to 4567. [2019-11-15 22:35:50,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4567 states. [2019-11-15 22:35:50,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4567 states to 4567 states and 10023 transitions. [2019-11-15 22:35:50,727 INFO L78 Accepts]: Start accepts. Automaton has 4567 states and 10023 transitions. Word has length 95 [2019-11-15 22:35:50,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:50,727 INFO L462 AbstractCegarLoop]: Abstraction has 4567 states and 10023 transitions. [2019-11-15 22:35:50,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:35:50,728 INFO L276 IsEmpty]: Start isEmpty. Operand 4567 states and 10023 transitions. [2019-11-15 22:35:50,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:35:50,734 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:50,734 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:50,734 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:50,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:50,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1072928632, now seen corresponding path program 2 times [2019-11-15 22:35:50,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:50,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463856475] [2019-11-15 22:35:50,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:50,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:50,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:50,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:50,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463856475] [2019-11-15 22:35:50,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:50,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:35:50,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038348040] [2019-11-15 22:35:50,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:35:50,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:50,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:35:50,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:35:50,806 INFO L87 Difference]: Start difference. First operand 4567 states and 10023 transitions. Second operand 4 states. [2019-11-15 22:35:50,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:50,933 INFO L93 Difference]: Finished difference Result 5426 states and 11844 transitions. [2019-11-15 22:35:50,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:35:50,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 22:35:50,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:50,940 INFO L225 Difference]: With dead ends: 5426 [2019-11-15 22:35:50,941 INFO L226 Difference]: Without dead ends: 5426 [2019-11-15 22:35:50,941 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:35:50,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5426 states. [2019-11-15 22:35:51,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5426 to 4715. [2019-11-15 22:35:51,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4715 states. [2019-11-15 22:35:51,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4715 states to 4715 states and 10327 transitions. [2019-11-15 22:35:51,011 INFO L78 Accepts]: Start accepts. Automaton has 4715 states and 10327 transitions. Word has length 95 [2019-11-15 22:35:51,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:51,012 INFO L462 AbstractCegarLoop]: Abstraction has 4715 states and 10327 transitions. [2019-11-15 22:35:51,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:35:51,012 INFO L276 IsEmpty]: Start isEmpty. Operand 4715 states and 10327 transitions. [2019-11-15 22:35:51,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 22:35:51,018 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:51,019 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:51,019 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:51,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:51,019 INFO L82 PathProgramCache]: Analyzing trace with hash -96023015, now seen corresponding path program 1 times [2019-11-15 22:35:51,019 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:51,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338320803] [2019-11-15 22:35:51,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:51,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:51,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:51,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:51,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338320803] [2019-11-15 22:35:51,113 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:51,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:35:51,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829924491] [2019-11-15 22:35:51,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:35:51,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:51,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:35:51,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:35:51,117 INFO L87 Difference]: Start difference. First operand 4715 states and 10327 transitions. Second operand 6 states. [2019-11-15 22:35:51,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:51,411 INFO L93 Difference]: Finished difference Result 4815 states and 10551 transitions. [2019-11-15 22:35:51,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:35:51,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-11-15 22:35:51,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:51,417 INFO L225 Difference]: With dead ends: 4815 [2019-11-15 22:35:51,417 INFO L226 Difference]: Without dead ends: 4815 [2019-11-15 22:35:51,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:35:51,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4815 states. [2019-11-15 22:35:51,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4815 to 4602. [2019-11-15 22:35:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4602 states. [2019-11-15 22:35:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4602 states to 4602 states and 10104 transitions. [2019-11-15 22:35:51,483 INFO L78 Accepts]: Start accepts. Automaton has 4602 states and 10104 transitions. Word has length 97 [2019-11-15 22:35:51,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:51,483 INFO L462 AbstractCegarLoop]: Abstraction has 4602 states and 10104 transitions. [2019-11-15 22:35:51,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:35:51,483 INFO L276 IsEmpty]: Start isEmpty. Operand 4602 states and 10104 transitions. [2019-11-15 22:35:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 22:35:51,489 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:51,489 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:51,490 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:51,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:51,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1365627418, now seen corresponding path program 1 times [2019-11-15 22:35:51,491 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:51,491 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103730311] [2019-11-15 22:35:51,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:51,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:51,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:51,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:51,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103730311] [2019-11-15 22:35:51,556 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:51,556 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:35:51,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437252506] [2019-11-15 22:35:51,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:35:51,557 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:51,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:35:51,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:35:51,558 INFO L87 Difference]: Start difference. First operand 4602 states and 10104 transitions. Second operand 4 states. [2019-11-15 22:35:51,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:51,887 INFO L93 Difference]: Finished difference Result 5807 states and 12707 transitions. [2019-11-15 22:35:51,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:35:51,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 22:35:51,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:51,894 INFO L225 Difference]: With dead ends: 5807 [2019-11-15 22:35:51,894 INFO L226 Difference]: Without dead ends: 5767 [2019-11-15 22:35:51,896 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:35:51,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5767 states. [2019-11-15 22:35:51,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5767 to 5494. [2019-11-15 22:35:51,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5494 states. [2019-11-15 22:35:51,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5494 states to 5494 states and 12035 transitions. [2019-11-15 22:35:51,974 INFO L78 Accepts]: Start accepts. Automaton has 5494 states and 12035 transitions. Word has length 97 [2019-11-15 22:35:51,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:51,974 INFO L462 AbstractCegarLoop]: Abstraction has 5494 states and 12035 transitions. [2019-11-15 22:35:51,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:35:51,974 INFO L276 IsEmpty]: Start isEmpty. Operand 5494 states and 12035 transitions. [2019-11-15 22:35:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 22:35:51,981 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:51,982 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:51,982 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:51,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:51,982 INFO L82 PathProgramCache]: Analyzing trace with hash -711581925, now seen corresponding path program 1 times [2019-11-15 22:35:51,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:51,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45713217] [2019-11-15 22:35:51,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:51,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:51,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:52,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45713217] [2019-11-15 22:35:52,199 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:52,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:35:52,200 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721824055] [2019-11-15 22:35:52,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:35:52,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:52,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:35:52,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:35:52,201 INFO L87 Difference]: Start difference. First operand 5494 states and 12035 transitions. Second operand 9 states. [2019-11-15 22:35:52,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:52,976 INFO L93 Difference]: Finished difference Result 6169 states and 13359 transitions. [2019-11-15 22:35:52,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 22:35:52,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-11-15 22:35:52,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:52,982 INFO L225 Difference]: With dead ends: 6169 [2019-11-15 22:35:52,982 INFO L226 Difference]: Without dead ends: 6169 [2019-11-15 22:35:52,983 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-11-15 22:35:52,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6169 states. [2019-11-15 22:35:53,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6169 to 5161. [2019-11-15 22:35:53,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5161 states. [2019-11-15 22:35:53,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5161 states to 5161 states and 11249 transitions. [2019-11-15 22:35:53,039 INFO L78 Accepts]: Start accepts. Automaton has 5161 states and 11249 transitions. Word has length 97 [2019-11-15 22:35:53,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:53,039 INFO L462 AbstractCegarLoop]: Abstraction has 5161 states and 11249 transitions. [2019-11-15 22:35:53,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:35:53,039 INFO L276 IsEmpty]: Start isEmpty. Operand 5161 states and 11249 transitions. [2019-11-15 22:35:53,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 22:35:53,045 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:53,045 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:53,045 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:53,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:53,046 INFO L82 PathProgramCache]: Analyzing trace with hash -500231012, now seen corresponding path program 1 times [2019-11-15 22:35:53,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:53,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719954028] [2019-11-15 22:35:53,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:53,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:53,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:53,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:35:53,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719954028] [2019-11-15 22:35:53,197 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:53,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 22:35:53,198 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617114172] [2019-11-15 22:35:53,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:35:53,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:35:53,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:35:53,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:35:53,199 INFO L87 Difference]: Start difference. First operand 5161 states and 11249 transitions. Second operand 10 states. [2019-11-15 22:35:53,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:53,705 INFO L93 Difference]: Finished difference Result 16368 states and 36295 transitions. [2019-11-15 22:35:53,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 22:35:53,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-11-15 22:35:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:53,714 INFO L225 Difference]: With dead ends: 16368 [2019-11-15 22:35:53,714 INFO L226 Difference]: Without dead ends: 10730 [2019-11-15 22:35:53,714 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-11-15 22:35:53,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10730 states. [2019-11-15 22:35:53,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10730 to 5200. [2019-11-15 22:35:53,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5200 states. [2019-11-15 22:35:53,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5200 states to 5200 states and 11285 transitions. [2019-11-15 22:35:53,794 INFO L78 Accepts]: Start accepts. Automaton has 5200 states and 11285 transitions. Word has length 97 [2019-11-15 22:35:53,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:53,794 INFO L462 AbstractCegarLoop]: Abstraction has 5200 states and 11285 transitions. [2019-11-15 22:35:53,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:35:53,794 INFO L276 IsEmpty]: Start isEmpty. Operand 5200 states and 11285 transitions. [2019-11-15 22:35:53,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 22:35:53,799 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:53,799 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:35:53,799 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:53,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:53,800 INFO L82 PathProgramCache]: Analyzing trace with hash -307609594, now seen corresponding path program 2 times [2019-11-15 22:35:53,800 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:35:53,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17470265] [2019-11-15 22:35:53,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:53,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:35:53,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:35:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:35:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:35:53,893 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:35:53,893 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:35:54,098 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 22:35:54,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:35:54 BasicIcfg [2019-11-15 22:35:54,102 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:35:54,103 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:35:54,103 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:35:54,103 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:35:54,104 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:35:15" (3/4) ... [2019-11-15 22:35:54,109 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 22:35:54,290 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_395f55e3-8442-4bbb-9f4e-093be0b208f4/bin/uautomizer/witness.graphml [2019-11-15 22:35:54,291 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:35:54,293 INFO L168 Benchmark]: Toolchain (without parser) took 39798.41 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.5 GB). Free memory was 940.7 MB in the beginning and 1.9 GB in the end (delta: -943.7 MB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-11-15 22:35:54,293 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:35:54,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 702.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -165.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:35:54,294 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:35:54,294 INFO L168 Benchmark]: Boogie Preprocessor took 43.39 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. [2019-11-15 22:35:54,295 INFO L168 Benchmark]: RCFGBuilder took 688.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:35:54,295 INFO L168 Benchmark]: TraceAbstraction took 38123.87 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -903.2 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-11-15 22:35:54,296 INFO L168 Benchmark]: Witness Printer took 187.85 ms. Allocated memory is still 4.5 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 68.7 MB). Peak memory consumption was 68.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:35:54,298 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 702.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -165.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.39 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 688.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38123.87 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -903.2 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 187.85 ms. Allocated memory is still 4.5 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 68.7 MB). Peak memory consumption was 68.7 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: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L700] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L701] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L702] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L704] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L709] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L710] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L711] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L712] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L713] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L714] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L715] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L716] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L717] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L718] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L719] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L720] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L721] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L722] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L723] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L724] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 0 pthread_t t897; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] FCALL, FORK 0 pthread_create(&t897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 0 pthread_t t898; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L728] 1 z$w_buff1 = z$w_buff0 [L729] 1 z$w_buff0 = 1 [L730] 1 z$w_buff1_used = z$w_buff0_used [L731] 1 z$w_buff0_used = (_Bool)1 [L806] FCALL, FORK 0 pthread_create(&t898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L745] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L775] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 z = z$flush_delayed ? z$mem_tmp : z [L778] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L813] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L816] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L819] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 220 locations, 3 error locations. Result: UNSAFE, OverallTime: 37.9s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7474 SDtfs, 8640 SDslu, 16431 SDs, 0 SdLazy, 6237 SolverSat, 400 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 70 SyntacticMatches, 18 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71013occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 80380 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1861 NumberOfCodeBlocks, 1861 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1738 ConstructedInterpolants, 0 QuantifiedInterpolants, 292488 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...