./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix054_rmo.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_d64bb92e-18e4-4f44-9ba3-5727d8c56692/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d64bb92e-18e4-4f44-9ba3-5727d8c56692/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d64bb92e-18e4-4f44-9ba3-5727d8c56692/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d64bb92e-18e4-4f44-9ba3-5727d8c56692/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix054_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d64bb92e-18e4-4f44-9ba3-5727d8c56692/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d64bb92e-18e4-4f44-9ba3-5727d8c56692/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 4033a21503ef5f16f718d5502cb57c5c6653980b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 20:50:20,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:50:20,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:50:20,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:50:20,784 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:50:20,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:50:20,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:50:20,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:50:20,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:50:20,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:50:20,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:50:20,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:50:20,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:50:20,805 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:50:20,806 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:50:20,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:50:20,807 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:50:20,808 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:50:20,810 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:50:20,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:50:20,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:50:20,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:50:20,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:50:20,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:50:20,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:50:20,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:50:20,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:50:20,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:50:20,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:50:20,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:50:20,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:50:20,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:50:20,822 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:50:20,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:50:20,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:50:20,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:50:20,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:50:20,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:50:20,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:50:20,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:50:20,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:50:20,827 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d64bb92e-18e4-4f44-9ba3-5727d8c56692/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:50:20,840 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:50:20,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:50:20,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:50:20,842 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:50:20,842 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:50:20,842 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:50:20,842 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:50:20,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:50:20,843 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:50:20,843 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:50:20,843 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:50:20,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:50:20,844 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:50:20,844 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:50:20,844 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:50:20,844 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:50:20,844 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:50:20,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:50:20,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:50:20,845 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:50:20,845 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:50:20,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:50:20,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:50:20,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:50:20,846 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:50:20,846 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:50:20,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:50:20,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:50:20,847 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_d64bb92e-18e4-4f44-9ba3-5727d8c56692/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 -> 4033a21503ef5f16f718d5502cb57c5c6653980b [2019-11-15 20:50:20,872 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:50:20,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:50:20,886 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:50:20,889 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:50:20,889 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:50:20,891 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d64bb92e-18e4-4f44-9ba3-5727d8c56692/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix054_rmo.oepc.i [2019-11-15 20:50:20,944 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d64bb92e-18e4-4f44-9ba3-5727d8c56692/bin/uautomizer/data/6364dc9d2/5174d9b658634f82b9d44b623eca1822/FLAG13bcf5035 [2019-11-15 20:50:21,429 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:50:21,430 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d64bb92e-18e4-4f44-9ba3-5727d8c56692/sv-benchmarks/c/pthread-wmm/mix054_rmo.oepc.i [2019-11-15 20:50:21,443 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d64bb92e-18e4-4f44-9ba3-5727d8c56692/bin/uautomizer/data/6364dc9d2/5174d9b658634f82b9d44b623eca1822/FLAG13bcf5035 [2019-11-15 20:50:21,455 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d64bb92e-18e4-4f44-9ba3-5727d8c56692/bin/uautomizer/data/6364dc9d2/5174d9b658634f82b9d44b623eca1822 [2019-11-15 20:50:21,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:50:21,458 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:50:21,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:50:21,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:50:21,462 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:50:21,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:50:21" (1/1) ... [2019-11-15 20:50:21,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a1ffd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:50:21, skipping insertion in model container [2019-11-15 20:50:21,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:50:21" (1/1) ... [2019-11-15 20:50:21,471 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:50:21,521 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:50:21,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:50:21,960 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:50:22,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:50:22,114 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:50:22,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:50:22 WrapperNode [2019-11-15 20:50:22,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:50:22,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:50:22,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:50:22,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:50:22,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:50:22" (1/1) ... [2019-11-15 20:50:22,142 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:50:22" (1/1) ... [2019-11-15 20:50:22,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:50:22,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:50:22,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:50:22,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:50:22,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:50:22" (1/1) ... [2019-11-15 20:50:22,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:50:22" (1/1) ... [2019-11-15 20:50:22,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:50:22" (1/1) ... [2019-11-15 20:50:22,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:50:22" (1/1) ... [2019-11-15 20:50:22,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:50:22" (1/1) ... [2019-11-15 20:50:22,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:50:22" (1/1) ... [2019-11-15 20:50:22,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:50:22" (1/1) ... [2019-11-15 20:50:22,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:50:22,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:50:22,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:50:22,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:50:22,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:50:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d64bb92e-18e4-4f44-9ba3-5727d8c56692/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 20:50:22,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:50:22,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 20:50:22,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:50:22,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:50:22,304 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 20:50:22,305 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 20:50:22,305 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 20:50:22,305 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 20:50:22,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 20:50:22,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:50:22,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:50:22,309 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 20:50:22,997 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:50:22,998 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 20:50:22,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:50:22 BoogieIcfgContainer [2019-11-15 20:50:22,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:50:23,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:50:23,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:50:23,003 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:50:23,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:50:21" (1/3) ... [2019-11-15 20:50:23,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd699b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:50:23, skipping insertion in model container [2019-11-15 20:50:23,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:50:22" (2/3) ... [2019-11-15 20:50:23,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd699b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:50:23, skipping insertion in model container [2019-11-15 20:50:23,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:50:22" (3/3) ... [2019-11-15 20:50:23,006 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_rmo.oepc.i [2019-11-15 20:50:23,044 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,045 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,045 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,045 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,045 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,045 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,046 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,046 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,046 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,047 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,047 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,047 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,047 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,048 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,048 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,048 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,048 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,048 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,049 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,049 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,049 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,049 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,050 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,050 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,050 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,050 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,051 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,051 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,051 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,051 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,052 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,052 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,052 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,052 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,053 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,054 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,054 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,054 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,054 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,054 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,055 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,055 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,055 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,055 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,056 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,056 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,056 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,056 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,057 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,057 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,057 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,057 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,058 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,058 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,058 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,058 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,059 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,059 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,059 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,059 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,059 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,060 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,060 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,060 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,060 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,061 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,061 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,061 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,061 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,062 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,062 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,062 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,062 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,063 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,063 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,063 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,063 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,063 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,064 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,064 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,064 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,065 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,065 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,065 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,065 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,065 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,066 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,066 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,066 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,066 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,067 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,067 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,067 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,067 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,067 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,069 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,069 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,069 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,069 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,070 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,070 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,070 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,070 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,071 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,071 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,071 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,071 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,071 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,072 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,072 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,072 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,072 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,073 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,073 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,073 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,073 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,074 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,074 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,074 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,074 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,074 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,075 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,075 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,075 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,075 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,075 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,076 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,076 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,076 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,076 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,077 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,077 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,077 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,077 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,078 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,078 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,078 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,078 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,078 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,079 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,079 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,079 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,079 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,080 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,080 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,080 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,080 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:50:23,086 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 20:50:23,086 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:50:23,094 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 20:50:23,104 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 20:50:23,121 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:50:23,121 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:50:23,121 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:50:23,122 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:50:23,122 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:50:23,122 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:50:23,122 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:50:23,122 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:50:23,135 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139 places, 177 transitions [2019-11-15 20:50:25,734 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32589 states. [2019-11-15 20:50:25,841 INFO L276 IsEmpty]: Start isEmpty. Operand 32589 states. [2019-11-15 20:50:25,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 20:50:25,847 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:25,847 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] [2019-11-15 20:50:25,850 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:25,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:25,855 INFO L82 PathProgramCache]: Analyzing trace with hash 737563216, now seen corresponding path program 1 times [2019-11-15 20:50:25,862 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:25,863 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346641216] [2019-11-15 20:50:25,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:25,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:25,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:26,147 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 20:50:26,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346641216] [2019-11-15 20:50:26,155 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:26,155 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:50:26,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683038921] [2019-11-15 20:50:26,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:50:26,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:26,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:50:26,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:50:26,177 INFO L87 Difference]: Start difference. First operand 32589 states. Second operand 4 states. [2019-11-15 20:50:26,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:26,824 INFO L93 Difference]: Finished difference Result 33589 states and 129566 transitions. [2019-11-15 20:50:26,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:50:26,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-15 20:50:26,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:27,058 INFO L225 Difference]: With dead ends: 33589 [2019-11-15 20:50:27,059 INFO L226 Difference]: Without dead ends: 25701 [2019-11-15 20:50:27,060 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 20:50:27,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25701 states. [2019-11-15 20:50:28,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25701 to 25701. [2019-11-15 20:50:28,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25701 states. [2019-11-15 20:50:28,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25701 states to 25701 states and 99582 transitions. [2019-11-15 20:50:28,655 INFO L78 Accepts]: Start accepts. Automaton has 25701 states and 99582 transitions. Word has length 32 [2019-11-15 20:50:28,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:28,655 INFO L462 AbstractCegarLoop]: Abstraction has 25701 states and 99582 transitions. [2019-11-15 20:50:28,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:50:28,656 INFO L276 IsEmpty]: Start isEmpty. Operand 25701 states and 99582 transitions. [2019-11-15 20:50:28,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 20:50:28,664 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:28,664 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:50:28,665 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:28,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:28,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1112209964, now seen corresponding path program 1 times [2019-11-15 20:50:28,666 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:28,666 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422473684] [2019-11-15 20:50:28,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:28,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:28,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:28,772 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 20:50:28,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422473684] [2019-11-15 20:50:28,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:28,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:50:28,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139635309] [2019-11-15 20:50:28,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:50:28,774 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:28,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:50:28,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:50:28,775 INFO L87 Difference]: Start difference. First operand 25701 states and 99582 transitions. Second operand 5 states. [2019-11-15 20:50:29,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:29,643 INFO L93 Difference]: Finished difference Result 41079 states and 150429 transitions. [2019-11-15 20:50:29,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:50:29,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-15 20:50:29,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:29,786 INFO L225 Difference]: With dead ends: 41079 [2019-11-15 20:50:29,786 INFO L226 Difference]: Without dead ends: 40543 [2019-11-15 20:50:29,787 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 20:50:30,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40543 states. [2019-11-15 20:50:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40543 to 38923. [2019-11-15 20:50:31,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38923 states. [2019-11-15 20:50:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38923 states to 38923 states and 143579 transitions. [2019-11-15 20:50:31,312 INFO L78 Accepts]: Start accepts. Automaton has 38923 states and 143579 transitions. Word has length 44 [2019-11-15 20:50:31,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:31,321 INFO L462 AbstractCegarLoop]: Abstraction has 38923 states and 143579 transitions. [2019-11-15 20:50:31,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:50:31,322 INFO L276 IsEmpty]: Start isEmpty. Operand 38923 states and 143579 transitions. [2019-11-15 20:50:31,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 20:50:31,330 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:31,330 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:50:31,330 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:31,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:31,331 INFO L82 PathProgramCache]: Analyzing trace with hash -64291244, now seen corresponding path program 1 times [2019-11-15 20:50:31,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:31,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116330591] [2019-11-15 20:50:31,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:31,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:31,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:31,469 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 20:50:31,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116330591] [2019-11-15 20:50:31,472 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:31,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:50:31,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078435823] [2019-11-15 20:50:31,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:50:31,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:31,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:50:31,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:50:31,473 INFO L87 Difference]: Start difference. First operand 38923 states and 143579 transitions. Second operand 5 states. [2019-11-15 20:50:32,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:32,108 INFO L93 Difference]: Finished difference Result 49776 states and 180631 transitions. [2019-11-15 20:50:32,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:50:32,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-15 20:50:32,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:32,274 INFO L225 Difference]: With dead ends: 49776 [2019-11-15 20:50:32,274 INFO L226 Difference]: Without dead ends: 49272 [2019-11-15 20:50:32,275 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 20:50:33,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49272 states. [2019-11-15 20:50:33,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49272 to 42675. [2019-11-15 20:50:33,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42675 states. [2019-11-15 20:50:34,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42675 states to 42675 states and 156590 transitions. [2019-11-15 20:50:34,005 INFO L78 Accepts]: Start accepts. Automaton has 42675 states and 156590 transitions. Word has length 45 [2019-11-15 20:50:34,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:34,005 INFO L462 AbstractCegarLoop]: Abstraction has 42675 states and 156590 transitions. [2019-11-15 20:50:34,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:50:34,005 INFO L276 IsEmpty]: Start isEmpty. Operand 42675 states and 156590 transitions. [2019-11-15 20:50:34,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 20:50:34,013 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:34,013 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 20:50:34,014 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:34,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:34,014 INFO L82 PathProgramCache]: Analyzing trace with hash -683113030, now seen corresponding path program 1 times [2019-11-15 20:50:34,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:34,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603088604] [2019-11-15 20:50:34,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:34,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:34,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:34,068 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 20:50:34,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603088604] [2019-11-15 20:50:34,069 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:34,069 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:50:34,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654706754] [2019-11-15 20:50:34,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:50:34,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:34,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:50:34,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:50:34,070 INFO L87 Difference]: Start difference. First operand 42675 states and 156590 transitions. Second operand 3 states. [2019-11-15 20:50:35,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:35,043 INFO L93 Difference]: Finished difference Result 61085 states and 221428 transitions. [2019-11-15 20:50:35,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:50:35,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-15 20:50:35,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:35,167 INFO L225 Difference]: With dead ends: 61085 [2019-11-15 20:50:35,167 INFO L226 Difference]: Without dead ends: 61085 [2019-11-15 20:50:35,167 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 20:50:35,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61085 states. [2019-11-15 20:50:36,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61085 to 48014. [2019-11-15 20:50:36,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48014 states. [2019-11-15 20:50:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48014 states to 48014 states and 174177 transitions. [2019-11-15 20:50:36,198 INFO L78 Accepts]: Start accepts. Automaton has 48014 states and 174177 transitions. Word has length 47 [2019-11-15 20:50:36,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:36,198 INFO L462 AbstractCegarLoop]: Abstraction has 48014 states and 174177 transitions. [2019-11-15 20:50:36,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:50:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 48014 states and 174177 transitions. [2019-11-15 20:50:36,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 20:50:36,211 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:36,211 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:50:36,212 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:36,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:36,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1641831505, now seen corresponding path program 1 times [2019-11-15 20:50:36,212 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:36,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210875214] [2019-11-15 20:50:36,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:36,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:36,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:36,348 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 20:50:36,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210875214] [2019-11-15 20:50:36,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:36,350 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:50:36,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617721732] [2019-11-15 20:50:36,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:50:36,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:36,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:50:36,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:50:36,351 INFO L87 Difference]: Start difference. First operand 48014 states and 174177 transitions. Second operand 6 states. [2019-11-15 20:50:37,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:37,127 INFO L93 Difference]: Finished difference Result 63754 states and 229377 transitions. [2019-11-15 20:50:37,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:50:37,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-15 20:50:37,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:37,265 INFO L225 Difference]: With dead ends: 63754 [2019-11-15 20:50:37,265 INFO L226 Difference]: Without dead ends: 63754 [2019-11-15 20:50:37,265 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 20:50:38,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63754 states. [2019-11-15 20:50:38,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63754 to 59947. [2019-11-15 20:50:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59947 states. [2019-11-15 20:50:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59947 states to 59947 states and 215670 transitions. [2019-11-15 20:50:39,114 INFO L78 Accepts]: Start accepts. Automaton has 59947 states and 215670 transitions. Word has length 51 [2019-11-15 20:50:39,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:39,114 INFO L462 AbstractCegarLoop]: Abstraction has 59947 states and 215670 transitions. [2019-11-15 20:50:39,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:50:39,115 INFO L276 IsEmpty]: Start isEmpty. Operand 59947 states and 215670 transitions. [2019-11-15 20:50:39,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 20:50:39,129 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:39,129 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:50:39,129 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:39,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:39,130 INFO L82 PathProgramCache]: Analyzing trace with hash 856184432, now seen corresponding path program 1 times [2019-11-15 20:50:39,130 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:39,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438261872] [2019-11-15 20:50:39,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:39,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:39,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:39,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:50:39,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438261872] [2019-11-15 20:50:39,244 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:39,244 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:50:39,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275821338] [2019-11-15 20:50:39,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:50:39,245 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:39,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:50:39,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:50:39,246 INFO L87 Difference]: Start difference. First operand 59947 states and 215670 transitions. Second operand 7 states. [2019-11-15 20:50:40,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:40,377 INFO L93 Difference]: Finished difference Result 83683 states and 290095 transitions. [2019-11-15 20:50:40,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:50:40,378 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-11-15 20:50:40,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:40,552 INFO L225 Difference]: With dead ends: 83683 [2019-11-15 20:50:40,552 INFO L226 Difference]: Without dead ends: 83683 [2019-11-15 20:50:40,553 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:50:41,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83683 states. [2019-11-15 20:50:42,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83683 to 71010. [2019-11-15 20:50:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71010 states. [2019-11-15 20:50:42,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71010 states to 71010 states and 249884 transitions. [2019-11-15 20:50:42,524 INFO L78 Accepts]: Start accepts. Automaton has 71010 states and 249884 transitions. Word has length 51 [2019-11-15 20:50:42,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:42,525 INFO L462 AbstractCegarLoop]: Abstraction has 71010 states and 249884 transitions. [2019-11-15 20:50:42,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:50:42,525 INFO L276 IsEmpty]: Start isEmpty. Operand 71010 states and 249884 transitions. [2019-11-15 20:50:42,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 20:50:42,538 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:42,538 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:50:42,538 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:42,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:42,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1743688113, now seen corresponding path program 1 times [2019-11-15 20:50:42,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:42,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988033641] [2019-11-15 20:50:42,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:42,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:42,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:42,645 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 20:50:42,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988033641] [2019-11-15 20:50:42,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:42,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:50:42,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638661305] [2019-11-15 20:50:42,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:50:42,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:42,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:50:42,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:50:42,647 INFO L87 Difference]: Start difference. First operand 71010 states and 249884 transitions. Second operand 4 states. [2019-11-15 20:50:42,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:42,724 INFO L93 Difference]: Finished difference Result 12157 states and 37827 transitions. [2019-11-15 20:50:42,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:50:42,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-15 20:50:42,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:42,744 INFO L225 Difference]: With dead ends: 12157 [2019-11-15 20:50:42,745 INFO L226 Difference]: Without dead ends: 10672 [2019-11-15 20:50:42,745 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 20:50:42,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10672 states. [2019-11-15 20:50:42,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10672 to 10623. [2019-11-15 20:50:42,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10623 states. [2019-11-15 20:50:42,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10623 states to 10623 states and 32589 transitions. [2019-11-15 20:50:42,924 INFO L78 Accepts]: Start accepts. Automaton has 10623 states and 32589 transitions. Word has length 51 [2019-11-15 20:50:42,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:42,925 INFO L462 AbstractCegarLoop]: Abstraction has 10623 states and 32589 transitions. [2019-11-15 20:50:42,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:50:42,925 INFO L276 IsEmpty]: Start isEmpty. Operand 10623 states and 32589 transitions. [2019-11-15 20:50:42,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 20:50:42,927 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:42,927 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:50:42,927 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:42,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:42,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1023975291, now seen corresponding path program 1 times [2019-11-15 20:50:42,928 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:42,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154045389] [2019-11-15 20:50:42,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:42,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:42,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:43,035 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 20:50:43,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154045389] [2019-11-15 20:50:43,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:43,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:50:43,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036537389] [2019-11-15 20:50:43,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:50:43,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:43,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:50:43,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:50:43,037 INFO L87 Difference]: Start difference. First operand 10623 states and 32589 transitions. Second operand 6 states. [2019-11-15 20:50:43,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:43,496 INFO L93 Difference]: Finished difference Result 13180 states and 39870 transitions. [2019-11-15 20:50:43,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:50:43,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-15 20:50:43,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:43,515 INFO L225 Difference]: With dead ends: 13180 [2019-11-15 20:50:43,515 INFO L226 Difference]: Without dead ends: 13117 [2019-11-15 20:50:43,516 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:50:43,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13117 states. [2019-11-15 20:50:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13117 to 11046. [2019-11-15 20:50:43,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11046 states. [2019-11-15 20:50:43,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11046 states to 11046 states and 33783 transitions. [2019-11-15 20:50:43,666 INFO L78 Accepts]: Start accepts. Automaton has 11046 states and 33783 transitions. Word has length 51 [2019-11-15 20:50:43,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:43,667 INFO L462 AbstractCegarLoop]: Abstraction has 11046 states and 33783 transitions. [2019-11-15 20:50:43,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:50:43,667 INFO L276 IsEmpty]: Start isEmpty. Operand 11046 states and 33783 transitions. [2019-11-15 20:50:43,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 20:50:43,670 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:43,670 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] [2019-11-15 20:50:43,670 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:43,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:43,671 INFO L82 PathProgramCache]: Analyzing trace with hash -126708958, now seen corresponding path program 1 times [2019-11-15 20:50:43,671 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:43,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764556574] [2019-11-15 20:50:43,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:43,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:43,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:43,727 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 20:50:43,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764556574] [2019-11-15 20:50:43,728 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:43,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:50:43,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963503021] [2019-11-15 20:50:43,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:50:43,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:43,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:50:43,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:50:43,730 INFO L87 Difference]: Start difference. First operand 11046 states and 33783 transitions. Second operand 4 states. [2019-11-15 20:50:43,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:43,867 INFO L93 Difference]: Finished difference Result 12860 states and 39389 transitions. [2019-11-15 20:50:43,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:50:43,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 20:50:43,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:43,886 INFO L225 Difference]: With dead ends: 12860 [2019-11-15 20:50:43,886 INFO L226 Difference]: Without dead ends: 12860 [2019-11-15 20:50:43,886 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 20:50:43,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12860 states. [2019-11-15 20:50:44,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12860 to 11691. [2019-11-15 20:50:44,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11691 states. [2019-11-15 20:50:44,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11691 states to 11691 states and 35760 transitions. [2019-11-15 20:50:44,042 INFO L78 Accepts]: Start accepts. Automaton has 11691 states and 35760 transitions. Word has length 59 [2019-11-15 20:50:44,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:44,042 INFO L462 AbstractCegarLoop]: Abstraction has 11691 states and 35760 transitions. [2019-11-15 20:50:44,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:50:44,042 INFO L276 IsEmpty]: Start isEmpty. Operand 11691 states and 35760 transitions. [2019-11-15 20:50:44,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 20:50:44,046 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:44,046 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] [2019-11-15 20:50:44,046 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:44,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:44,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1616101377, now seen corresponding path program 1 times [2019-11-15 20:50:44,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:44,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779265943] [2019-11-15 20:50:44,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:44,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:44,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:44,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 20:50:44,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779265943] [2019-11-15 20:50:44,113 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:44,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:50:44,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279314990] [2019-11-15 20:50:44,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:50:44,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:44,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:50:44,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:50:44,114 INFO L87 Difference]: Start difference. First operand 11691 states and 35760 transitions. Second operand 6 states. [2019-11-15 20:50:44,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:44,622 INFO L93 Difference]: Finished difference Result 14217 states and 42858 transitions. [2019-11-15 20:50:44,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:50:44,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-11-15 20:50:44,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:44,648 INFO L225 Difference]: With dead ends: 14217 [2019-11-15 20:50:44,649 INFO L226 Difference]: Without dead ends: 14156 [2019-11-15 20:50:44,653 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 20:50:44,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14156 states. [2019-11-15 20:50:44,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14156 to 13459. [2019-11-15 20:50:44,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13459 states. [2019-11-15 20:50:44,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13459 states to 13459 states and 40777 transitions. [2019-11-15 20:50:44,937 INFO L78 Accepts]: Start accepts. Automaton has 13459 states and 40777 transitions. Word has length 59 [2019-11-15 20:50:44,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:44,937 INFO L462 AbstractCegarLoop]: Abstraction has 13459 states and 40777 transitions. [2019-11-15 20:50:44,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:50:44,937 INFO L276 IsEmpty]: Start isEmpty. Operand 13459 states and 40777 transitions. [2019-11-15 20:50:44,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 20:50:44,942 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:44,942 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] [2019-11-15 20:50:44,943 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:44,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:44,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1913952989, now seen corresponding path program 1 times [2019-11-15 20:50:44,943 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:44,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068639860] [2019-11-15 20:50:44,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:44,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:44,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:45,007 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 20:50:45,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068639860] [2019-11-15 20:50:45,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:45,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:50:45,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717386017] [2019-11-15 20:50:45,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:50:45,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:45,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:50:45,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:50:45,008 INFO L87 Difference]: Start difference. First operand 13459 states and 40777 transitions. Second operand 4 states. [2019-11-15 20:50:45,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:45,363 INFO L93 Difference]: Finished difference Result 16501 states and 49369 transitions. [2019-11-15 20:50:45,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:50:45,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-15 20:50:45,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:45,394 INFO L225 Difference]: With dead ends: 16501 [2019-11-15 20:50:45,394 INFO L226 Difference]: Without dead ends: 16501 [2019-11-15 20:50:45,395 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 20:50:45,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16501 states. [2019-11-15 20:50:45,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16501 to 14980. [2019-11-15 20:50:45,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14980 states. [2019-11-15 20:50:45,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14980 states to 14980 states and 44958 transitions. [2019-11-15 20:50:45,643 INFO L78 Accepts]: Start accepts. Automaton has 14980 states and 44958 transitions. Word has length 63 [2019-11-15 20:50:45,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:45,644 INFO L462 AbstractCegarLoop]: Abstraction has 14980 states and 44958 transitions. [2019-11-15 20:50:45,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:50:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 14980 states and 44958 transitions. [2019-11-15 20:50:45,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 20:50:45,651 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:45,651 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] [2019-11-15 20:50:45,651 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:45,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:45,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1659216444, now seen corresponding path program 1 times [2019-11-15 20:50:45,652 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:45,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556071028] [2019-11-15 20:50:45,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:45,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:45,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:45,687 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 20:50:45,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556071028] [2019-11-15 20:50:45,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:45,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:50:45,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017507705] [2019-11-15 20:50:45,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:50:45,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:45,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:50:45,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:50:45,689 INFO L87 Difference]: Start difference. First operand 14980 states and 44958 transitions. Second operand 3 states. [2019-11-15 20:50:45,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:45,933 INFO L93 Difference]: Finished difference Result 15528 states and 46401 transitions. [2019-11-15 20:50:45,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:50:45,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-15 20:50:45,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:45,955 INFO L225 Difference]: With dead ends: 15528 [2019-11-15 20:50:45,955 INFO L226 Difference]: Without dead ends: 15528 [2019-11-15 20:50:45,955 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 20:50:45,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15528 states. [2019-11-15 20:50:46,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15528 to 15274. [2019-11-15 20:50:46,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15274 states. [2019-11-15 20:50:46,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15274 states to 15274 states and 45726 transitions. [2019-11-15 20:50:46,152 INFO L78 Accepts]: Start accepts. Automaton has 15274 states and 45726 transitions. Word has length 63 [2019-11-15 20:50:46,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:46,152 INFO L462 AbstractCegarLoop]: Abstraction has 15274 states and 45726 transitions. [2019-11-15 20:50:46,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:50:46,152 INFO L276 IsEmpty]: Start isEmpty. Operand 15274 states and 45726 transitions. [2019-11-15 20:50:46,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 20:50:46,160 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:46,160 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:50:46,160 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:46,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:46,160 INFO L82 PathProgramCache]: Analyzing trace with hash -939220032, now seen corresponding path program 1 times [2019-11-15 20:50:46,161 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:46,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81448517] [2019-11-15 20:50:46,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:46,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:46,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:46,254 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 20:50:46,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81448517] [2019-11-15 20:50:46,254 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:46,255 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:50:46,255 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223378963] [2019-11-15 20:50:46,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:50:46,255 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:46,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:50:46,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:50:46,256 INFO L87 Difference]: Start difference. First operand 15274 states and 45726 transitions. Second operand 6 states. [2019-11-15 20:50:46,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:46,905 INFO L93 Difference]: Finished difference Result 16271 states and 48101 transitions. [2019-11-15 20:50:46,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:50:46,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-15 20:50:46,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:46,930 INFO L225 Difference]: With dead ends: 16271 [2019-11-15 20:50:46,930 INFO L226 Difference]: Without dead ends: 16271 [2019-11-15 20:50:46,930 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 20:50:46,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16271 states. [2019-11-15 20:50:47,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16271 to 15847. [2019-11-15 20:50:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15847 states. [2019-11-15 20:50:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15847 states to 15847 states and 47023 transitions. [2019-11-15 20:50:47,135 INFO L78 Accepts]: Start accepts. Automaton has 15847 states and 47023 transitions. Word has length 65 [2019-11-15 20:50:47,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:47,136 INFO L462 AbstractCegarLoop]: Abstraction has 15847 states and 47023 transitions. [2019-11-15 20:50:47,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:50:47,136 INFO L276 IsEmpty]: Start isEmpty. Operand 15847 states and 47023 transitions. [2019-11-15 20:50:47,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 20:50:47,145 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:47,145 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:50:47,145 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:47,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:47,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1193956577, now seen corresponding path program 1 times [2019-11-15 20:50:47,145 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:47,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280414666] [2019-11-15 20:50:47,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:47,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:47,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:47,272 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 20:50:47,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280414666] [2019-11-15 20:50:47,273 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:47,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:50:47,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643190621] [2019-11-15 20:50:47,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:50:47,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:47,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:50:47,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:50:47,274 INFO L87 Difference]: Start difference. First operand 15847 states and 47023 transitions. Second operand 6 states. [2019-11-15 20:50:47,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:47,778 INFO L93 Difference]: Finished difference Result 18158 states and 52351 transitions. [2019-11-15 20:50:47,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:50:47,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-15 20:50:47,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:47,802 INFO L225 Difference]: With dead ends: 18158 [2019-11-15 20:50:47,802 INFO L226 Difference]: Without dead ends: 18158 [2019-11-15 20:50:47,802 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 20:50:47,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18158 states. [2019-11-15 20:50:47,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18158 to 16539. [2019-11-15 20:50:47,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16539 states. [2019-11-15 20:50:48,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16539 states to 16539 states and 48243 transitions. [2019-11-15 20:50:48,021 INFO L78 Accepts]: Start accepts. Automaton has 16539 states and 48243 transitions. Word has length 65 [2019-11-15 20:50:48,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:48,021 INFO L462 AbstractCegarLoop]: Abstraction has 16539 states and 48243 transitions. [2019-11-15 20:50:48,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:50:48,021 INFO L276 IsEmpty]: Start isEmpty. Operand 16539 states and 48243 transitions. [2019-11-15 20:50:48,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 20:50:48,031 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:48,031 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:50:48,032 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:48,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:48,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1260963330, now seen corresponding path program 1 times [2019-11-15 20:50:48,032 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:48,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928114460] [2019-11-15 20:50:48,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:48,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:48,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:48,113 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 20:50:48,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928114460] [2019-11-15 20:50:48,113 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:48,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:50:48,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104092121] [2019-11-15 20:50:48,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:50:48,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:48,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:50:48,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:50:48,115 INFO L87 Difference]: Start difference. First operand 16539 states and 48243 transitions. Second operand 5 states. [2019-11-15 20:50:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:48,563 INFO L93 Difference]: Finished difference Result 21453 states and 62483 transitions. [2019-11-15 20:50:48,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:50:48,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-15 20:50:48,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:48,591 INFO L225 Difference]: With dead ends: 21453 [2019-11-15 20:50:48,592 INFO L226 Difference]: Without dead ends: 21453 [2019-11-15 20:50:48,592 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 20:50:48,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21453 states. [2019-11-15 20:50:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21453 to 19518. [2019-11-15 20:50:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19518 states. [2019-11-15 20:50:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19518 states to 19518 states and 56652 transitions. [2019-11-15 20:50:48,849 INFO L78 Accepts]: Start accepts. Automaton has 19518 states and 56652 transitions. Word has length 65 [2019-11-15 20:50:48,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:48,849 INFO L462 AbstractCegarLoop]: Abstraction has 19518 states and 56652 transitions. [2019-11-15 20:50:48,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:50:48,849 INFO L276 IsEmpty]: Start isEmpty. Operand 19518 states and 56652 transitions. [2019-11-15 20:50:48,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 20:50:48,860 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:48,860 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:50:48,860 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:48,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:48,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1771497507, now seen corresponding path program 1 times [2019-11-15 20:50:48,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:48,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951175624] [2019-11-15 20:50:48,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:48,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:48,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:48,916 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 20:50:48,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951175624] [2019-11-15 20:50:48,917 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:48,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:50:48,917 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448446857] [2019-11-15 20:50:48,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:50:48,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:48,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:50:48,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:50:48,918 INFO L87 Difference]: Start difference. First operand 19518 states and 56652 transitions. Second operand 5 states. [2019-11-15 20:50:49,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:49,534 INFO L93 Difference]: Finished difference Result 26405 states and 76310 transitions. [2019-11-15 20:50:49,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:50:49,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-15 20:50:49,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:49,585 INFO L225 Difference]: With dead ends: 26405 [2019-11-15 20:50:49,585 INFO L226 Difference]: Without dead ends: 26405 [2019-11-15 20:50:49,585 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 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 20:50:49,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26405 states. [2019-11-15 20:50:50,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26405 to 21406. [2019-11-15 20:50:50,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21406 states. [2019-11-15 20:50:50,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21406 states to 21406 states and 61926 transitions. [2019-11-15 20:50:50,045 INFO L78 Accepts]: Start accepts. Automaton has 21406 states and 61926 transitions. Word has length 65 [2019-11-15 20:50:50,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:50,045 INFO L462 AbstractCegarLoop]: Abstraction has 21406 states and 61926 transitions. [2019-11-15 20:50:50,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:50:50,045 INFO L276 IsEmpty]: Start isEmpty. Operand 21406 states and 61926 transitions. [2019-11-15 20:50:50,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 20:50:50,055 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:50,055 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:50:50,055 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:50,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:50,056 INFO L82 PathProgramCache]: Analyzing trace with hash 716015326, now seen corresponding path program 1 times [2019-11-15 20:50:50,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:50,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978162037] [2019-11-15 20:50:50,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:50,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:50,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:50,116 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 20:50:50,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978162037] [2019-11-15 20:50:50,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:50,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:50:50,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461628410] [2019-11-15 20:50:50,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:50:50,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:50,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:50:50,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:50:50,119 INFO L87 Difference]: Start difference. First operand 21406 states and 61926 transitions. Second operand 4 states. [2019-11-15 20:50:50,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:50,681 INFO L93 Difference]: Finished difference Result 27967 states and 81348 transitions. [2019-11-15 20:50:50,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:50:50,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-15 20:50:50,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:50,721 INFO L225 Difference]: With dead ends: 27967 [2019-11-15 20:50:50,721 INFO L226 Difference]: Without dead ends: 27832 [2019-11-15 20:50:50,722 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 20:50:50,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27832 states. [2019-11-15 20:50:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27832 to 25843. [2019-11-15 20:50:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25843 states. [2019-11-15 20:50:51,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25843 states to 25843 states and 75186 transitions. [2019-11-15 20:50:51,078 INFO L78 Accepts]: Start accepts. Automaton has 25843 states and 75186 transitions. Word has length 65 [2019-11-15 20:50:51,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:51,078 INFO L462 AbstractCegarLoop]: Abstraction has 25843 states and 75186 transitions. [2019-11-15 20:50:51,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:50:51,079 INFO L276 IsEmpty]: Start isEmpty. Operand 25843 states and 75186 transitions. [2019-11-15 20:50:51,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 20:50:51,086 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:51,087 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:50:51,087 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:51,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:51,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1080936033, now seen corresponding path program 1 times [2019-11-15 20:50:51,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:51,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269617233] [2019-11-15 20:50:51,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:51,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:51,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:51,213 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 20:50:51,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269617233] [2019-11-15 20:50:51,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:51,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:50:51,214 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857117120] [2019-11-15 20:50:51,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:50:51,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:51,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:50:51,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:50:51,215 INFO L87 Difference]: Start difference. First operand 25843 states and 75186 transitions. Second operand 7 states. [2019-11-15 20:50:51,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:51,713 INFO L93 Difference]: Finished difference Result 23111 states and 64208 transitions. [2019-11-15 20:50:51,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:50:51,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-11-15 20:50:51,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:51,740 INFO L225 Difference]: With dead ends: 23111 [2019-11-15 20:50:51,740 INFO L226 Difference]: Without dead ends: 23111 [2019-11-15 20:50:51,741 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:50:51,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23111 states. [2019-11-15 20:50:51,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23111 to 18807. [2019-11-15 20:50:51,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18807 states. [2019-11-15 20:50:51,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18807 states to 18807 states and 52243 transitions. [2019-11-15 20:50:51,986 INFO L78 Accepts]: Start accepts. Automaton has 18807 states and 52243 transitions. Word has length 65 [2019-11-15 20:50:51,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:51,986 INFO L462 AbstractCegarLoop]: Abstraction has 18807 states and 52243 transitions. [2019-11-15 20:50:51,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:50:51,987 INFO L276 IsEmpty]: Start isEmpty. Operand 18807 states and 52243 transitions. [2019-11-15 20:50:51,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 20:50:51,993 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:51,993 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:50:51,993 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:51,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:51,994 INFO L82 PathProgramCache]: Analyzing trace with hash -193432352, now seen corresponding path program 1 times [2019-11-15 20:50:51,994 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:51,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663796231] [2019-11-15 20:50:51,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:51,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:51,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:52,068 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 20:50:52,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663796231] [2019-11-15 20:50:52,069 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:52,069 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:50:52,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609087392] [2019-11-15 20:50:52,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:50:52,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:52,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:50:52,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:50:52,070 INFO L87 Difference]: Start difference. First operand 18807 states and 52243 transitions. Second operand 5 states. [2019-11-15 20:50:52,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:52,118 INFO L93 Difference]: Finished difference Result 6129 states and 14460 transitions. [2019-11-15 20:50:52,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:50:52,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-15 20:50:52,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:52,123 INFO L225 Difference]: With dead ends: 6129 [2019-11-15 20:50:52,123 INFO L226 Difference]: Without dead ends: 5259 [2019-11-15 20:50:52,124 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 20:50:52,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2019-11-15 20:50:52,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 4724. [2019-11-15 20:50:52,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4724 states. [2019-11-15 20:50:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4724 states to 4724 states and 10819 transitions. [2019-11-15 20:50:52,169 INFO L78 Accepts]: Start accepts. Automaton has 4724 states and 10819 transitions. Word has length 65 [2019-11-15 20:50:52,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:52,169 INFO L462 AbstractCegarLoop]: Abstraction has 4724 states and 10819 transitions. [2019-11-15 20:50:52,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:50:52,170 INFO L276 IsEmpty]: Start isEmpty. Operand 4724 states and 10819 transitions. [2019-11-15 20:50:52,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 20:50:52,173 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:52,173 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:50:52,173 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:52,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:52,174 INFO L82 PathProgramCache]: Analyzing trace with hash -2083784590, now seen corresponding path program 1 times [2019-11-15 20:50:52,174 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:52,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977039332] [2019-11-15 20:50:52,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:52,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:52,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:52,204 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 20:50:52,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977039332] [2019-11-15 20:50:52,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:52,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:50:52,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405039711] [2019-11-15 20:50:52,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:50:52,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:52,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:50:52,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:50:52,205 INFO L87 Difference]: Start difference. First operand 4724 states and 10819 transitions. Second operand 3 states. [2019-11-15 20:50:52,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:52,247 INFO L93 Difference]: Finished difference Result 5854 states and 13185 transitions. [2019-11-15 20:50:52,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:50:52,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-15 20:50:52,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:52,254 INFO L225 Difference]: With dead ends: 5854 [2019-11-15 20:50:52,254 INFO L226 Difference]: Without dead ends: 5854 [2019-11-15 20:50:52,255 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 20:50:52,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5854 states. [2019-11-15 20:50:52,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5854 to 4659. [2019-11-15 20:50:52,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4659 states. [2019-11-15 20:50:52,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4659 states to 4659 states and 10381 transitions. [2019-11-15 20:50:52,319 INFO L78 Accepts]: Start accepts. Automaton has 4659 states and 10381 transitions. Word has length 65 [2019-11-15 20:50:52,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:52,319 INFO L462 AbstractCegarLoop]: Abstraction has 4659 states and 10381 transitions. [2019-11-15 20:50:52,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:50:52,320 INFO L276 IsEmpty]: Start isEmpty. Operand 4659 states and 10381 transitions. [2019-11-15 20:50:52,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 20:50:52,325 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:52,325 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] [2019-11-15 20:50:52,325 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:52,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:52,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1306291909, now seen corresponding path program 1 times [2019-11-15 20:50:52,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:52,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672041079] [2019-11-15 20:50:52,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:52,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:52,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:52,406 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 20:50:52,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672041079] [2019-11-15 20:50:52,406 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:52,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:50:52,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365765144] [2019-11-15 20:50:52,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:50:52,407 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:52,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:50:52,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:50:52,408 INFO L87 Difference]: Start difference. First operand 4659 states and 10381 transitions. Second operand 5 states. [2019-11-15 20:50:52,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:52,608 INFO L93 Difference]: Finished difference Result 5720 states and 12810 transitions. [2019-11-15 20:50:52,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:50:52,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-15 20:50:52,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:52,615 INFO L225 Difference]: With dead ends: 5720 [2019-11-15 20:50:52,615 INFO L226 Difference]: Without dead ends: 5720 [2019-11-15 20:50:52,616 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:50:52,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5720 states. [2019-11-15 20:50:52,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5720 to 5079. [2019-11-15 20:50:52,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5079 states. [2019-11-15 20:50:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5079 states to 5079 states and 11339 transitions. [2019-11-15 20:50:52,684 INFO L78 Accepts]: Start accepts. Automaton has 5079 states and 11339 transitions. Word has length 71 [2019-11-15 20:50:52,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:52,684 INFO L462 AbstractCegarLoop]: Abstraction has 5079 states and 11339 transitions. [2019-11-15 20:50:52,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:50:52,684 INFO L276 IsEmpty]: Start isEmpty. Operand 5079 states and 11339 transitions. [2019-11-15 20:50:52,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 20:50:52,690 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:52,690 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] [2019-11-15 20:50:52,691 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:52,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:52,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1245865052, now seen corresponding path program 1 times [2019-11-15 20:50:52,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:52,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864262791] [2019-11-15 20:50:52,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:52,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:52,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:52,789 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 20:50:52,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864262791] [2019-11-15 20:50:52,790 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:52,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:50:52,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450490284] [2019-11-15 20:50:52,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:50:52,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:52,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:50:52,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:50:52,792 INFO L87 Difference]: Start difference. First operand 5079 states and 11339 transitions. Second operand 7 states. [2019-11-15 20:50:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:53,183 INFO L93 Difference]: Finished difference Result 5819 states and 12862 transitions. [2019-11-15 20:50:53,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:50:53,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-11-15 20:50:53,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:53,188 INFO L225 Difference]: With dead ends: 5819 [2019-11-15 20:50:53,188 INFO L226 Difference]: Without dead ends: 5766 [2019-11-15 20:50:53,188 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 20:50:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2019-11-15 20:50:53,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 5166. [2019-11-15 20:50:53,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2019-11-15 20:50:53,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 11428 transitions. [2019-11-15 20:50:53,236 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 11428 transitions. Word has length 71 [2019-11-15 20:50:53,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:53,236 INFO L462 AbstractCegarLoop]: Abstraction has 5166 states and 11428 transitions. [2019-11-15 20:50:53,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:50:53,237 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 11428 transitions. [2019-11-15 20:50:53,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 20:50:53,240 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:53,241 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] [2019-11-15 20:50:53,241 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:53,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:53,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1822532973, now seen corresponding path program 1 times [2019-11-15 20:50:53,241 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:53,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037402306] [2019-11-15 20:50:53,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:53,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:53,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:53,406 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 20:50:53,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037402306] [2019-11-15 20:50:53,406 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:53,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 20:50:53,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622011578] [2019-11-15 20:50:53,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:50:53,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:53,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:50:53,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:50:53,411 INFO L87 Difference]: Start difference. First operand 5166 states and 11428 transitions. Second operand 9 states. [2019-11-15 20:50:54,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:54,208 INFO L93 Difference]: Finished difference Result 7248 states and 16035 transitions. [2019-11-15 20:50:54,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:50:54,209 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-11-15 20:50:54,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:54,215 INFO L225 Difference]: With dead ends: 7248 [2019-11-15 20:50:54,215 INFO L226 Difference]: Without dead ends: 7220 [2019-11-15 20:50:54,215 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:50:54,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7220 states. [2019-11-15 20:50:54,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7220 to 6152. [2019-11-15 20:50:54,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6152 states. [2019-11-15 20:50:54,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6152 states to 6152 states and 13790 transitions. [2019-11-15 20:50:54,297 INFO L78 Accepts]: Start accepts. Automaton has 6152 states and 13790 transitions. Word has length 92 [2019-11-15 20:50:54,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:54,297 INFO L462 AbstractCegarLoop]: Abstraction has 6152 states and 13790 transitions. [2019-11-15 20:50:54,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:50:54,298 INFO L276 IsEmpty]: Start isEmpty. Operand 6152 states and 13790 transitions. [2019-11-15 20:50:54,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 20:50:54,321 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:54,321 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] [2019-11-15 20:50:54,321 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:54,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:54,333 INFO L82 PathProgramCache]: Analyzing trace with hash -254676370, now seen corresponding path program 1 times [2019-11-15 20:50:54,333 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:54,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675869680] [2019-11-15 20:50:54,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:54,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:54,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:54,391 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 20:50:54,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675869680] [2019-11-15 20:50:54,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:54,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:50:54,392 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679611286] [2019-11-15 20:50:54,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:50:54,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:54,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:50:54,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:50:54,393 INFO L87 Difference]: Start difference. First operand 6152 states and 13790 transitions. Second operand 4 states. [2019-11-15 20:50:54,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:54,481 INFO L93 Difference]: Finished difference Result 7220 states and 16033 transitions. [2019-11-15 20:50:54,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:50:54,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-15 20:50:54,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:54,487 INFO L225 Difference]: With dead ends: 7220 [2019-11-15 20:50:54,487 INFO L226 Difference]: Without dead ends: 7220 [2019-11-15 20:50:54,488 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 20:50:54,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7220 states. [2019-11-15 20:50:54,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7220 to 6335. [2019-11-15 20:50:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6335 states. [2019-11-15 20:50:54,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6335 states to 6335 states and 14127 transitions. [2019-11-15 20:50:54,554 INFO L78 Accepts]: Start accepts. Automaton has 6335 states and 14127 transitions. Word has length 92 [2019-11-15 20:50:54,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:54,554 INFO L462 AbstractCegarLoop]: Abstraction has 6335 states and 14127 transitions. [2019-11-15 20:50:54,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:50:54,554 INFO L276 IsEmpty]: Start isEmpty. Operand 6335 states and 14127 transitions. [2019-11-15 20:50:54,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 20:50:54,561 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:54,561 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] [2019-11-15 20:50:54,562 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:54,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:54,562 INFO L82 PathProgramCache]: Analyzing trace with hash -741091311, now seen corresponding path program 1 times [2019-11-15 20:50:54,562 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:54,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852132597] [2019-11-15 20:50:54,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:54,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:54,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:54,617 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 20:50:54,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852132597] [2019-11-15 20:50:54,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:54,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:50:54,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123507396] [2019-11-15 20:50:54,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:50:54,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:54,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:50:54,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:50:54,619 INFO L87 Difference]: Start difference. First operand 6335 states and 14127 transitions. Second operand 3 states. [2019-11-15 20:50:54,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:54,730 INFO L93 Difference]: Finished difference Result 6878 states and 15281 transitions. [2019-11-15 20:50:54,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:50:54,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-15 20:50:54,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:54,737 INFO L225 Difference]: With dead ends: 6878 [2019-11-15 20:50:54,737 INFO L226 Difference]: Without dead ends: 6878 [2019-11-15 20:50:54,737 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 20:50:54,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6878 states. [2019-11-15 20:50:54,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6878 to 6808. [2019-11-15 20:50:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6808 states. [2019-11-15 20:50:54,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6808 states to 6808 states and 15131 transitions. [2019-11-15 20:50:54,803 INFO L78 Accepts]: Start accepts. Automaton has 6808 states and 15131 transitions. Word has length 94 [2019-11-15 20:50:54,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:54,804 INFO L462 AbstractCegarLoop]: Abstraction has 6808 states and 15131 transitions. [2019-11-15 20:50:54,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:50:54,804 INFO L276 IsEmpty]: Start isEmpty. Operand 6808 states and 15131 transitions. [2019-11-15 20:50:54,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 20:50:54,809 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:54,809 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] [2019-11-15 20:50:54,810 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:54,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:54,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1557627920, now seen corresponding path program 1 times [2019-11-15 20:50:54,810 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:54,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199334128] [2019-11-15 20:50:54,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:54,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:54,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:54,872 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 20:50:54,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199334128] [2019-11-15 20:50:54,873 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:54,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:50:54,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167391316] [2019-11-15 20:50:54,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:50:54,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:54,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:50:54,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:50:54,874 INFO L87 Difference]: Start difference. First operand 6808 states and 15131 transitions. Second operand 5 states. [2019-11-15 20:50:54,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:54,986 INFO L93 Difference]: Finished difference Result 7076 states and 15692 transitions. [2019-11-15 20:50:54,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:50:54,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-15 20:50:54,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:54,993 INFO L225 Difference]: With dead ends: 7076 [2019-11-15 20:50:54,993 INFO L226 Difference]: Without dead ends: 7076 [2019-11-15 20:50:54,994 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 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 20:50:55,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7076 states. [2019-11-15 20:50:55,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7076 to 5598. [2019-11-15 20:50:55,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5598 states. [2019-11-15 20:50:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5598 states to 5598 states and 12422 transitions. [2019-11-15 20:50:55,069 INFO L78 Accepts]: Start accepts. Automaton has 5598 states and 12422 transitions. Word has length 94 [2019-11-15 20:50:55,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:55,069 INFO L462 AbstractCegarLoop]: Abstraction has 5598 states and 12422 transitions. [2019-11-15 20:50:55,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:50:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 5598 states and 12422 transitions. [2019-11-15 20:50:55,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 20:50:55,075 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:55,075 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] [2019-11-15 20:50:55,076 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:55,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:55,076 INFO L82 PathProgramCache]: Analyzing trace with hash 284400688, now seen corresponding path program 1 times [2019-11-15 20:50:55,076 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:55,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239410279] [2019-11-15 20:50:55,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:55,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:55,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:55,167 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 20:50:55,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239410279] [2019-11-15 20:50:55,167 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:55,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:50:55,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836993506] [2019-11-15 20:50:55,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:50:55,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:55,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:50:55,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:50:55,169 INFO L87 Difference]: Start difference. First operand 5598 states and 12422 transitions. Second operand 6 states. [2019-11-15 20:50:55,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:55,466 INFO L93 Difference]: Finished difference Result 6709 states and 14763 transitions. [2019-11-15 20:50:55,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:50:55,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-11-15 20:50:55,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:55,473 INFO L225 Difference]: With dead ends: 6709 [2019-11-15 20:50:55,473 INFO L226 Difference]: Without dead ends: 6709 [2019-11-15 20:50:55,473 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 3 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 20:50:55,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6709 states. [2019-11-15 20:50:55,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6709 to 5275. [2019-11-15 20:50:55,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5275 states. [2019-11-15 20:50:55,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5275 states to 5275 states and 11760 transitions. [2019-11-15 20:50:55,545 INFO L78 Accepts]: Start accepts. Automaton has 5275 states and 11760 transitions. Word has length 94 [2019-11-15 20:50:55,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:55,546 INFO L462 AbstractCegarLoop]: Abstraction has 5275 states and 11760 transitions. [2019-11-15 20:50:55,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:50:55,546 INFO L276 IsEmpty]: Start isEmpty. Operand 5275 states and 11760 transitions. [2019-11-15 20:50:55,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 20:50:55,551 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:55,552 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] [2019-11-15 20:50:55,552 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:55,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:55,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1740516082, now seen corresponding path program 1 times [2019-11-15 20:50:55,553 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:55,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102880790] [2019-11-15 20:50:55,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:55,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:55,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:55,749 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 20:50:55,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102880790] [2019-11-15 20:50:55,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:55,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 20:50:55,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785572931] [2019-11-15 20:50:55,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:50:55,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:55,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:50:55,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:50:55,751 INFO L87 Difference]: Start difference. First operand 5275 states and 11760 transitions. Second operand 10 states. [2019-11-15 20:50:56,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:56,587 INFO L93 Difference]: Finished difference Result 6303 states and 13926 transitions. [2019-11-15 20:50:56,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:50:56,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-11-15 20:50:56,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:56,593 INFO L225 Difference]: With dead ends: 6303 [2019-11-15 20:50:56,593 INFO L226 Difference]: Without dead ends: 6287 [2019-11-15 20:50:56,593 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:50:56,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6287 states. [2019-11-15 20:50:56,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6287 to 5580. [2019-11-15 20:50:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5580 states. [2019-11-15 20:50:56,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5580 states to 5580 states and 12441 transitions. [2019-11-15 20:50:56,648 INFO L78 Accepts]: Start accepts. Automaton has 5580 states and 12441 transitions. Word has length 94 [2019-11-15 20:50:56,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:56,648 INFO L462 AbstractCegarLoop]: Abstraction has 5580 states and 12441 transitions. [2019-11-15 20:50:56,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:50:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 5580 states and 12441 transitions. [2019-11-15 20:50:56,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 20:50:56,653 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:56,653 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] [2019-11-15 20:50:56,653 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:56,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:56,654 INFO L82 PathProgramCache]: Analyzing trace with hash -336693261, now seen corresponding path program 1 times [2019-11-15 20:50:56,654 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:56,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515993636] [2019-11-15 20:50:56,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:56,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:56,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:56,757 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 20:50:56,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515993636] [2019-11-15 20:50:56,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:56,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:50:56,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191455404] [2019-11-15 20:50:56,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:50:56,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:56,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:50:56,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:50:56,759 INFO L87 Difference]: Start difference. First operand 5580 states and 12441 transitions. Second operand 6 states. [2019-11-15 20:50:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:56,981 INFO L93 Difference]: Finished difference Result 5442 states and 11943 transitions. [2019-11-15 20:50:56,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:50:56,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-11-15 20:50:56,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:56,988 INFO L225 Difference]: With dead ends: 5442 [2019-11-15 20:50:56,988 INFO L226 Difference]: Without dead ends: 5442 [2019-11-15 20:50:56,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:50:56,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5442 states. [2019-11-15 20:50:57,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5442 to 4838. [2019-11-15 20:50:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4838 states. [2019-11-15 20:50:57,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4838 states to 4838 states and 10735 transitions. [2019-11-15 20:50:57,141 INFO L78 Accepts]: Start accepts. Automaton has 4838 states and 10735 transitions. Word has length 94 [2019-11-15 20:50:57,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:57,141 INFO L462 AbstractCegarLoop]: Abstraction has 4838 states and 10735 transitions. [2019-11-15 20:50:57,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:50:57,141 INFO L276 IsEmpty]: Start isEmpty. Operand 4838 states and 10735 transitions. [2019-11-15 20:50:57,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 20:50:57,146 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:57,146 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] [2019-11-15 20:50:57,146 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:57,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:57,146 INFO L82 PathProgramCache]: Analyzing trace with hash 819614451, now seen corresponding path program 1 times [2019-11-15 20:50:57,147 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:57,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124439783] [2019-11-15 20:50:57,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:57,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:57,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:57,311 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 20:50:57,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124439783] [2019-11-15 20:50:57,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:57,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 20:50:57,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532498355] [2019-11-15 20:50:57,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:50:57,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:57,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:50:57,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:50:57,314 INFO L87 Difference]: Start difference. First operand 4838 states and 10735 transitions. Second operand 9 states. [2019-11-15 20:50:57,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:57,831 INFO L93 Difference]: Finished difference Result 6317 states and 13852 transitions. [2019-11-15 20:50:57,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 20:50:57,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-11-15 20:50:57,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:57,836 INFO L225 Difference]: With dead ends: 6317 [2019-11-15 20:50:57,836 INFO L226 Difference]: Without dead ends: 6317 [2019-11-15 20:50:57,837 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-11-15 20:50:57,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6317 states. [2019-11-15 20:50:57,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6317 to 5263. [2019-11-15 20:50:57,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5263 states. [2019-11-15 20:50:57,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5263 states to 5263 states and 11595 transitions. [2019-11-15 20:50:57,889 INFO L78 Accepts]: Start accepts. Automaton has 5263 states and 11595 transitions. Word has length 94 [2019-11-15 20:50:57,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:57,889 INFO L462 AbstractCegarLoop]: Abstraction has 5263 states and 11595 transitions. [2019-11-15 20:50:57,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:50:57,889 INFO L276 IsEmpty]: Start isEmpty. Operand 5263 states and 11595 transitions. [2019-11-15 20:50:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 20:50:57,893 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:57,893 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] [2019-11-15 20:50:57,893 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:57,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:57,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1030965364, now seen corresponding path program 1 times [2019-11-15 20:50:57,894 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:57,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299874481] [2019-11-15 20:50:57,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:57,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:57,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:58,058 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 20:50:58,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299874481] [2019-11-15 20:50:58,059 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:58,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 20:50:58,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073610909] [2019-11-15 20:50:58,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:50:58,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:58,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:50:58,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:50:58,061 INFO L87 Difference]: Start difference. First operand 5263 states and 11595 transitions. Second operand 9 states. [2019-11-15 20:50:58,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:58,694 INFO L93 Difference]: Finished difference Result 6028 states and 13188 transitions. [2019-11-15 20:50:58,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 20:50:58,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-11-15 20:50:58,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:58,701 INFO L225 Difference]: With dead ends: 6028 [2019-11-15 20:50:58,701 INFO L226 Difference]: Without dead ends: 6028 [2019-11-15 20:50:58,701 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-11-15 20:50:58,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2019-11-15 20:50:58,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 5575. [2019-11-15 20:50:58,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5575 states. [2019-11-15 20:50:58,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5575 states to 5575 states and 12249 transitions. [2019-11-15 20:50:58,776 INFO L78 Accepts]: Start accepts. Automaton has 5575 states and 12249 transitions. Word has length 94 [2019-11-15 20:50:58,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:58,776 INFO L462 AbstractCegarLoop]: Abstraction has 5575 states and 12249 transitions. [2019-11-15 20:50:58,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:50:58,776 INFO L276 IsEmpty]: Start isEmpty. Operand 5575 states and 12249 transitions. [2019-11-15 20:50:58,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 20:50:58,782 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:58,782 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] [2019-11-15 20:50:58,783 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:58,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:58,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1918469045, now seen corresponding path program 1 times [2019-11-15 20:50:58,783 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:58,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353108573] [2019-11-15 20:50:58,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:58,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:58,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:58,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:50:58,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353108573] [2019-11-15 20:50:58,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:58,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 20:50:58,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267092504] [2019-11-15 20:50:58,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:50:58,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:58,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:50:58,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:50:58,965 INFO L87 Difference]: Start difference. First operand 5575 states and 12249 transitions. Second operand 10 states. [2019-11-15 20:50:59,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:59,459 INFO L93 Difference]: Finished difference Result 21556 states and 48001 transitions. [2019-11-15 20:50:59,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 20:50:59,459 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-11-15 20:50:59,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:59,470 INFO L225 Difference]: With dead ends: 21556 [2019-11-15 20:50:59,470 INFO L226 Difference]: Without dead ends: 12443 [2019-11-15 20:50:59,470 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-11-15 20:50:59,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12443 states. [2019-11-15 20:50:59,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12443 to 5226. [2019-11-15 20:50:59,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5226 states. [2019-11-15 20:50:59,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5226 states to 5226 states and 11417 transitions. [2019-11-15 20:50:59,548 INFO L78 Accepts]: Start accepts. Automaton has 5226 states and 11417 transitions. Word has length 94 [2019-11-15 20:50:59,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:59,548 INFO L462 AbstractCegarLoop]: Abstraction has 5226 states and 11417 transitions. [2019-11-15 20:50:59,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:50:59,549 INFO L276 IsEmpty]: Start isEmpty. Operand 5226 states and 11417 transitions. [2019-11-15 20:50:59,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 20:50:59,552 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:59,552 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] [2019-11-15 20:50:59,553 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:59,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:59,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1724237327, now seen corresponding path program 2 times [2019-11-15 20:50:59,553 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:59,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022734919] [2019-11-15 20:50:59,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:59,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:59,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:50:59,638 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 20:50:59,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022734919] [2019-11-15 20:50:59,639 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:50:59,639 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:50:59,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83588730] [2019-11-15 20:50:59,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:50:59,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:50:59,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:50:59,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:50:59,640 INFO L87 Difference]: Start difference. First operand 5226 states and 11417 transitions. Second operand 5 states. [2019-11-15 20:50:59,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:50:59,690 INFO L93 Difference]: Finished difference Result 5396 states and 11680 transitions. [2019-11-15 20:50:59,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:50:59,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-15 20:50:59,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:50:59,697 INFO L225 Difference]: With dead ends: 5396 [2019-11-15 20:50:59,697 INFO L226 Difference]: Without dead ends: 5396 [2019-11-15 20:50:59,697 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:50:59,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2019-11-15 20:50:59,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 5291. [2019-11-15 20:50:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5291 states. [2019-11-15 20:50:59,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5291 states to 5291 states and 11465 transitions. [2019-11-15 20:50:59,762 INFO L78 Accepts]: Start accepts. Automaton has 5291 states and 11465 transitions. Word has length 94 [2019-11-15 20:50:59,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:50:59,762 INFO L462 AbstractCegarLoop]: Abstraction has 5291 states and 11465 transitions. [2019-11-15 20:50:59,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:50:59,762 INFO L276 IsEmpty]: Start isEmpty. Operand 5291 states and 11465 transitions. [2019-11-15 20:50:59,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 20:50:59,768 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:50:59,768 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] [2019-11-15 20:50:59,769 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:50:59,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:50:59,769 INFO L82 PathProgramCache]: Analyzing trace with hash 459439600, now seen corresponding path program 1 times [2019-11-15 20:50:59,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:50:59,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183731866] [2019-11-15 20:50:59,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:59,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:50:59,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:50:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:50:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:50:59,893 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:50:59,893 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:51:00,074 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 20:51:00,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:51:00 BasicIcfg [2019-11-15 20:51:00,083 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:51:00,083 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:51:00,083 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:51:00,083 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:51:00,084 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:50:22" (3/4) ... [2019-11-15 20:51:00,086 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 20:51:00,234 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d64bb92e-18e4-4f44-9ba3-5727d8c56692/bin/uautomizer/witness.graphml [2019-11-15 20:51:00,234 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:51:00,237 INFO L168 Benchmark]: Toolchain (without parser) took 38778.08 ms. Allocated memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: 2.7 GB). Free memory was 940.7 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-15 20:51:00,237 INFO L168 Benchmark]: CDTParser took 0.33 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 20:51:00,237 INFO L168 Benchmark]: CACSL2BoogieTranslator took 656.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:51:00,238 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.79 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:51:00,238 INFO L168 Benchmark]: Boogie Preprocessor took 46.24 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 20:51:00,240 INFO L168 Benchmark]: RCFGBuilder took 772.02 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: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:51:00,240 INFO L168 Benchmark]: TraceAbstraction took 37082.76 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.6 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-15 20:51:00,241 INFO L168 Benchmark]: Witness Printer took 151.33 ms. Allocated memory is still 3.7 GB. Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 64.1 MB). Peak memory consumption was 64.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:51:00,243 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.33 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 656.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.79 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.24 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 772.02 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: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37082.76 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.6 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 151.33 ms. Allocated memory is still 3.7 GB. Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 64.1 MB). Peak memory consumption was 64.1 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 0 pthread_t t1449; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] FCALL, FORK 0 pthread_create(&t1449, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] 0 pthread_t t1450; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1450, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L763] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = y$flush_delayed ? y$mem_tmp : y [L766] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L807] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 217 locations, 3 error locations. Result: UNSAFE, OverallTime: 36.9s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 16.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9503 SDtfs, 10380 SDslu, 23032 SDs, 0 SdLazy, 9222 SolverSat, 506 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 354 GetRequests, 90 SyntacticMatches, 28 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71010occurred 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.6s AutomataMinimizationTime, 33 MinimizatonAttempts, 76845 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2402 NumberOfCodeBlocks, 2402 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2275 ConstructedInterpolants, 0 QuantifiedInterpolants, 510707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...