./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix009_pso.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_e915b479-5798-49d2-b864-51e9a37e98ea/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e915b479-5798-49d2-b864-51e9a37e98ea/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e915b479-5798-49d2-b864-51e9a37e98ea/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e915b479-5798-49d2-b864-51e9a37e98ea/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix009_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e915b479-5798-49d2-b864-51e9a37e98ea/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e915b479-5798-49d2-b864-51e9a37e98ea/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 63452b000fd1c51474a71b6cfd9415a028dcdf38 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 21:29:00,765 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:29:00,767 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:29:00,782 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:29:00,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:29:00,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:29:00,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:29:00,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:29:00,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:29:00,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:29:00,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:29:00,808 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:29:00,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:29:00,815 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:29:00,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:29:00,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:29:00,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:29:00,819 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:29:00,822 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:29:00,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:29:00,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:29:00,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:29:00,834 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:29:00,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:29:00,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:29:00,838 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:29:00,838 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:29:00,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:29:00,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:29:00,841 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:29:00,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:29:00,842 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:29:00,843 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:29:00,844 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:29:00,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:29:00,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:29:00,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:29:00,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:29:00,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:29:00,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:29:00,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:29:00,850 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e915b479-5798-49d2-b864-51e9a37e98ea/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:29:00,875 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:29:00,876 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:29:00,877 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:29:00,877 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:29:00,877 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:29:00,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:29:00,878 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:29:00,878 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:29:00,878 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:29:00,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:29:00,879 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:29:00,879 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:29:00,879 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:29:00,880 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:29:00,880 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:29:00,880 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:29:00,880 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:29:00,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:29:00,881 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:29:00,881 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:29:00,881 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:29:00,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:29:00,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:29:00,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:29:00,882 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:29:00,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:29:00,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:29:00,883 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:29:00,883 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_e915b479-5798-49d2-b864-51e9a37e98ea/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 -> 63452b000fd1c51474a71b6cfd9415a028dcdf38 [2019-11-15 21:29:00,921 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:29:00,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:29:00,939 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:29:00,941 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:29:00,941 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:29:00,943 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e915b479-5798-49d2-b864-51e9a37e98ea/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix009_pso.oepc.i [2019-11-15 21:29:01,002 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e915b479-5798-49d2-b864-51e9a37e98ea/bin/uautomizer/data/aac7d622b/27756b506142451c9bdeac41aa3048a0/FLAG8693359eb [2019-11-15 21:29:01,495 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:29:01,495 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e915b479-5798-49d2-b864-51e9a37e98ea/sv-benchmarks/c/pthread-wmm/mix009_pso.oepc.i [2019-11-15 21:29:01,516 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e915b479-5798-49d2-b864-51e9a37e98ea/bin/uautomizer/data/aac7d622b/27756b506142451c9bdeac41aa3048a0/FLAG8693359eb [2019-11-15 21:29:01,801 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e915b479-5798-49d2-b864-51e9a37e98ea/bin/uautomizer/data/aac7d622b/27756b506142451c9bdeac41aa3048a0 [2019-11-15 21:29:01,804 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:29:01,805 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:29:01,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:29:01,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:29:01,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:29:01,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:29:01" (1/1) ... [2019-11-15 21:29:01,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f289042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:01, skipping insertion in model container [2019-11-15 21:29:01,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:29:01" (1/1) ... [2019-11-15 21:29:01,829 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:29:01,882 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:29:02,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:29:02,351 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:29:02,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:29:02,482 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:29:02,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:02 WrapperNode [2019-11-15 21:29:02,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:29:02,483 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:29:02,483 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:29:02,484 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:29:02,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:02" (1/1) ... [2019-11-15 21:29:02,517 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:02" (1/1) ... [2019-11-15 21:29:02,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:29:02,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:29:02,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:29:02,546 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:29:02,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:02" (1/1) ... [2019-11-15 21:29:02,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:02" (1/1) ... [2019-11-15 21:29:02,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:02" (1/1) ... [2019-11-15 21:29:02,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:02" (1/1) ... [2019-11-15 21:29:02,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:02" (1/1) ... [2019-11-15 21:29:02,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:02" (1/1) ... [2019-11-15 21:29:02,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:02" (1/1) ... [2019-11-15 21:29:02,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:29:02,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:29:02,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:29:02,586 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:29:02,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e915b479-5798-49d2-b864-51e9a37e98ea/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 21:29:02,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:29:02,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 21:29:02,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:29:02,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:29:02,690 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 21:29:02,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 21:29:02,691 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 21:29:02,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 21:29:02,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 21:29:02,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:29:02,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:29:02,696 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 21:29:03,484 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:29:03,485 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 21:29:03,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:29:03 BoogieIcfgContainer [2019-11-15 21:29:03,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:29:03,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:29:03,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:29:03,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:29:03,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:29:01" (1/3) ... [2019-11-15 21:29:03,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b67dd6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:29:03, skipping insertion in model container [2019-11-15 21:29:03,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:02" (2/3) ... [2019-11-15 21:29:03,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b67dd6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:29:03, skipping insertion in model container [2019-11-15 21:29:03,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:29:03" (3/3) ... [2019-11-15 21:29:03,494 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_pso.oepc.i [2019-11-15 21:29:03,536 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,536 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,536 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,536 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,536 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,537 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,537 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,537 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,537 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,538 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,538 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,538 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,538 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,538 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,538 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,540 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,540 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,540 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,540 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,540 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,541 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,541 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,541 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,541 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,541 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,542 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,542 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,542 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,542 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,544 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,544 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,550 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,550 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,550 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,550 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,550 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,553 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,553 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,553 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,553 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,553 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,554 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,554 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,554 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,554 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,554 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,555 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,555 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,555 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,555 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,555 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,555 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,556 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,556 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,556 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,556 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,560 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,560 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,560 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,560 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,560 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,560 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,561 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,561 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,561 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,561 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,561 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,562 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,562 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,562 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,562 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,562 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,562 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,563 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,563 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,563 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,563 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,563 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,564 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,564 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,564 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,564 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,564 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,565 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,565 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,565 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,565 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:29:03,572 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 21:29:03,573 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:29:03,580 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 21:29:03,591 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 21:29:03,609 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:29:03,609 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:29:03,610 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:29:03,610 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:29:03,610 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:29:03,610 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:29:03,610 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:29:03,610 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:29:03,622 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143 places, 181 transitions [2019-11-15 21:29:06,106 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32593 states. [2019-11-15 21:29:06,108 INFO L276 IsEmpty]: Start isEmpty. Operand 32593 states. [2019-11-15 21:29:06,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 21:29:06,117 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:06,118 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] [2019-11-15 21:29:06,121 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:06,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:06,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1224986376, now seen corresponding path program 1 times [2019-11-15 21:29:06,136 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:06,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462163113] [2019-11-15 21:29:06,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:06,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:06,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:06,381 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 21:29:06,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462163113] [2019-11-15 21:29:06,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:06,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:29:06,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593368955] [2019-11-15 21:29:06,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:29:06,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:06,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:29:06,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:29:06,402 INFO L87 Difference]: Start difference. First operand 32593 states. Second operand 4 states. [2019-11-15 21:29:07,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:07,392 INFO L93 Difference]: Finished difference Result 33593 states and 129570 transitions. [2019-11-15 21:29:07,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:29:07,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-15 21:29:07,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:07,654 INFO L225 Difference]: With dead ends: 33593 [2019-11-15 21:29:07,655 INFO L226 Difference]: Without dead ends: 25705 [2019-11-15 21:29:07,656 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 21:29:08,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25705 states. [2019-11-15 21:29:09,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25705 to 25705. [2019-11-15 21:29:09,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25705 states. [2019-11-15 21:29:09,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25705 states to 25705 states and 99586 transitions. [2019-11-15 21:29:09,312 INFO L78 Accepts]: Start accepts. Automaton has 25705 states and 99586 transitions. Word has length 36 [2019-11-15 21:29:09,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:09,313 INFO L462 AbstractCegarLoop]: Abstraction has 25705 states and 99586 transitions. [2019-11-15 21:29:09,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:29:09,313 INFO L276 IsEmpty]: Start isEmpty. Operand 25705 states and 99586 transitions. [2019-11-15 21:29:09,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 21:29:09,325 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:09,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] [2019-11-15 21:29:09,326 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:09,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:09,326 INFO L82 PathProgramCache]: Analyzing trace with hash -739593163, now seen corresponding path program 1 times [2019-11-15 21:29:09,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:09,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571638885] [2019-11-15 21:29:09,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:09,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:09,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:09,443 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 21:29:09,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571638885] [2019-11-15 21:29:09,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:09,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:29:09,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635813448] [2019-11-15 21:29:09,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:29:09,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:09,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:29:09,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:29:09,446 INFO L87 Difference]: Start difference. First operand 25705 states and 99586 transitions. Second operand 5 states. [2019-11-15 21:29:10,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:10,915 INFO L93 Difference]: Finished difference Result 41083 states and 150433 transitions. [2019-11-15 21:29:10,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:29:10,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-15 21:29:10,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:11,098 INFO L225 Difference]: With dead ends: 41083 [2019-11-15 21:29:11,099 INFO L226 Difference]: Without dead ends: 40547 [2019-11-15 21:29:11,100 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 21:29:11,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40547 states. [2019-11-15 21:29:12,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40547 to 38927. [2019-11-15 21:29:12,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38927 states. [2019-11-15 21:29:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38927 states to 38927 states and 143583 transitions. [2019-11-15 21:29:12,713 INFO L78 Accepts]: Start accepts. Automaton has 38927 states and 143583 transitions. Word has length 48 [2019-11-15 21:29:12,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:12,730 INFO L462 AbstractCegarLoop]: Abstraction has 38927 states and 143583 transitions. [2019-11-15 21:29:12,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:29:12,731 INFO L276 IsEmpty]: Start isEmpty. Operand 38927 states and 143583 transitions. [2019-11-15 21:29:12,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 21:29:12,739 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:12,739 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] [2019-11-15 21:29:12,740 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:12,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:12,740 INFO L82 PathProgramCache]: Analyzing trace with hash 919931139, now seen corresponding path program 1 times [2019-11-15 21:29:12,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:12,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918650974] [2019-11-15 21:29:12,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:12,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:12,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:12,896 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 21:29:12,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918650974] [2019-11-15 21:29:12,898 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:12,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:29:12,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102448761] [2019-11-15 21:29:12,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:29:12,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:12,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:29:12,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:29:12,901 INFO L87 Difference]: Start difference. First operand 38927 states and 143583 transitions. Second operand 5 states. [2019-11-15 21:29:13,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:13,537 INFO L93 Difference]: Finished difference Result 49780 states and 180635 transitions. [2019-11-15 21:29:13,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:29:13,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-11-15 21:29:13,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:13,788 INFO L225 Difference]: With dead ends: 49780 [2019-11-15 21:29:13,788 INFO L226 Difference]: Without dead ends: 49276 [2019-11-15 21:29:13,789 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 21:29:14,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49276 states. [2019-11-15 21:29:15,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49276 to 42679. [2019-11-15 21:29:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42679 states. [2019-11-15 21:29:15,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42679 states to 42679 states and 156594 transitions. [2019-11-15 21:29:15,604 INFO L78 Accepts]: Start accepts. Automaton has 42679 states and 156594 transitions. Word has length 49 [2019-11-15 21:29:15,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:15,604 INFO L462 AbstractCegarLoop]: Abstraction has 42679 states and 156594 transitions. [2019-11-15 21:29:15,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:29:15,605 INFO L276 IsEmpty]: Start isEmpty. Operand 42679 states and 156594 transitions. [2019-11-15 21:29:15,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 21:29:15,613 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:15,614 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 21:29:15,614 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:15,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:15,614 INFO L82 PathProgramCache]: Analyzing trace with hash 261792169, now seen corresponding path program 1 times [2019-11-15 21:29:15,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:15,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315866455] [2019-11-15 21:29:15,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:15,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:15,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:15,659 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 21:29:15,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315866455] [2019-11-15 21:29:15,660 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:15,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:15,660 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611803845] [2019-11-15 21:29:15,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:29:15,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:15,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:15,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:15,664 INFO L87 Difference]: Start difference. First operand 42679 states and 156594 transitions. Second operand 3 states. [2019-11-15 21:29:15,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:15,931 INFO L93 Difference]: Finished difference Result 61089 states and 221432 transitions. [2019-11-15 21:29:15,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:15,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-15 21:29:15,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:16,300 INFO L225 Difference]: With dead ends: 61089 [2019-11-15 21:29:16,300 INFO L226 Difference]: Without dead ends: 61089 [2019-11-15 21:29:16,301 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 21:29:17,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61089 states. [2019-11-15 21:29:17,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61089 to 48018. [2019-11-15 21:29:17,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48018 states. [2019-11-15 21:29:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48018 states to 48018 states and 174181 transitions. [2019-11-15 21:29:18,107 INFO L78 Accepts]: Start accepts. Automaton has 48018 states and 174181 transitions. Word has length 51 [2019-11-15 21:29:18,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:18,107 INFO L462 AbstractCegarLoop]: Abstraction has 48018 states and 174181 transitions. [2019-11-15 21:29:18,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:29:18,107 INFO L276 IsEmpty]: Start isEmpty. Operand 48018 states and 174181 transitions. [2019-11-15 21:29:18,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 21:29:18,123 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:18,124 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:18,124 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:18,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:18,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1705100553, now seen corresponding path program 1 times [2019-11-15 21:29:18,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:18,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413447971] [2019-11-15 21:29:18,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:18,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:18,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:18,275 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 21:29:18,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413447971] [2019-11-15 21:29:18,276 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:18,276 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:29:18,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316678165] [2019-11-15 21:29:18,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:29:18,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:18,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:29:18,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:29:18,277 INFO L87 Difference]: Start difference. First operand 48018 states and 174181 transitions. Second operand 6 states. [2019-11-15 21:29:19,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:19,406 INFO L93 Difference]: Finished difference Result 63758 states and 229381 transitions. [2019-11-15 21:29:19,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:29:19,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-15 21:29:19,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:19,559 INFO L225 Difference]: With dead ends: 63758 [2019-11-15 21:29:19,560 INFO L226 Difference]: Without dead ends: 63758 [2019-11-15 21:29:19,560 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:29:19,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63758 states. [2019-11-15 21:29:21,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63758 to 59951. [2019-11-15 21:29:21,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59951 states. [2019-11-15 21:29:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59951 states to 59951 states and 215674 transitions. [2019-11-15 21:29:21,687 INFO L78 Accepts]: Start accepts. Automaton has 59951 states and 215674 transitions. Word has length 55 [2019-11-15 21:29:21,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:21,688 INFO L462 AbstractCegarLoop]: Abstraction has 59951 states and 215674 transitions. [2019-11-15 21:29:21,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:29:21,688 INFO L276 IsEmpty]: Start isEmpty. Operand 59951 states and 215674 transitions. [2019-11-15 21:29:21,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 21:29:21,708 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:21,708 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:21,708 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:21,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:21,709 INFO L82 PathProgramCache]: Analyzing trace with hash 792915384, now seen corresponding path program 1 times [2019-11-15 21:29:21,709 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:21,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102100728] [2019-11-15 21:29:21,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:21,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:21,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:21,857 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 21:29:21,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102100728] [2019-11-15 21:29:21,858 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:21,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:29:21,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142835548] [2019-11-15 21:29:21,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:29:21,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:21,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:29:21,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:29:21,860 INFO L87 Difference]: Start difference. First operand 59951 states and 215674 transitions. Second operand 7 states. [2019-11-15 21:29:23,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:23,258 INFO L93 Difference]: Finished difference Result 83687 states and 290099 transitions. [2019-11-15 21:29:23,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:29:23,259 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-11-15 21:29:23,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:23,435 INFO L225 Difference]: With dead ends: 83687 [2019-11-15 21:29:23,435 INFO L226 Difference]: Without dead ends: 83687 [2019-11-15 21:29:23,436 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:29:23,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83687 states. [2019-11-15 21:29:28,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83687 to 71014. [2019-11-15 21:29:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71014 states. [2019-11-15 21:29:28,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71014 states to 71014 states and 249888 transitions. [2019-11-15 21:29:28,868 INFO L78 Accepts]: Start accepts. Automaton has 71014 states and 249888 transitions. Word has length 55 [2019-11-15 21:29:28,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:28,869 INFO L462 AbstractCegarLoop]: Abstraction has 71014 states and 249888 transitions. [2019-11-15 21:29:28,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:29:28,869 INFO L276 IsEmpty]: Start isEmpty. Operand 71014 states and 249888 transitions. [2019-11-15 21:29:28,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 21:29:28,882 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:28,882 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:28,883 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:28,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:28,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1680419065, now seen corresponding path program 1 times [2019-11-15 21:29:28,883 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:28,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423084709] [2019-11-15 21:29:28,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:28,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:28,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:28,937 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 21:29:28,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423084709] [2019-11-15 21:29:28,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:28,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:28,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126676974] [2019-11-15 21:29:28,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:29:28,938 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:28,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:28,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:28,939 INFO L87 Difference]: Start difference. First operand 71014 states and 249888 transitions. Second operand 3 states. [2019-11-15 21:29:29,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:29,169 INFO L93 Difference]: Finished difference Result 54023 states and 188920 transitions. [2019-11-15 21:29:29,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:29,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-15 21:29:29,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:29,286 INFO L225 Difference]: With dead ends: 54023 [2019-11-15 21:29:29,286 INFO L226 Difference]: Without dead ends: 54023 [2019-11-15 21:29:29,287 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:29,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54023 states. [2019-11-15 21:29:30,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54023 to 53408. [2019-11-15 21:29:30,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53408 states. [2019-11-15 21:29:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53408 states to 53408 states and 187039 transitions. [2019-11-15 21:29:30,259 INFO L78 Accepts]: Start accepts. Automaton has 53408 states and 187039 transitions. Word has length 55 [2019-11-15 21:29:30,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:30,259 INFO L462 AbstractCegarLoop]: Abstraction has 53408 states and 187039 transitions. [2019-11-15 21:29:30,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:29:30,260 INFO L276 IsEmpty]: Start isEmpty. Operand 53408 states and 187039 transitions. [2019-11-15 21:29:30,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 21:29:30,269 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:30,269 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:30,269 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:30,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:30,270 INFO L82 PathProgramCache]: Analyzing trace with hash 200257268, now seen corresponding path program 1 times [2019-11-15 21:29:30,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:30,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511369729] [2019-11-15 21:29:30,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:30,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:30,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:30,352 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 21:29:30,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511369729] [2019-11-15 21:29:30,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:30,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:29:30,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244427217] [2019-11-15 21:29:30,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:29:30,353 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:30,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:29:30,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:29:30,354 INFO L87 Difference]: Start difference. First operand 53408 states and 187039 transitions. Second operand 6 states. [2019-11-15 21:29:31,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:31,755 INFO L93 Difference]: Finished difference Result 68648 states and 237303 transitions. [2019-11-15 21:29:31,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:29:31,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-15 21:29:31,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:31,904 INFO L225 Difference]: With dead ends: 68648 [2019-11-15 21:29:31,904 INFO L226 Difference]: Without dead ends: 68080 [2019-11-15 21:29:31,905 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:29:32,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68080 states. [2019-11-15 21:29:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68080 to 53492. [2019-11-15 21:29:32,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53492 states. [2019-11-15 21:29:33,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53492 states to 53492 states and 187736 transitions. [2019-11-15 21:29:33,008 INFO L78 Accepts]: Start accepts. Automaton has 53492 states and 187736 transitions. Word has length 55 [2019-11-15 21:29:33,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:33,009 INFO L462 AbstractCegarLoop]: Abstraction has 53492 states and 187736 transitions. [2019-11-15 21:29:33,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:29:33,009 INFO L276 IsEmpty]: Start isEmpty. Operand 53492 states and 187736 transitions. [2019-11-15 21:29:33,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 21:29:33,022 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:33,022 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] [2019-11-15 21:29:33,022 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:33,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:33,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1664563738, now seen corresponding path program 1 times [2019-11-15 21:29:33,023 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:33,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551460832] [2019-11-15 21:29:33,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:33,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:33,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:33,115 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 21:29:33,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551460832] [2019-11-15 21:29:33,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:33,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:29:33,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488440075] [2019-11-15 21:29:33,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:29:33,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:33,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:29:33,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:29:33,117 INFO L87 Difference]: Start difference. First operand 53492 states and 187736 transitions. Second operand 6 states. [2019-11-15 21:29:33,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:33,904 INFO L93 Difference]: Finished difference Result 96427 states and 331755 transitions. [2019-11-15 21:29:33,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:29:33,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-15 21:29:33,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:34,122 INFO L225 Difference]: With dead ends: 96427 [2019-11-15 21:29:34,123 INFO L226 Difference]: Without dead ends: 96427 [2019-11-15 21:29:34,123 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:29:34,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96427 states. [2019-11-15 21:29:36,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96427 to 70776. [2019-11-15 21:29:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70776 states. [2019-11-15 21:29:36,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70776 states to 70776 states and 244812 transitions. [2019-11-15 21:29:36,496 INFO L78 Accepts]: Start accepts. Automaton has 70776 states and 244812 transitions. Word has length 56 [2019-11-15 21:29:36,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:36,497 INFO L462 AbstractCegarLoop]: Abstraction has 70776 states and 244812 transitions. [2019-11-15 21:29:36,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:29:36,497 INFO L276 IsEmpty]: Start isEmpty. Operand 70776 states and 244812 transitions. [2019-11-15 21:29:36,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 21:29:36,510 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:36,510 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] [2019-11-15 21:29:36,510 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:36,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:36,511 INFO L82 PathProgramCache]: Analyzing trace with hash -777060057, now seen corresponding path program 1 times [2019-11-15 21:29:36,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:36,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15772327] [2019-11-15 21:29:36,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:36,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:36,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:36,607 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 21:29:36,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15772327] [2019-11-15 21:29:36,608 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:36,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:29:36,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406145087] [2019-11-15 21:29:36,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:29:36,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:36,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:29:36,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:29:36,609 INFO L87 Difference]: Start difference. First operand 70776 states and 244812 transitions. Second operand 4 states. [2019-11-15 21:29:36,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:36,710 INFO L93 Difference]: Finished difference Result 12389 states and 37624 transitions. [2019-11-15 21:29:36,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:29:36,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-15 21:29:36,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:36,732 INFO L225 Difference]: With dead ends: 12389 [2019-11-15 21:29:36,733 INFO L226 Difference]: Without dead ends: 10684 [2019-11-15 21:29:36,733 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 21:29:36,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10684 states. [2019-11-15 21:29:36,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10684 to 10636. [2019-11-15 21:29:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10636 states. [2019-11-15 21:29:36,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10636 states to 10636 states and 31703 transitions. [2019-11-15 21:29:36,937 INFO L78 Accepts]: Start accepts. Automaton has 10636 states and 31703 transitions. Word has length 56 [2019-11-15 21:29:36,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:36,937 INFO L462 AbstractCegarLoop]: Abstraction has 10636 states and 31703 transitions. [2019-11-15 21:29:36,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:29:36,938 INFO L276 IsEmpty]: Start isEmpty. Operand 10636 states and 31703 transitions. [2019-11-15 21:29:36,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 21:29:36,944 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:36,945 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 21:29:36,945 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:36,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:36,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1281020880, now seen corresponding path program 1 times [2019-11-15 21:29:36,945 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:36,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081619742] [2019-11-15 21:29:36,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:36,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:36,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:37,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081619742] [2019-11-15 21:29:37,043 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:37,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:29:37,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159666754] [2019-11-15 21:29:37,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:29:37,044 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:37,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:29:37,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:29:37,045 INFO L87 Difference]: Start difference. First operand 10636 states and 31703 transitions. Second operand 4 states. [2019-11-15 21:29:37,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:37,242 INFO L93 Difference]: Finished difference Result 12168 states and 36341 transitions. [2019-11-15 21:29:37,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:29:37,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-15 21:29:37,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:37,267 INFO L225 Difference]: With dead ends: 12168 [2019-11-15 21:29:37,267 INFO L226 Difference]: Without dead ends: 12168 [2019-11-15 21:29:37,267 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 21:29:37,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12168 states. [2019-11-15 21:29:37,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12168 to 10966. [2019-11-15 21:29:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10966 states. [2019-11-15 21:29:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10966 states to 10966 states and 32705 transitions. [2019-11-15 21:29:37,492 INFO L78 Accepts]: Start accepts. Automaton has 10966 states and 32705 transitions. Word has length 63 [2019-11-15 21:29:37,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:37,493 INFO L462 AbstractCegarLoop]: Abstraction has 10966 states and 32705 transitions. [2019-11-15 21:29:37,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:29:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand 10966 states and 32705 transitions. [2019-11-15 21:29:37,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 21:29:37,502 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:37,502 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 21:29:37,502 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:37,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:37,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1271136081, now seen corresponding path program 1 times [2019-11-15 21:29:37,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:37,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927243766] [2019-11-15 21:29:37,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:37,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:37,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:37,623 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 21:29:37,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927243766] [2019-11-15 21:29:37,625 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:37,625 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:29:37,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102900345] [2019-11-15 21:29:37,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:29:37,626 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:37,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:29:37,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:29:37,627 INFO L87 Difference]: Start difference. First operand 10966 states and 32705 transitions. Second operand 6 states. [2019-11-15 21:29:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:38,236 INFO L93 Difference]: Finished difference Result 13792 states and 40573 transitions. [2019-11-15 21:29:38,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:29:38,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-11-15 21:29:38,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:38,258 INFO L225 Difference]: With dead ends: 13792 [2019-11-15 21:29:38,258 INFO L226 Difference]: Without dead ends: 13731 [2019-11-15 21:29:38,259 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:29:38,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13731 states. [2019-11-15 21:29:38,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13731 to 12857. [2019-11-15 21:29:38,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12857 states. [2019-11-15 21:29:38,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12857 states to 12857 states and 38043 transitions. [2019-11-15 21:29:38,458 INFO L78 Accepts]: Start accepts. Automaton has 12857 states and 38043 transitions. Word has length 63 [2019-11-15 21:29:38,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:38,459 INFO L462 AbstractCegarLoop]: Abstraction has 12857 states and 38043 transitions. [2019-11-15 21:29:38,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:29:38,459 INFO L276 IsEmpty]: Start isEmpty. Operand 12857 states and 38043 transitions. [2019-11-15 21:29:38,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 21:29:38,465 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:38,466 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] [2019-11-15 21:29:38,466 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:38,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:38,466 INFO L82 PathProgramCache]: Analyzing trace with hash 2082397274, now seen corresponding path program 1 times [2019-11-15 21:29:38,466 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:38,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957350143] [2019-11-15 21:29:38,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:38,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:38,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:38,530 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 21:29:38,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957350143] [2019-11-15 21:29:38,531 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:38,531 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:38,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595849657] [2019-11-15 21:29:38,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:29:38,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:38,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:38,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:38,533 INFO L87 Difference]: Start difference. First operand 12857 states and 38043 transitions. Second operand 3 states. [2019-11-15 21:29:38,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:38,810 INFO L93 Difference]: Finished difference Result 13457 states and 39575 transitions. [2019-11-15 21:29:38,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:38,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-15 21:29:38,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:38,830 INFO L225 Difference]: With dead ends: 13457 [2019-11-15 21:29:38,830 INFO L226 Difference]: Without dead ends: 13457 [2019-11-15 21:29:38,830 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 21:29:38,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13457 states. [2019-11-15 21:29:38,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13457 to 13157. [2019-11-15 21:29:38,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13157 states. [2019-11-15 21:29:39,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13157 states to 13157 states and 38809 transitions. [2019-11-15 21:29:39,007 INFO L78 Accepts]: Start accepts. Automaton has 13157 states and 38809 transitions. Word has length 69 [2019-11-15 21:29:39,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:39,008 INFO L462 AbstractCegarLoop]: Abstraction has 13157 states and 38809 transitions. [2019-11-15 21:29:39,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:29:39,008 INFO L276 IsEmpty]: Start isEmpty. Operand 13157 states and 38809 transitions. [2019-11-15 21:29:39,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 21:29:39,015 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:39,015 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] [2019-11-15 21:29:39,015 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:39,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:39,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1120783257, now seen corresponding path program 1 times [2019-11-15 21:29:39,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:39,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155860876] [2019-11-15 21:29:39,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:39,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:39,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:39,095 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 21:29:39,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155860876] [2019-11-15 21:29:39,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:39,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:29:39,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294864277] [2019-11-15 21:29:39,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:29:39,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:39,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:29:39,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:29:39,097 INFO L87 Difference]: Start difference. First operand 13157 states and 38809 transitions. Second operand 4 states. [2019-11-15 21:29:39,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:39,444 INFO L93 Difference]: Finished difference Result 16250 states and 47532 transitions. [2019-11-15 21:29:39,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:29:39,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-15 21:29:39,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:39,468 INFO L225 Difference]: With dead ends: 16250 [2019-11-15 21:29:39,468 INFO L226 Difference]: Without dead ends: 16250 [2019-11-15 21:29:39,469 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 21:29:39,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16250 states. [2019-11-15 21:29:39,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16250 to 14519. [2019-11-15 21:29:39,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14519 states. [2019-11-15 21:29:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14519 states to 14519 states and 42584 transitions. [2019-11-15 21:29:39,682 INFO L78 Accepts]: Start accepts. Automaton has 14519 states and 42584 transitions. Word has length 69 [2019-11-15 21:29:39,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:39,682 INFO L462 AbstractCegarLoop]: Abstraction has 14519 states and 42584 transitions. [2019-11-15 21:29:39,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:29:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 14519 states and 42584 transitions. [2019-11-15 21:29:39,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 21:29:39,691 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:39,691 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] [2019-11-15 21:29:39,692 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:39,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:39,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1929419558, now seen corresponding path program 1 times [2019-11-15 21:29:39,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:39,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391500154] [2019-11-15 21:29:39,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:39,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:39,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:39,819 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 21:29:39,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391500154] [2019-11-15 21:29:39,820 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:39,820 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:29:39,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149296514] [2019-11-15 21:29:39,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:29:39,821 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:39,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:29:39,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:29:39,825 INFO L87 Difference]: Start difference. First operand 14519 states and 42584 transitions. Second operand 6 states. [2019-11-15 21:29:40,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:40,811 INFO L93 Difference]: Finished difference Result 15522 states and 44957 transitions. [2019-11-15 21:29:40,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:29:40,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-11-15 21:29:40,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:40,835 INFO L225 Difference]: With dead ends: 15522 [2019-11-15 21:29:40,835 INFO L226 Difference]: Without dead ends: 15522 [2019-11-15 21:29:40,835 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:29:40,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15522 states. [2019-11-15 21:29:41,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15522 to 15092. [2019-11-15 21:29:41,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15092 states. [2019-11-15 21:29:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15092 states to 15092 states and 43881 transitions. [2019-11-15 21:29:41,045 INFO L78 Accepts]: Start accepts. Automaton has 15092 states and 43881 transitions. Word has length 69 [2019-11-15 21:29:41,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:41,045 INFO L462 AbstractCegarLoop]: Abstraction has 15092 states and 43881 transitions. [2019-11-15 21:29:41,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:29:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 15092 states and 43881 transitions. [2019-11-15 21:29:41,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 21:29:41,054 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:41,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, 1, 1, 1, 1] [2019-11-15 21:29:41,055 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:41,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:41,055 INFO L82 PathProgramCache]: Analyzing trace with hash 288338395, now seen corresponding path program 1 times [2019-11-15 21:29:41,055 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:41,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839868034] [2019-11-15 21:29:41,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:41,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:41,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:41,172 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 21:29:41,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839868034] [2019-11-15 21:29:41,179 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:41,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:29:41,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678546804] [2019-11-15 21:29:41,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:29:41,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:41,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:29:41,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:29:41,185 INFO L87 Difference]: Start difference. First operand 15092 states and 43881 transitions. Second operand 6 states. [2019-11-15 21:29:41,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:41,644 INFO L93 Difference]: Finished difference Result 17158 states and 48595 transitions. [2019-11-15 21:29:41,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:29:41,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-11-15 21:29:41,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:41,668 INFO L225 Difference]: With dead ends: 17158 [2019-11-15 21:29:41,669 INFO L226 Difference]: Without dead ends: 17158 [2019-11-15 21:29:41,669 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 21:29:41,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17158 states. [2019-11-15 21:29:41,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17158 to 15622. [2019-11-15 21:29:41,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15622 states. [2019-11-15 21:29:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15622 states to 15622 states and 44729 transitions. [2019-11-15 21:29:41,875 INFO L78 Accepts]: Start accepts. Automaton has 15622 states and 44729 transitions. Word has length 69 [2019-11-15 21:29:41,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:41,875 INFO L462 AbstractCegarLoop]: Abstraction has 15622 states and 44729 transitions. [2019-11-15 21:29:41,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:29:41,875 INFO L276 IsEmpty]: Start isEmpty. Operand 15622 states and 44729 transitions. [2019-11-15 21:29:41,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 21:29:41,883 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:41,883 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] [2019-11-15 21:29:41,883 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:41,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:41,883 INFO L82 PathProgramCache]: Analyzing trace with hash 499689308, now seen corresponding path program 1 times [2019-11-15 21:29:41,883 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:41,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735086476] [2019-11-15 21:29:41,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:41,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:41,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:41,962 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 21:29:41,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735086476] [2019-11-15 21:29:41,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:41,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:29:41,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930156824] [2019-11-15 21:29:41,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:29:41,963 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:41,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:29:41,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:29:41,963 INFO L87 Difference]: Start difference. First operand 15622 states and 44729 transitions. Second operand 5 states. [2019-11-15 21:29:42,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:42,486 INFO L93 Difference]: Finished difference Result 19637 states and 56002 transitions. [2019-11-15 21:29:42,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:29:42,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-11-15 21:29:42,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:42,519 INFO L225 Difference]: With dead ends: 19637 [2019-11-15 21:29:42,519 INFO L226 Difference]: Without dead ends: 19637 [2019-11-15 21:29:42,520 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 21:29:42,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19637 states. [2019-11-15 21:29:42,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19637 to 18194. [2019-11-15 21:29:42,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18194 states. [2019-11-15 21:29:42,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18194 states to 18194 states and 51756 transitions. [2019-11-15 21:29:42,830 INFO L78 Accepts]: Start accepts. Automaton has 18194 states and 51756 transitions. Word has length 69 [2019-11-15 21:29:42,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:42,830 INFO L462 AbstractCegarLoop]: Abstraction has 18194 states and 51756 transitions. [2019-11-15 21:29:42,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:29:42,831 INFO L276 IsEmpty]: Start isEmpty. Operand 18194 states and 51756 transitions. [2019-11-15 21:29:42,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 21:29:42,840 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:42,840 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] [2019-11-15 21:29:42,840 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:42,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:42,840 INFO L82 PathProgramCache]: Analyzing trace with hash -10844869, now seen corresponding path program 1 times [2019-11-15 21:29:42,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:42,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168474441] [2019-11-15 21:29:42,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:42,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:42,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:42,895 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 21:29:42,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168474441] [2019-11-15 21:29:42,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:42,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:29:42,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552125786] [2019-11-15 21:29:42,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:29:42,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:42,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:29:42,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:29:42,897 INFO L87 Difference]: Start difference. First operand 18194 states and 51756 transitions. Second operand 4 states. [2019-11-15 21:29:43,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:43,534 INFO L93 Difference]: Finished difference Result 21608 states and 61307 transitions. [2019-11-15 21:29:43,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:29:43,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-15 21:29:43,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:43,564 INFO L225 Difference]: With dead ends: 21608 [2019-11-15 21:29:43,564 INFO L226 Difference]: Without dead ends: 21386 [2019-11-15 21:29:43,564 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 21:29:43,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21386 states. [2019-11-15 21:29:43,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21386 to 20516. [2019-11-15 21:29:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20516 states. [2019-11-15 21:29:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20516 states to 20516 states and 58143 transitions. [2019-11-15 21:29:43,838 INFO L78 Accepts]: Start accepts. Automaton has 20516 states and 58143 transitions. Word has length 69 [2019-11-15 21:29:43,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:43,838 INFO L462 AbstractCegarLoop]: Abstraction has 20516 states and 58143 transitions. [2019-11-15 21:29:43,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:29:43,838 INFO L276 IsEmpty]: Start isEmpty. Operand 20516 states and 58143 transitions. [2019-11-15 21:29:43,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 21:29:43,847 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:29:43,847 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:43,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:43,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1599667387, now seen corresponding path program 1 times [2019-11-15 21:29:43,848 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:43,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318041447] [2019-11-15 21:29:43,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:44,000 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 21:29:44,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318041447] [2019-11-15 21:29:44,001 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:44,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:29:44,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372101045] [2019-11-15 21:29:44,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:29:44,003 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:44,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:29:44,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:29:44,003 INFO L87 Difference]: Start difference. First operand 20516 states and 58143 transitions. Second operand 7 states. [2019-11-15 21:29:44,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:44,625 INFO L93 Difference]: Finished difference Result 21800 states and 60753 transitions. [2019-11-15 21:29:44,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:29:44,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-11-15 21:29:44,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:44,653 INFO L225 Difference]: With dead ends: 21800 [2019-11-15 21:29:44,653 INFO L226 Difference]: Without dead ends: 21800 [2019-11-15 21:29:44,654 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 21:29:44,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21800 states. [2019-11-15 21:29:44,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21800 to 18367. [2019-11-15 21:29:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18367 states. [2019-11-15 21:29:44,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18367 states to 18367 states and 51123 transitions. [2019-11-15 21:29:44,902 INFO L78 Accepts]: Start accepts. Automaton has 18367 states and 51123 transitions. Word has length 69 [2019-11-15 21:29:44,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:44,902 INFO L462 AbstractCegarLoop]: Abstraction has 18367 states and 51123 transitions. [2019-11-15 21:29:44,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:29:44,903 INFO L276 IsEmpty]: Start isEmpty. Operand 18367 states and 51123 transitions. [2019-11-15 21:29:44,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 21:29:44,911 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:44,911 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] [2019-11-15 21:29:44,911 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:44,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:44,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1807796228, now seen corresponding path program 1 times [2019-11-15 21:29:44,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:44,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108277866] [2019-11-15 21:29:44,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:44,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:44,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:44,993 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 21:29:44,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108277866] [2019-11-15 21:29:44,994 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:44,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:29:44,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587476279] [2019-11-15 21:29:44,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:29:44,995 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:44,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:29:44,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:29:44,996 INFO L87 Difference]: Start difference. First operand 18367 states and 51123 transitions. Second operand 5 states. [2019-11-15 21:29:45,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:45,067 INFO L93 Difference]: Finished difference Result 6133 states and 14464 transitions. [2019-11-15 21:29:45,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:29:45,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-11-15 21:29:45,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:45,074 INFO L225 Difference]: With dead ends: 6133 [2019-11-15 21:29:45,075 INFO L226 Difference]: Without dead ends: 5263 [2019-11-15 21:29:45,075 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 21:29:45,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2019-11-15 21:29:45,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 4728. [2019-11-15 21:29:45,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4728 states. [2019-11-15 21:29:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4728 states to 4728 states and 10823 transitions. [2019-11-15 21:29:45,145 INFO L78 Accepts]: Start accepts. Automaton has 4728 states and 10823 transitions. Word has length 69 [2019-11-15 21:29:45,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:45,146 INFO L462 AbstractCegarLoop]: Abstraction has 4728 states and 10823 transitions. [2019-11-15 21:29:45,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:29:45,146 INFO L276 IsEmpty]: Start isEmpty. Operand 4728 states and 10823 transitions. [2019-11-15 21:29:45,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 21:29:45,151 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:45,152 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] [2019-11-15 21:29:45,152 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:45,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:45,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1763644192, now seen corresponding path program 1 times [2019-11-15 21:29:45,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:45,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094402855] [2019-11-15 21:29:45,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:45,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:45,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:45,186 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 21:29:45,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094402855] [2019-11-15 21:29:45,187 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:45,187 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:45,187 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116602533] [2019-11-15 21:29:45,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:29:45,189 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:45,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:45,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:45,191 INFO L87 Difference]: Start difference. First operand 4728 states and 10823 transitions. Second operand 3 states. [2019-11-15 21:29:45,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:45,234 INFO L93 Difference]: Finished difference Result 5858 states and 13189 transitions. [2019-11-15 21:29:45,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:45,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-15 21:29:45,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:45,241 INFO L225 Difference]: With dead ends: 5858 [2019-11-15 21:29:45,241 INFO L226 Difference]: Without dead ends: 5858 [2019-11-15 21:29:45,242 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 21:29:45,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5858 states. [2019-11-15 21:29:45,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5858 to 4663. [2019-11-15 21:29:45,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4663 states. [2019-11-15 21:29:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4663 states to 4663 states and 10385 transitions. [2019-11-15 21:29:45,311 INFO L78 Accepts]: Start accepts. Automaton has 4663 states and 10385 transitions. Word has length 69 [2019-11-15 21:29:45,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:45,311 INFO L462 AbstractCegarLoop]: Abstraction has 4663 states and 10385 transitions. [2019-11-15 21:29:45,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:29:45,311 INFO L276 IsEmpty]: Start isEmpty. Operand 4663 states and 10385 transitions. [2019-11-15 21:29:45,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 21:29:45,318 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:45,318 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] [2019-11-15 21:29:45,318 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:45,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:45,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1221048589, now seen corresponding path program 1 times [2019-11-15 21:29:45,319 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:45,319 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255500291] [2019-11-15 21:29:45,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:45,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:45,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:45,397 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 21:29:45,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255500291] [2019-11-15 21:29:45,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:45,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:29:45,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690854145] [2019-11-15 21:29:45,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:29:45,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:45,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:29:45,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:29:45,399 INFO L87 Difference]: Start difference. First operand 4663 states and 10385 transitions. Second operand 5 states. [2019-11-15 21:29:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:45,570 INFO L93 Difference]: Finished difference Result 5724 states and 12814 transitions. [2019-11-15 21:29:45,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:29:45,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-11-15 21:29:45,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:45,575 INFO L225 Difference]: With dead ends: 5724 [2019-11-15 21:29:45,576 INFO L226 Difference]: Without dead ends: 5724 [2019-11-15 21:29:45,576 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 21:29:45,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5724 states. [2019-11-15 21:29:45,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5724 to 5083. [2019-11-15 21:29:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5083 states. [2019-11-15 21:29:45,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5083 states to 5083 states and 11343 transitions. [2019-11-15 21:29:45,628 INFO L78 Accepts]: Start accepts. Automaton has 5083 states and 11343 transitions. Word has length 75 [2019-11-15 21:29:45,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:45,628 INFO L462 AbstractCegarLoop]: Abstraction has 5083 states and 11343 transitions. [2019-11-15 21:29:45,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:29:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 5083 states and 11343 transitions. [2019-11-15 21:29:45,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 21:29:45,632 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:45,633 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] [2019-11-15 21:29:45,633 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:45,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:45,633 INFO L82 PathProgramCache]: Analyzing trace with hash 521761746, now seen corresponding path program 1 times [2019-11-15 21:29:45,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:45,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339024181] [2019-11-15 21:29:45,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:45,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:45,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:45,715 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 21:29:45,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339024181] [2019-11-15 21:29:45,716 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:45,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:29:45,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486574319] [2019-11-15 21:29:45,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:29:45,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:45,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:29:45,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:29:45,717 INFO L87 Difference]: Start difference. First operand 5083 states and 11343 transitions. Second operand 7 states. [2019-11-15 21:29:46,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:46,240 INFO L93 Difference]: Finished difference Result 5823 states and 12866 transitions. [2019-11-15 21:29:46,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:29:46,241 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-11-15 21:29:46,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:46,246 INFO L225 Difference]: With dead ends: 5823 [2019-11-15 21:29:46,246 INFO L226 Difference]: Without dead ends: 5770 [2019-11-15 21:29:46,246 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 21:29:46,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5770 states. [2019-11-15 21:29:46,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5770 to 5170. [2019-11-15 21:29:46,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5170 states. [2019-11-15 21:29:46,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5170 states to 5170 states and 11432 transitions. [2019-11-15 21:29:46,302 INFO L78 Accepts]: Start accepts. Automaton has 5170 states and 11432 transitions. Word has length 75 [2019-11-15 21:29:46,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:46,303 INFO L462 AbstractCegarLoop]: Abstraction has 5170 states and 11432 transitions. [2019-11-15 21:29:46,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:29:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand 5170 states and 11432 transitions. [2019-11-15 21:29:46,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 21:29:46,308 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:46,309 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:46,309 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:46,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:46,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1512586684, now seen corresponding path program 1 times [2019-11-15 21:29:46,310 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:46,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854211791] [2019-11-15 21:29:46,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:46,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:46,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:46,382 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 21:29:46,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854211791] [2019-11-15 21:29:46,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:46,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:29:46,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699339988] [2019-11-15 21:29:46,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:29:46,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:46,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:29:46,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:29:46,384 INFO L87 Difference]: Start difference. First operand 5170 states and 11432 transitions. Second operand 5 states. [2019-11-15 21:29:46,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:46,765 INFO L93 Difference]: Finished difference Result 4679 states and 10281 transitions. [2019-11-15 21:29:46,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:29:46,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-11-15 21:29:46,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:46,770 INFO L225 Difference]: With dead ends: 4679 [2019-11-15 21:29:46,770 INFO L226 Difference]: Without dead ends: 4679 [2019-11-15 21:29:46,770 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:29:46,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4679 states. [2019-11-15 21:29:46,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4679 to 4257. [2019-11-15 21:29:46,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4257 states. [2019-11-15 21:29:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4257 states to 4257 states and 9317 transitions. [2019-11-15 21:29:46,816 INFO L78 Accepts]: Start accepts. Automaton has 4257 states and 9317 transitions. Word has length 96 [2019-11-15 21:29:46,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:46,816 INFO L462 AbstractCegarLoop]: Abstraction has 4257 states and 9317 transitions. [2019-11-15 21:29:46,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:29:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 4257 states and 9317 transitions. [2019-11-15 21:29:46,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 21:29:46,820 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:46,820 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:46,821 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:46,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:46,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1420742303, now seen corresponding path program 1 times [2019-11-15 21:29:46,821 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:46,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55810524] [2019-11-15 21:29:46,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:46,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:46,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:46,912 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 21:29:46,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55810524] [2019-11-15 21:29:46,913 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:46,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:29:46,913 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911345462] [2019-11-15 21:29:46,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:29:46,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:46,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:29:46,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:29:46,915 INFO L87 Difference]: Start difference. First operand 4257 states and 9317 transitions. Second operand 4 states. [2019-11-15 21:29:47,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:47,065 INFO L93 Difference]: Finished difference Result 5241 states and 11450 transitions. [2019-11-15 21:29:47,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:29:47,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 21:29:47,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:47,072 INFO L225 Difference]: With dead ends: 5241 [2019-11-15 21:29:47,072 INFO L226 Difference]: Without dead ends: 5241 [2019-11-15 21:29:47,072 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:29:47,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5241 states. [2019-11-15 21:29:47,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5241 to 4568. [2019-11-15 21:29:47,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4568 states. [2019-11-15 21:29:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4568 states to 4568 states and 10013 transitions. [2019-11-15 21:29:47,135 INFO L78 Accepts]: Start accepts. Automaton has 4568 states and 10013 transitions. Word has length 96 [2019-11-15 21:29:47,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:47,136 INFO L462 AbstractCegarLoop]: Abstraction has 4568 states and 10013 transitions. [2019-11-15 21:29:47,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:29:47,136 INFO L276 IsEmpty]: Start isEmpty. Operand 4568 states and 10013 transitions. [2019-11-15 21:29:47,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:29:47,142 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:47,142 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:47,142 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:47,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:47,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1358792190, now seen corresponding path program 1 times [2019-11-15 21:29:47,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:47,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092274777] [2019-11-15 21:29:47,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:47,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:47,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:47,255 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 21:29:47,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092274777] [2019-11-15 21:29:47,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:47,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:29:47,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448899787] [2019-11-15 21:29:47,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:29:47,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:47,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:29:47,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:29:47,258 INFO L87 Difference]: Start difference. First operand 4568 states and 10013 transitions. Second operand 7 states. [2019-11-15 21:29:48,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:48,337 INFO L93 Difference]: Finished difference Result 7686 states and 16851 transitions. [2019-11-15 21:29:48,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 21:29:48,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-11-15 21:29:48,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:48,345 INFO L225 Difference]: With dead ends: 7686 [2019-11-15 21:29:48,345 INFO L226 Difference]: Without dead ends: 7616 [2019-11-15 21:29:48,345 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-11-15 21:29:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7616 states. [2019-11-15 21:29:48,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7616 to 5996. [2019-11-15 21:29:48,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5996 states. [2019-11-15 21:29:48,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5996 states to 5996 states and 13261 transitions. [2019-11-15 21:29:48,413 INFO L78 Accepts]: Start accepts. Automaton has 5996 states and 13261 transitions. Word has length 98 [2019-11-15 21:29:48,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:48,413 INFO L462 AbstractCegarLoop]: Abstraction has 5996 states and 13261 transitions. [2019-11-15 21:29:48,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:29:48,414 INFO L276 IsEmpty]: Start isEmpty. Operand 5996 states and 13261 transitions. [2019-11-15 21:29:48,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:29:48,419 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:48,419 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:48,419 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:48,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:48,419 INFO L82 PathProgramCache]: Analyzing trace with hash 858965763, now seen corresponding path program 1 times [2019-11-15 21:29:48,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:48,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751980796] [2019-11-15 21:29:48,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:48,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:48,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:48,565 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 21:29:48,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751980796] [2019-11-15 21:29:48,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:48,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:29:48,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990800068] [2019-11-15 21:29:48,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:29:48,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:48,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:29:48,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:29:48,568 INFO L87 Difference]: Start difference. First operand 5996 states and 13261 transitions. Second operand 6 states. [2019-11-15 21:29:48,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:48,804 INFO L93 Difference]: Finished difference Result 5432 states and 11791 transitions. [2019-11-15 21:29:48,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:29:48,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-15 21:29:48,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:48,809 INFO L225 Difference]: With dead ends: 5432 [2019-11-15 21:29:48,809 INFO L226 Difference]: Without dead ends: 5396 [2019-11-15 21:29:48,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:29:48,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2019-11-15 21:29:48,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 4720. [2019-11-15 21:29:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4720 states. [2019-11-15 21:29:48,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4720 states to 4720 states and 10308 transitions. [2019-11-15 21:29:48,857 INFO L78 Accepts]: Start accepts. Automaton has 4720 states and 10308 transitions. Word has length 98 [2019-11-15 21:29:48,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:48,858 INFO L462 AbstractCegarLoop]: Abstraction has 4720 states and 10308 transitions. [2019-11-15 21:29:48,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:29:48,858 INFO L276 IsEmpty]: Start isEmpty. Operand 4720 states and 10308 transitions. [2019-11-15 21:29:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:29:48,864 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:48,864 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:48,865 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:48,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:48,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1512015362, now seen corresponding path program 1 times [2019-11-15 21:29:48,865 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:48,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050487496] [2019-11-15 21:29:48,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:48,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:48,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:48,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 21:29:48,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050487496] [2019-11-15 21:29:48,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:48,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:29:48,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426623088] [2019-11-15 21:29:48,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:29:48,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:48,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:29:48,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:29:48,961 INFO L87 Difference]: Start difference. First operand 4720 states and 10308 transitions. Second operand 5 states. [2019-11-15 21:29:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:49,361 INFO L93 Difference]: Finished difference Result 5675 states and 12337 transitions. [2019-11-15 21:29:49,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:29:49,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-11-15 21:29:49,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:49,368 INFO L225 Difference]: With dead ends: 5675 [2019-11-15 21:29:49,369 INFO L226 Difference]: Without dead ends: 5615 [2019-11-15 21:29:49,369 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:29:49,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5615 states. [2019-11-15 21:29:49,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5615 to 5301. [2019-11-15 21:29:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5301 states. [2019-11-15 21:29:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5301 states to 5301 states and 11558 transitions. [2019-11-15 21:29:49,445 INFO L78 Accepts]: Start accepts. Automaton has 5301 states and 11558 transitions. Word has length 98 [2019-11-15 21:29:49,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:49,445 INFO L462 AbstractCegarLoop]: Abstraction has 5301 states and 11558 transitions. [2019-11-15 21:29:49,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:29:49,445 INFO L276 IsEmpty]: Start isEmpty. Operand 5301 states and 11558 transitions. [2019-11-15 21:29:49,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:29:49,452 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:49,452 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:49,452 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:49,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:49,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1257278817, now seen corresponding path program 1 times [2019-11-15 21:29:49,453 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:49,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898914734] [2019-11-15 21:29:49,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:49,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:49,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:49,533 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 21:29:49,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898914734] [2019-11-15 21:29:49,533 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:49,534 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:29:49,534 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214824167] [2019-11-15 21:29:49,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:29:49,535 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:49,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:29:49,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:29:49,535 INFO L87 Difference]: Start difference. First operand 5301 states and 11558 transitions. Second operand 5 states. [2019-11-15 21:29:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:49,926 INFO L93 Difference]: Finished difference Result 6020 states and 13067 transitions. [2019-11-15 21:29:49,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:29:49,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-11-15 21:29:49,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:49,933 INFO L225 Difference]: With dead ends: 6020 [2019-11-15 21:29:49,933 INFO L226 Difference]: Without dead ends: 5962 [2019-11-15 21:29:49,935 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:29:49,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2019-11-15 21:29:50,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 4973. [2019-11-15 21:29:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4973 states. [2019-11-15 21:29:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4973 states to 4973 states and 10918 transitions. [2019-11-15 21:29:50,014 INFO L78 Accepts]: Start accepts. Automaton has 4973 states and 10918 transitions. Word has length 98 [2019-11-15 21:29:50,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:50,014 INFO L462 AbstractCegarLoop]: Abstraction has 4973 states and 10918 transitions. [2019-11-15 21:29:50,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:29:50,015 INFO L276 IsEmpty]: Start isEmpty. Operand 4973 states and 10918 transitions. [2019-11-15 21:29:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:29:50,021 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:50,021 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:50,021 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:50,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:50,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1027778627, now seen corresponding path program 2 times [2019-11-15 21:29:50,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:50,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206601459] [2019-11-15 21:29:50,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:50,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:50,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:50,265 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 21:29:50,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206601459] [2019-11-15 21:29:50,266 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:50,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:29:50,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019681015] [2019-11-15 21:29:50,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:29:50,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:50,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:29:50,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:29:50,267 INFO L87 Difference]: Start difference. First operand 4973 states and 10918 transitions. Second operand 9 states. [2019-11-15 21:29:51,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:51,429 INFO L93 Difference]: Finished difference Result 6378 states and 13859 transitions. [2019-11-15 21:29:51,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:29:51,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-11-15 21:29:51,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:51,434 INFO L225 Difference]: With dead ends: 6378 [2019-11-15 21:29:51,434 INFO L226 Difference]: Without dead ends: 6372 [2019-11-15 21:29:51,435 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:29:51,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6372 states. [2019-11-15 21:29:51,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6372 to 5648. [2019-11-15 21:29:51,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5648 states. [2019-11-15 21:29:51,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5648 states to 5648 states and 12401 transitions. [2019-11-15 21:29:51,491 INFO L78 Accepts]: Start accepts. Automaton has 5648 states and 12401 transitions. Word has length 98 [2019-11-15 21:29:51,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:51,491 INFO L462 AbstractCegarLoop]: Abstraction has 5648 states and 12401 transitions. [2019-11-15 21:29:51,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:29:51,491 INFO L276 IsEmpty]: Start isEmpty. Operand 5648 states and 12401 transitions. [2019-11-15 21:29:51,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:29:51,496 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:51,496 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:51,496 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:51,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:51,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1239129540, now seen corresponding path program 1 times [2019-11-15 21:29:51,497 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:51,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586762617] [2019-11-15 21:29:51,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:51,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:51,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:51,598 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 21:29:51,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586762617] [2019-11-15 21:29:51,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:51,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:29:51,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204857662] [2019-11-15 21:29:51,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:29:51,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:51,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:29:51,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:29:51,601 INFO L87 Difference]: Start difference. First operand 5648 states and 12401 transitions. Second operand 6 states. [2019-11-15 21:29:51,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:51,813 INFO L93 Difference]: Finished difference Result 5116 states and 11185 transitions. [2019-11-15 21:29:51,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:29:51,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-15 21:29:51,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:51,817 INFO L225 Difference]: With dead ends: 5116 [2019-11-15 21:29:51,817 INFO L226 Difference]: Without dead ends: 5116 [2019-11-15 21:29:51,818 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:29:51,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5116 states. [2019-11-15 21:29:51,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5116 to 4887. [2019-11-15 21:29:51,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4887 states. [2019-11-15 21:29:51,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4887 states to 4887 states and 10711 transitions. [2019-11-15 21:29:51,862 INFO L78 Accepts]: Start accepts. Automaton has 4887 states and 10711 transitions. Word has length 98 [2019-11-15 21:29:51,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:51,862 INFO L462 AbstractCegarLoop]: Abstraction has 4887 states and 10711 transitions. [2019-11-15 21:29:51,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:29:51,863 INFO L276 IsEmpty]: Start isEmpty. Operand 4887 states and 10711 transitions. [2019-11-15 21:29:51,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:29:51,866 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:51,866 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:51,867 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:51,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:51,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1040342556, now seen corresponding path program 1 times [2019-11-15 21:29:51,867 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:51,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805636084] [2019-11-15 21:29:51,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:51,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:51,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:51,965 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 21:29:51,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805636084] [2019-11-15 21:29:51,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:51,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:29:51,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402560712] [2019-11-15 21:29:51,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:29:51,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:51,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:29:51,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:29:51,971 INFO L87 Difference]: Start difference. First operand 4887 states and 10711 transitions. Second operand 6 states. [2019-11-15 21:29:52,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:52,300 INFO L93 Difference]: Finished difference Result 6033 states and 13185 transitions. [2019-11-15 21:29:52,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:29:52,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-15 21:29:52,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:52,305 INFO L225 Difference]: With dead ends: 6033 [2019-11-15 21:29:52,305 INFO L226 Difference]: Without dead ends: 6033 [2019-11-15 21:29:52,305 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:29:52,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6033 states. [2019-11-15 21:29:52,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6033 to 4757. [2019-11-15 21:29:52,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4757 states. [2019-11-15 21:29:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4757 states to 4757 states and 10390 transitions. [2019-11-15 21:29:52,352 INFO L78 Accepts]: Start accepts. Automaton has 4757 states and 10390 transitions. Word has length 98 [2019-11-15 21:29:52,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:52,352 INFO L462 AbstractCegarLoop]: Abstraction has 4757 states and 10390 transitions. [2019-11-15 21:29:52,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:29:52,352 INFO L276 IsEmpty]: Start isEmpty. Operand 4757 states and 10390 transitions. [2019-11-15 21:29:52,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:29:52,356 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:52,356 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:52,356 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:52,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:52,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1188731524, now seen corresponding path program 1 times [2019-11-15 21:29:52,356 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:52,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098768076] [2019-11-15 21:29:52,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:52,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:52,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:52,585 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 21:29:52,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098768076] [2019-11-15 21:29:52,586 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:52,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:29:52,586 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065515971] [2019-11-15 21:29:52,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:29:52,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:52,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:29:52,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:29:52,588 INFO L87 Difference]: Start difference. First operand 4757 states and 10390 transitions. Second operand 9 states. [2019-11-15 21:29:53,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:53,511 INFO L93 Difference]: Finished difference Result 5802 states and 12580 transitions. [2019-11-15 21:29:53,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:29:53,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-11-15 21:29:53,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:53,518 INFO L225 Difference]: With dead ends: 5802 [2019-11-15 21:29:53,518 INFO L226 Difference]: Without dead ends: 5802 [2019-11-15 21:29:53,519 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:29:53,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5802 states. [2019-11-15 21:29:53,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5802 to 5183. [2019-11-15 21:29:53,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5183 states. [2019-11-15 21:29:53,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5183 states to 5183 states and 11255 transitions. [2019-11-15 21:29:53,596 INFO L78 Accepts]: Start accepts. Automaton has 5183 states and 11255 transitions. Word has length 98 [2019-11-15 21:29:53,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:53,596 INFO L462 AbstractCegarLoop]: Abstraction has 5183 states and 11255 transitions. [2019-11-15 21:29:53,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:29:53,597 INFO L276 IsEmpty]: Start isEmpty. Operand 5183 states and 11255 transitions. [2019-11-15 21:29:53,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:29:53,602 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:53,603 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:53,603 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:53,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:53,603 INFO L82 PathProgramCache]: Analyzing trace with hash 2076235205, now seen corresponding path program 1 times [2019-11-15 21:29:53,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:53,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177771545] [2019-11-15 21:29:53,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:53,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:53,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:53,851 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 21:29:53,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177771545] [2019-11-15 21:29:53,851 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:53,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:29:53,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951420508] [2019-11-15 21:29:53,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:29:53,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:53,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:29:53,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:29:53,853 INFO L87 Difference]: Start difference. First operand 5183 states and 11255 transitions. Second operand 8 states. [2019-11-15 21:29:54,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:54,308 INFO L93 Difference]: Finished difference Result 6412 states and 13813 transitions. [2019-11-15 21:29:54,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:29:54,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2019-11-15 21:29:54,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:54,315 INFO L225 Difference]: With dead ends: 6412 [2019-11-15 21:29:54,315 INFO L226 Difference]: Without dead ends: 6412 [2019-11-15 21:29:54,315 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:29:54,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2019-11-15 21:29:54,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 5142. [2019-11-15 21:29:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5142 states. [2019-11-15 21:29:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5142 states to 5142 states and 11130 transitions. [2019-11-15 21:29:54,376 INFO L78 Accepts]: Start accepts. Automaton has 5142 states and 11130 transitions. Word has length 98 [2019-11-15 21:29:54,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:54,377 INFO L462 AbstractCegarLoop]: Abstraction has 5142 states and 11130 transitions. [2019-11-15 21:29:54,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:29:54,377 INFO L276 IsEmpty]: Start isEmpty. Operand 5142 states and 11130 transitions. [2019-11-15 21:29:54,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:29:54,383 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:54,383 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:54,383 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:54,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:54,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1400082437, now seen corresponding path program 1 times [2019-11-15 21:29:54,384 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:54,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886345642] [2019-11-15 21:29:54,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:54,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:54,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:54,577 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 21:29:54,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886345642] [2019-11-15 21:29:54,578 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:54,578 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:29:54,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256333115] [2019-11-15 21:29:54,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:29:54,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:54,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:29:54,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:29:54,580 INFO L87 Difference]: Start difference. First operand 5142 states and 11130 transitions. Second operand 8 states. [2019-11-15 21:29:55,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:55,056 INFO L93 Difference]: Finished difference Result 5336 states and 11550 transitions. [2019-11-15 21:29:55,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 21:29:55,057 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2019-11-15 21:29:55,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:55,063 INFO L225 Difference]: With dead ends: 5336 [2019-11-15 21:29:55,063 INFO L226 Difference]: Without dead ends: 5336 [2019-11-15 21:29:55,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:29:55,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5336 states. [2019-11-15 21:29:55,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5336 to 5030. [2019-11-15 21:29:55,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5030 states. [2019-11-15 21:29:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5030 states to 5030 states and 10895 transitions. [2019-11-15 21:29:55,134 INFO L78 Accepts]: Start accepts. Automaton has 5030 states and 10895 transitions. Word has length 98 [2019-11-15 21:29:55,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:55,135 INFO L462 AbstractCegarLoop]: Abstraction has 5030 states and 10895 transitions. [2019-11-15 21:29:55,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:29:55,135 INFO L276 IsEmpty]: Start isEmpty. Operand 5030 states and 10895 transitions. [2019-11-15 21:29:55,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:29:55,141 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:55,142 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:55,142 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:55,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:55,142 INFO L82 PathProgramCache]: Analyzing trace with hash -2007381178, now seen corresponding path program 1 times [2019-11-15 21:29:55,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:55,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049360052] [2019-11-15 21:29:55,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:55,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:55,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:55,338 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 21:29:55,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049360052] [2019-11-15 21:29:55,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:55,339 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 21:29:55,339 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595310150] [2019-11-15 21:29:55,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 21:29:55,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:55,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:29:55,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:29:55,340 INFO L87 Difference]: Start difference. First operand 5030 states and 10895 transitions. Second operand 10 states. [2019-11-15 21:29:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:55,873 INFO L93 Difference]: Finished difference Result 15496 states and 34141 transitions. [2019-11-15 21:29:55,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 21:29:55,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-11-15 21:29:55,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:55,883 INFO L225 Difference]: With dead ends: 15496 [2019-11-15 21:29:55,883 INFO L226 Difference]: Without dead ends: 9752 [2019-11-15 21:29:55,883 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-11-15 21:29:55,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9752 states. [2019-11-15 21:29:55,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9752 to 4625. [2019-11-15 21:29:55,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4625 states. [2019-11-15 21:29:55,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 9997 transitions. [2019-11-15 21:29:55,958 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 9997 transitions. Word has length 98 [2019-11-15 21:29:55,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:55,958 INFO L462 AbstractCegarLoop]: Abstraction has 4625 states and 9997 transitions. [2019-11-15 21:29:55,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 21:29:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 9997 transitions. [2019-11-15 21:29:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:29:55,962 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:55,962 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:55,962 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:55,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:55,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1562277968, now seen corresponding path program 2 times [2019-11-15 21:29:55,963 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:55,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106977482] [2019-11-15 21:29:55,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:55,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:55,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:56,053 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:56,054 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 21:29:56,214 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 21:29:56,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:29:56 BasicIcfg [2019-11-15 21:29:56,216 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:29:56,216 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:29:56,216 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:29:56,217 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:29:56,217 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:29:03" (3/4) ... [2019-11-15 21:29:56,220 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 21:29:56,404 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e915b479-5798-49d2-b864-51e9a37e98ea/bin/uautomizer/witness.graphml [2019-11-15 21:29:56,406 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:29:56,408 INFO L168 Benchmark]: Toolchain (without parser) took 54602.22 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.0 GB). Free memory was 946.2 MB in the beginning and 3.7 GB in the end (delta: -2.8 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-15 21:29:56,409 INFO L168 Benchmark]: CDTParser took 0.32 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 21:29:56,409 INFO L168 Benchmark]: CACSL2BoogieTranslator took 676.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -124.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:29:56,410 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:29:56,410 INFO L168 Benchmark]: Boogie Preprocessor took 39.46 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:29:56,410 INFO L168 Benchmark]: RCFGBuilder took 900.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:29:56,411 INFO L168 Benchmark]: TraceAbstraction took 52728.70 ms. Allocated memory was 1.1 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-15 21:29:56,412 INFO L168 Benchmark]: Witness Printer took 189.98 ms. Allocated memory is still 5.1 GB. Free memory was 3.8 GB in the beginning and 3.7 GB in the end (delta: 73.9 MB). Peak memory consumption was 73.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:29:56,414 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.32 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 676.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -124.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.46 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 900.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 52728.70 ms. Allocated memory was 1.1 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 189.98 ms. Allocated memory is still 5.1 GB. Free memory was 3.8 GB in the beginning and 3.7 GB in the end (delta: 73.9 MB). Peak memory consumption was 73.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L700] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L702] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L703] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L704] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L706] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L708] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L710] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L711] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L712] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L713] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L714] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L715] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L716] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L717] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L718] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L719] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L720] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L721] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L722] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L723] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L724] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L725] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 0 pthread_t t245; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t245, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 1 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 0 pthread_t t246; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] FCALL, FORK 0 pthread_create(&t246, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L736] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L737] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 [L744] 1 __unbuffered_p0_EAX = x [L747] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 [L767] 2 __unbuffered_p1_EAX = y [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 z$flush_delayed = weak$$choice2 [L773] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L775] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L776] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L777] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L778] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L780] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 z = z$flush_delayed ? z$mem_tmp : z [L783] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L751] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L753] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=1] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=1] [L786] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L790] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L818] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 221 locations, 3 error locations. Result: UNSAFE, OverallTime: 52.6s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 22.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10532 SDtfs, 11754 SDslu, 25118 SDs, 0 SdLazy, 10022 SolverSat, 540 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 372 GetRequests, 97 SyntacticMatches, 28 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71014occurred 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: 22.1s AutomataMinimizationTime, 36 MinimizatonAttempts, 107705 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2781 NumberOfCodeBlocks, 2781 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2647 ConstructedInterpolants, 0 QuantifiedInterpolants, 562943 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...