./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d3291483-6280-4426-bedc-d0891cac10c5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d3291483-6280-4426-bedc-d0891cac10c5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d3291483-6280-4426-bedc-d0891cac10c5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d3291483-6280-4426-bedc-d0891cac10c5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d3291483-6280-4426-bedc-d0891cac10c5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d3291483-6280-4426-bedc-d0891cac10c5/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 254daee91aac18eceae46897fdef61d4981a523a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:06:41,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:06:41,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:06:41,897 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:06:41,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:06:41,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:06:41,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:06:41,902 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:06:41,904 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:06:41,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:06:41,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:06:41,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:06:41,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:06:41,908 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:06:41,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:06:41,909 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:06:41,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:06:41,911 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:06:41,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:06:41,914 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:06:41,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:06:41,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:06:41,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:06:41,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:06:41,920 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:06:41,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:06:41,921 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:06:41,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:06:41,922 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:06:41,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:06:41,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:06:41,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:06:41,924 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:06:41,925 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:06:41,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:06:41,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:06:41,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:06:41,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:06:41,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:06:41,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:06:41,929 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:06:41,929 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d3291483-6280-4426-bedc-d0891cac10c5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:06:41,942 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:06:41,942 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:06:41,943 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:06:41,943 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:06:41,944 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:06:41,944 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:06:41,944 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:06:41,944 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:06:41,945 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:06:41,945 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:06:41,945 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:06:41,945 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:06:41,946 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:06:41,946 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:06:41,946 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:06:41,946 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:06:41,946 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:06:41,947 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:06:41,947 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:06:41,947 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:06:41,948 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:06:41,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:06:41,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:06:41,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:06:41,949 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:06:41,949 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:06:41,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:06:41,949 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:06:41,949 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_d3291483-6280-4426-bedc-d0891cac10c5/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 -> 254daee91aac18eceae46897fdef61d4981a523a [2019-11-15 20:06:41,974 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:06:41,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:06:41,986 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:06:41,988 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:06:41,988 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:06:41,988 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d3291483-6280-4426-bedc-d0891cac10c5/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc.i [2019-11-15 20:06:42,036 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d3291483-6280-4426-bedc-d0891cac10c5/bin/uautomizer/data/11090b2cc/f5c19e4b06014c9f92c7df2a996a1afd/FLAG32c6e7ded [2019-11-15 20:06:42,486 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:06:42,487 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d3291483-6280-4426-bedc-d0891cac10c5/sv-benchmarks/c/pthread-wmm/rfi007_power.oepc.i [2019-11-15 20:06:42,503 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d3291483-6280-4426-bedc-d0891cac10c5/bin/uautomizer/data/11090b2cc/f5c19e4b06014c9f92c7df2a996a1afd/FLAG32c6e7ded [2019-11-15 20:06:42,778 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d3291483-6280-4426-bedc-d0891cac10c5/bin/uautomizer/data/11090b2cc/f5c19e4b06014c9f92c7df2a996a1afd [2019-11-15 20:06:42,781 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:06:42,782 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:06:42,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:06:42,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:06:42,788 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:06:42,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:06:42" (1/1) ... [2019-11-15 20:06:42,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e5ba24a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:06:42, skipping insertion in model container [2019-11-15 20:06:42,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:06:42" (1/1) ... [2019-11-15 20:06:42,798 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:06:42,859 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:06:43,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:06:43,397 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:06:43,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:06:43,543 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:06:43,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:06:43 WrapperNode [2019-11-15 20:06:43,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:06:43,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:06:43,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:06:43,545 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:06:43,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:06:43" (1/1) ... [2019-11-15 20:06:43,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:06:43" (1/1) ... [2019-11-15 20:06:43,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:06:43,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:06:43,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:06:43,614 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:06:43,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:06:43" (1/1) ... [2019-11-15 20:06:43,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:06:43" (1/1) ... [2019-11-15 20:06:43,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:06:43" (1/1) ... [2019-11-15 20:06:43,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:06:43" (1/1) ... [2019-11-15 20:06:43,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:06:43" (1/1) ... [2019-11-15 20:06:43,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:06:43" (1/1) ... [2019-11-15 20:06:43,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:06:43" (1/1) ... [2019-11-15 20:06:43,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:06:43,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:06:43,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:06:43,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:06:43,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:06:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3291483-6280-4426-bedc-d0891cac10c5/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:06:43,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:06:43,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 20:06:43,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:06:43,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:06:43,712 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 20:06:43,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 20:06:43,713 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 20:06:43,713 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 20:06:43,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 20:06:43,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:06:43,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:06:43,718 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 20:06:44,456 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:06:44,456 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 20:06:44,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:06:44 BoogieIcfgContainer [2019-11-15 20:06:44,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:06:44,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:06:44,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:06:44,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:06:44,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:06:42" (1/3) ... [2019-11-15 20:06:44,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8052d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:06:44, skipping insertion in model container [2019-11-15 20:06:44,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:06:43" (2/3) ... [2019-11-15 20:06:44,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8052d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:06:44, skipping insertion in model container [2019-11-15 20:06:44,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:06:44" (3/3) ... [2019-11-15 20:06:44,466 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc.i [2019-11-15 20:06:44,525 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,526 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,526 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,526 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,526 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,527 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,527 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,527 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,527 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,528 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,528 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,528 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,528 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,528 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,529 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,529 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,529 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,529 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,530 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,530 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,530 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,530 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,530 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,531 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,531 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,531 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,531 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,531 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,532 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,532 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,533 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,533 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,533 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,533 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,535 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,535 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,536 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,536 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,536 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,536 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,536 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,537 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,538 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,539 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,539 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,539 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,539 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,540 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,540 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,540 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,540 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,540 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,540 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,540 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,540 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,541 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,541 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,541 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,541 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,541 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,541 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,542 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,542 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,542 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,542 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,542 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,542 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,542 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,542 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,550 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,550 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,550 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,550 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,550 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,550 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,553 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,553 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:06:44,565 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 20:06:44,565 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:06:44,573 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 20:06:44,583 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 20:06:44,603 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:06:44,603 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:06:44,603 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:06:44,603 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:06:44,603 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:06:44,603 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:06:44,604 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:06:44,604 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:06:44,615 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 178 transitions [2019-11-15 20:06:47,212 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32590 states. [2019-11-15 20:06:47,214 INFO L276 IsEmpty]: Start isEmpty. Operand 32590 states. [2019-11-15 20:06:47,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 20:06:47,221 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:06:47,222 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] [2019-11-15 20:06:47,225 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:06:47,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:06:47,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1414647361, now seen corresponding path program 1 times [2019-11-15 20:06:47,237 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:06:47,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896624314] [2019-11-15 20:06:47,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:06:47,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:06:47,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:06:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:47,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:06:47,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896624314] [2019-11-15 20:06:47,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:06:47,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:06:47,480 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752003452] [2019-11-15 20:06:47,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:06:47,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:06:47,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:06:47,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:06:47,502 INFO L87 Difference]: Start difference. First operand 32590 states. Second operand 4 states. [2019-11-15 20:06:48,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:06:48,476 INFO L93 Difference]: Finished difference Result 33590 states and 129567 transitions. [2019-11-15 20:06:48,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:06:48,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-15 20:06:48,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:06:48,735 INFO L225 Difference]: With dead ends: 33590 [2019-11-15 20:06:48,735 INFO L226 Difference]: Without dead ends: 25702 [2019-11-15 20:06:48,737 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:06:49,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2019-11-15 20:06:50,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 25702. [2019-11-15 20:06:50,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25702 states. [2019-11-15 20:06:50,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25702 states to 25702 states and 99583 transitions. [2019-11-15 20:06:50,392 INFO L78 Accepts]: Start accepts. Automaton has 25702 states and 99583 transitions. Word has length 33 [2019-11-15 20:06:50,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:06:50,392 INFO L462 AbstractCegarLoop]: Abstraction has 25702 states and 99583 transitions. [2019-11-15 20:06:50,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:06:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 25702 states and 99583 transitions. [2019-11-15 20:06:50,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 20:06:50,403 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:06:50,403 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:06:50,403 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:06:50,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:06:50,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1018218352, now seen corresponding path program 1 times [2019-11-15 20:06:50,404 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:06:50,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072097790] [2019-11-15 20:06:50,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:06:50,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:06:50,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:06:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:06:50,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072097790] [2019-11-15 20:06:50,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:06:50,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:06:50,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289897431] [2019-11-15 20:06:50,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:06:50,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:06:50,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:06:50,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:06:50,545 INFO L87 Difference]: Start difference. First operand 25702 states and 99583 transitions. Second operand 5 states. [2019-11-15 20:06:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:06:51,804 INFO L93 Difference]: Finished difference Result 41080 states and 150430 transitions. [2019-11-15 20:06:51,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:06:51,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-15 20:06:51,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:06:51,975 INFO L225 Difference]: With dead ends: 41080 [2019-11-15 20:06:51,975 INFO L226 Difference]: Without dead ends: 40544 [2019-11-15 20:06:51,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:06:52,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40544 states. [2019-11-15 20:06:53,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40544 to 38924. [2019-11-15 20:06:53,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38924 states. [2019-11-15 20:06:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38924 states to 38924 states and 143580 transitions. [2019-11-15 20:06:53,444 INFO L78 Accepts]: Start accepts. Automaton has 38924 states and 143580 transitions. Word has length 45 [2019-11-15 20:06:53,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:06:53,446 INFO L462 AbstractCegarLoop]: Abstraction has 38924 states and 143580 transitions. [2019-11-15 20:06:53,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:06:53,446 INFO L276 IsEmpty]: Start isEmpty. Operand 38924 states and 143580 transitions. [2019-11-15 20:06:53,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 20:06:53,452 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:06:53,453 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] [2019-11-15 20:06:53,453 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:06:53,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:06:53,453 INFO L82 PathProgramCache]: Analyzing trace with hash 352520797, now seen corresponding path program 1 times [2019-11-15 20:06:53,454 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:06:53,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800010977] [2019-11-15 20:06:53,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:06:53,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:06:53,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:06:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:53,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:06:53,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800010977] [2019-11-15 20:06:53,536 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:06:53,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:06:53,537 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549133899] [2019-11-15 20:06:53,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:06:53,537 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:06:53,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:06:53,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:06:53,538 INFO L87 Difference]: Start difference. First operand 38924 states and 143580 transitions. Second operand 5 states. [2019-11-15 20:06:54,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:06:54,107 INFO L93 Difference]: Finished difference Result 49777 states and 180632 transitions. [2019-11-15 20:06:54,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:06:54,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-15 20:06:54,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:06:54,425 INFO L225 Difference]: With dead ends: 49777 [2019-11-15 20:06:54,426 INFO L226 Difference]: Without dead ends: 49273 [2019-11-15 20:06:54,426 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:06:54,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49273 states. [2019-11-15 20:06:56,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49273 to 42676. [2019-11-15 20:06:56,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42676 states. [2019-11-15 20:06:56,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42676 states to 42676 states and 156591 transitions. [2019-11-15 20:06:56,105 INFO L78 Accepts]: Start accepts. Automaton has 42676 states and 156591 transitions. Word has length 46 [2019-11-15 20:06:56,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:06:56,106 INFO L462 AbstractCegarLoop]: Abstraction has 42676 states and 156591 transitions. [2019-11-15 20:06:56,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:06:56,106 INFO L276 IsEmpty]: Start isEmpty. Operand 42676 states and 156591 transitions. [2019-11-15 20:06:56,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 20:06:56,114 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:06:56,114 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 20:06:56,115 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:06:56,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:06:56,115 INFO L82 PathProgramCache]: Analyzing trace with hash 441299907, now seen corresponding path program 1 times [2019-11-15 20:06:56,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:06:56,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729317656] [2019-11-15 20:06:56,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:06:56,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:06:56,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:06:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:56,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:06:56,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729317656] [2019-11-15 20:06:56,179 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:06:56,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:06:56,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204745799] [2019-11-15 20:06:56,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:06:56,180 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:06:56,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:06:56,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:06:56,181 INFO L87 Difference]: Start difference. First operand 42676 states and 156591 transitions. Second operand 3 states. [2019-11-15 20:06:56,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:06:56,445 INFO L93 Difference]: Finished difference Result 61086 states and 221429 transitions. [2019-11-15 20:06:56,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:06:56,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-15 20:06:56,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:06:56,590 INFO L225 Difference]: With dead ends: 61086 [2019-11-15 20:06:56,590 INFO L226 Difference]: Without dead ends: 61086 [2019-11-15 20:06:56,590 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:06:57,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61086 states. [2019-11-15 20:06:58,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61086 to 48015. [2019-11-15 20:06:58,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48015 states. [2019-11-15 20:06:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48015 states to 48015 states and 174178 transitions. [2019-11-15 20:06:58,243 INFO L78 Accepts]: Start accepts. Automaton has 48015 states and 174178 transitions. Word has length 48 [2019-11-15 20:06:58,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:06:58,243 INFO L462 AbstractCegarLoop]: Abstraction has 48015 states and 174178 transitions. [2019-11-15 20:06:58,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:06:58,244 INFO L276 IsEmpty]: Start isEmpty. Operand 48015 states and 174178 transitions. [2019-11-15 20:06:58,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 20:06:58,261 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:06:58,261 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] [2019-11-15 20:06:58,261 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:06:58,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:06:58,262 INFO L82 PathProgramCache]: Analyzing trace with hash -2076880242, now seen corresponding path program 1 times [2019-11-15 20:06:58,262 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:06:58,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947192426] [2019-11-15 20:06:58,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:06:58,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:06:58,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:06:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:06:58,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:06:58,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947192426] [2019-11-15 20:06:58,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:06:58,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:06:58,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600675996] [2019-11-15 20:06:58,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:06:58,358 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:06:58,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:06:58,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:06:58,359 INFO L87 Difference]: Start difference. First operand 48015 states and 174178 transitions. Second operand 6 states. [2019-11-15 20:06:59,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:06:59,160 INFO L93 Difference]: Finished difference Result 61593 states and 219936 transitions. [2019-11-15 20:06:59,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:06:59,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 20:06:59,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:06:59,292 INFO L225 Difference]: With dead ends: 61593 [2019-11-15 20:06:59,292 INFO L226 Difference]: Without dead ends: 61025 [2019-11-15 20:06:59,292 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 20:06:59,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61025 states. [2019-11-15 20:07:01,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61025 to 47875. [2019-11-15 20:07:01,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47875 states. [2019-11-15 20:07:01,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47875 states to 47875 states and 174134 transitions. [2019-11-15 20:07:01,145 INFO L78 Accepts]: Start accepts. Automaton has 47875 states and 174134 transitions. Word has length 52 [2019-11-15 20:07:01,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:01,145 INFO L462 AbstractCegarLoop]: Abstraction has 47875 states and 174134 transitions. [2019-11-15 20:07:01,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:07:01,146 INFO L276 IsEmpty]: Start isEmpty. Operand 47875 states and 174134 transitions. [2019-11-15 20:07:01,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 20:07:01,160 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:01,160 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:01,160 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:01,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:01,161 INFO L82 PathProgramCache]: Analyzing trace with hash -995861021, now seen corresponding path program 1 times [2019-11-15 20:07:01,161 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:01,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097414656] [2019-11-15 20:07:01,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:01,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:01,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:01,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:01,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097414656] [2019-11-15 20:07:01,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:01,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:07:01,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224494729] [2019-11-15 20:07:01,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:07:01,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:01,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:07:01,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:07:01,313 INFO L87 Difference]: Start difference. First operand 47875 states and 174134 transitions. Second operand 6 states. [2019-11-15 20:07:02,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:02,217 INFO L93 Difference]: Finished difference Result 64221 states and 231062 transitions. [2019-11-15 20:07:02,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:07:02,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 20:07:02,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:02,347 INFO L225 Difference]: With dead ends: 64221 [2019-11-15 20:07:02,347 INFO L226 Difference]: Without dead ends: 64221 [2019-11-15 20:07:02,348 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:07:02,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64221 states. [2019-11-15 20:07:06,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64221 to 60245. [2019-11-15 20:07:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60245 states. [2019-11-15 20:07:06,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60245 states to 60245 states and 216821 transitions. [2019-11-15 20:07:06,851 INFO L78 Accepts]: Start accepts. Automaton has 60245 states and 216821 transitions. Word has length 52 [2019-11-15 20:07:06,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:06,851 INFO L462 AbstractCegarLoop]: Abstraction has 60245 states and 216821 transitions. [2019-11-15 20:07:06,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:07:06,851 INFO L276 IsEmpty]: Start isEmpty. Operand 60245 states and 216821 transitions. [2019-11-15 20:07:06,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 20:07:06,868 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:06,869 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] [2019-11-15 20:07:06,869 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:06,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:06,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1502154916, now seen corresponding path program 1 times [2019-11-15 20:07:06,869 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:06,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286839016] [2019-11-15 20:07:06,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:06,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:06,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:06,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286839016] [2019-11-15 20:07:06,956 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:06,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:07:06,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057299533] [2019-11-15 20:07:06,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:07:06,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:06,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:07:06,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:07:06,957 INFO L87 Difference]: Start difference. First operand 60245 states and 216821 transitions. Second operand 3 states. [2019-11-15 20:07:07,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:07,232 INFO L93 Difference]: Finished difference Result 54168 states and 189807 transitions. [2019-11-15 20:07:07,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:07:07,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-15 20:07:07,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:07,380 INFO L225 Difference]: With dead ends: 54168 [2019-11-15 20:07:07,380 INFO L226 Difference]: Without dead ends: 54168 [2019-11-15 20:07:07,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:07:07,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54168 states. [2019-11-15 20:07:08,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54168 to 53489. [2019-11-15 20:07:08,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53489 states. [2019-11-15 20:07:08,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53489 states to 53489 states and 187733 transitions. [2019-11-15 20:07:08,456 INFO L78 Accepts]: Start accepts. Automaton has 53489 states and 187733 transitions. Word has length 52 [2019-11-15 20:07:08,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:08,457 INFO L462 AbstractCegarLoop]: Abstraction has 53489 states and 187733 transitions. [2019-11-15 20:07:08,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:07:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 53489 states and 187733 transitions. [2019-11-15 20:07:08,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 20:07:08,469 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:08,469 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] [2019-11-15 20:07:08,469 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:08,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:08,470 INFO L82 PathProgramCache]: Analyzing trace with hash -834238100, now seen corresponding path program 1 times [2019-11-15 20:07:08,470 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:08,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449929433] [2019-11-15 20:07:08,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:08,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:08,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:08,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 20:07:08,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449929433] [2019-11-15 20:07:08,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:08,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:07:08,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311303765] [2019-11-15 20:07:08,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:07:08,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:08,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:07:08,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:07:08,567 INFO L87 Difference]: Start difference. First operand 53489 states and 187733 transitions. Second operand 5 states. [2019-11-15 20:07:08,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:08,646 INFO L93 Difference]: Finished difference Result 10211 states and 31245 transitions. [2019-11-15 20:07:08,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:07:08,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-11-15 20:07:08,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:08,657 INFO L225 Difference]: With dead ends: 10211 [2019-11-15 20:07:08,657 INFO L226 Difference]: Without dead ends: 8506 [2019-11-15 20:07:08,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:07:08,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8506 states. [2019-11-15 20:07:08,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8506 to 8458. [2019-11-15 20:07:08,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8458 states. [2019-11-15 20:07:08,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8458 states to 8458 states and 25324 transitions. [2019-11-15 20:07:08,765 INFO L78 Accepts]: Start accepts. Automaton has 8458 states and 25324 transitions. Word has length 53 [2019-11-15 20:07:08,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:08,766 INFO L462 AbstractCegarLoop]: Abstraction has 8458 states and 25324 transitions. [2019-11-15 20:07:08,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:07:08,766 INFO L276 IsEmpty]: Start isEmpty. Operand 8458 states and 25324 transitions. [2019-11-15 20:07:08,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 20:07:08,768 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:08,769 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] [2019-11-15 20:07:08,769 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:08,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:08,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1137223062, now seen corresponding path program 1 times [2019-11-15 20:07:08,770 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:08,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503077274] [2019-11-15 20:07:08,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:08,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:08,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:08,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503077274] [2019-11-15 20:07:08,847 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:08,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:07:08,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66033675] [2019-11-15 20:07:08,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:07:08,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:08,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:07:08,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:07:08,848 INFO L87 Difference]: Start difference. First operand 8458 states and 25324 transitions. Second operand 4 states. [2019-11-15 20:07:08,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:08,962 INFO L93 Difference]: Finished difference Result 9705 states and 29103 transitions. [2019-11-15 20:07:08,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:07:08,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 20:07:08,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:08,975 INFO L225 Difference]: With dead ends: 9705 [2019-11-15 20:07:08,975 INFO L226 Difference]: Without dead ends: 9705 [2019-11-15 20:07:08,975 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:07:08,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9705 states. [2019-11-15 20:07:09,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9705 to 8878. [2019-11-15 20:07:09,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8878 states. [2019-11-15 20:07:09,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8878 states to 8878 states and 26587 transitions. [2019-11-15 20:07:09,088 INFO L78 Accepts]: Start accepts. Automaton has 8878 states and 26587 transitions. Word has length 60 [2019-11-15 20:07:09,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:09,088 INFO L462 AbstractCegarLoop]: Abstraction has 8878 states and 26587 transitions. [2019-11-15 20:07:09,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:07:09,089 INFO L276 IsEmpty]: Start isEmpty. Operand 8878 states and 26587 transitions. [2019-11-15 20:07:09,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 20:07:09,091 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:09,091 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] [2019-11-15 20:07:09,092 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:09,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:09,092 INFO L82 PathProgramCache]: Analyzing trace with hash 605587273, now seen corresponding path program 1 times [2019-11-15 20:07:09,092 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:09,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576037711] [2019-11-15 20:07:09,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:09,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:09,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:09,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:09,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576037711] [2019-11-15 20:07:09,175 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:09,175 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:07:09,176 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333479750] [2019-11-15 20:07:09,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:07:09,176 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:09,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:07:09,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:07:09,177 INFO L87 Difference]: Start difference. First operand 8878 states and 26587 transitions. Second operand 6 states. [2019-11-15 20:07:09,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:09,679 INFO L93 Difference]: Finished difference Result 11194 states and 33074 transitions. [2019-11-15 20:07:09,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:07:09,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-15 20:07:09,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:09,698 INFO L225 Difference]: With dead ends: 11194 [2019-11-15 20:07:09,698 INFO L226 Difference]: Without dead ends: 11133 [2019-11-15 20:07:09,698 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:07:09,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11133 states. [2019-11-15 20:07:09,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11133 to 10409. [2019-11-15 20:07:09,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10409 states. [2019-11-15 20:07:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10409 states to 10409 states and 30941 transitions. [2019-11-15 20:07:10,221 INFO L78 Accepts]: Start accepts. Automaton has 10409 states and 30941 transitions. Word has length 60 [2019-11-15 20:07:10,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:10,222 INFO L462 AbstractCegarLoop]: Abstraction has 10409 states and 30941 transitions. [2019-11-15 20:07:10,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:07:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 10409 states and 30941 transitions. [2019-11-15 20:07:10,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:07:10,227 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:10,227 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] [2019-11-15 20:07:10,227 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:10,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:10,227 INFO L82 PathProgramCache]: Analyzing trace with hash -55827014, now seen corresponding path program 1 times [2019-11-15 20:07:10,228 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:10,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957215404] [2019-11-15 20:07:10,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:10,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:10,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:10,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:10,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957215404] [2019-11-15 20:07:10,264 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:10,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:07:10,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698422477] [2019-11-15 20:07:10,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:07:10,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:10,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:07:10,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:07:10,265 INFO L87 Difference]: Start difference. First operand 10409 states and 30941 transitions. Second operand 3 states. [2019-11-15 20:07:10,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:10,337 INFO L93 Difference]: Finished difference Result 12981 states and 38320 transitions. [2019-11-15 20:07:10,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:07:10,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-15 20:07:10,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:10,354 INFO L225 Difference]: With dead ends: 12981 [2019-11-15 20:07:10,354 INFO L226 Difference]: Without dead ends: 12981 [2019-11-15 20:07:10,355 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:07:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12981 states. [2019-11-15 20:07:10,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12981 to 10055. [2019-11-15 20:07:10,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10055 states. [2019-11-15 20:07:10,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10055 states to 10055 states and 29419 transitions. [2019-11-15 20:07:10,490 INFO L78 Accepts]: Start accepts. Automaton has 10055 states and 29419 transitions. Word has length 66 [2019-11-15 20:07:10,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:10,491 INFO L462 AbstractCegarLoop]: Abstraction has 10055 states and 29419 transitions. [2019-11-15 20:07:10,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:07:10,491 INFO L276 IsEmpty]: Start isEmpty. Operand 10055 states and 29419 transitions. [2019-11-15 20:07:10,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:07:10,496 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:10,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] [2019-11-15 20:07:10,496 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:10,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:10,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1868799208, now seen corresponding path program 1 times [2019-11-15 20:07:10,496 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:10,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374427351] [2019-11-15 20:07:10,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:10,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:10,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:10,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:10,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374427351] [2019-11-15 20:07:10,548 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:10,548 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:07:10,548 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314181698] [2019-11-15 20:07:10,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:07:10,549 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:10,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:07:10,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:07:10,549 INFO L87 Difference]: Start difference. First operand 10055 states and 29419 transitions. Second operand 4 states. [2019-11-15 20:07:10,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:10,867 INFO L93 Difference]: Finished difference Result 13024 states and 37644 transitions. [2019-11-15 20:07:10,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:07:10,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 20:07:10,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:10,889 INFO L225 Difference]: With dead ends: 13024 [2019-11-15 20:07:10,890 INFO L226 Difference]: Without dead ends: 13024 [2019-11-15 20:07:10,890 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:07:10,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13024 states. [2019-11-15 20:07:11,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13024 to 11485. [2019-11-15 20:07:11,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11485 states. [2019-11-15 20:07:11,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11485 states to 11485 states and 33302 transitions. [2019-11-15 20:07:11,046 INFO L78 Accepts]: Start accepts. Automaton has 11485 states and 33302 transitions. Word has length 66 [2019-11-15 20:07:11,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:11,047 INFO L462 AbstractCegarLoop]: Abstraction has 11485 states and 33302 transitions. [2019-11-15 20:07:11,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:07:11,047 INFO L276 IsEmpty]: Start isEmpty. Operand 11485 states and 33302 transitions. [2019-11-15 20:07:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:07:11,054 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:11,054 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] [2019-11-15 20:07:11,054 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:11,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:11,054 INFO L82 PathProgramCache]: Analyzing trace with hash -624034727, now seen corresponding path program 1 times [2019-11-15 20:07:11,054 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:11,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329880025] [2019-11-15 20:07:11,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:11,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:11,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:11,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329880025] [2019-11-15 20:07:11,178 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:11,178 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:07:11,178 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659211684] [2019-11-15 20:07:11,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:07:11,179 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:11,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:07:11,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:07:11,180 INFO L87 Difference]: Start difference. First operand 11485 states and 33302 transitions. Second operand 6 states. [2019-11-15 20:07:11,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:11,816 INFO L93 Difference]: Finished difference Result 12624 states and 35968 transitions. [2019-11-15 20:07:11,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:07:11,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 20:07:11,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:11,836 INFO L225 Difference]: With dead ends: 12624 [2019-11-15 20:07:11,837 INFO L226 Difference]: Without dead ends: 12624 [2019-11-15 20:07:11,837 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:07:11,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12624 states. [2019-11-15 20:07:12,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12624 to 12326. [2019-11-15 20:07:12,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12326 states. [2019-11-15 20:07:12,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12326 states to 12326 states and 35227 transitions. [2019-11-15 20:07:12,022 INFO L78 Accepts]: Start accepts. Automaton has 12326 states and 35227 transitions. Word has length 66 [2019-11-15 20:07:12,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:12,022 INFO L462 AbstractCegarLoop]: Abstraction has 12326 states and 35227 transitions. [2019-11-15 20:07:12,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:07:12,022 INFO L276 IsEmpty]: Start isEmpty. Operand 12326 states and 35227 transitions. [2019-11-15 20:07:12,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:07:12,029 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:12,029 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] [2019-11-15 20:07:12,030 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:12,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:12,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1593723226, now seen corresponding path program 1 times [2019-11-15 20:07:12,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:12,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373507302] [2019-11-15 20:07:12,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:12,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:12,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:12,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373507302] [2019-11-15 20:07:12,147 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:12,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:07:12,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193597399] [2019-11-15 20:07:12,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:07:12,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:12,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:07:12,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:07:12,149 INFO L87 Difference]: Start difference. First operand 12326 states and 35227 transitions. Second operand 6 states. [2019-11-15 20:07:12,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:12,691 INFO L93 Difference]: Finished difference Result 14179 states and 39338 transitions. [2019-11-15 20:07:12,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:07:12,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 20:07:12,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:12,713 INFO L225 Difference]: With dead ends: 14179 [2019-11-15 20:07:12,714 INFO L226 Difference]: Without dead ends: 14179 [2019-11-15 20:07:12,715 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:07:12,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14179 states. [2019-11-15 20:07:12,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14179 to 12926. [2019-11-15 20:07:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12926 states. [2019-11-15 20:07:12,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12926 states to 12926 states and 36258 transitions. [2019-11-15 20:07:12,880 INFO L78 Accepts]: Start accepts. Automaton has 12926 states and 36258 transitions. Word has length 66 [2019-11-15 20:07:12,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:12,880 INFO L462 AbstractCegarLoop]: Abstraction has 12926 states and 36258 transitions. [2019-11-15 20:07:12,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:07:12,880 INFO L276 IsEmpty]: Start isEmpty. Operand 12926 states and 36258 transitions. [2019-11-15 20:07:12,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:07:12,888 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:12,888 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] [2019-11-15 20:07:12,888 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:12,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:12,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1805074139, now seen corresponding path program 1 times [2019-11-15 20:07:12,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:12,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709734810] [2019-11-15 20:07:12,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:12,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:12,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:12,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709734810] [2019-11-15 20:07:12,982 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:12,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:07:12,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764808673] [2019-11-15 20:07:12,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:07:12,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:12,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:07:12,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:07:12,984 INFO L87 Difference]: Start difference. First operand 12926 states and 36258 transitions. Second operand 5 states. [2019-11-15 20:07:13,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:13,320 INFO L93 Difference]: Finished difference Result 16752 states and 46765 transitions. [2019-11-15 20:07:13,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:07:13,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 20:07:13,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:13,346 INFO L225 Difference]: With dead ends: 16752 [2019-11-15 20:07:13,347 INFO L226 Difference]: Without dead ends: 16752 [2019-11-15 20:07:13,347 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:07:13,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16752 states. [2019-11-15 20:07:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16752 to 15456. [2019-11-15 20:07:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15456 states. [2019-11-15 20:07:13,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15456 states to 15456 states and 42981 transitions. [2019-11-15 20:07:13,543 INFO L78 Accepts]: Start accepts. Automaton has 15456 states and 42981 transitions. Word has length 66 [2019-11-15 20:07:13,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:13,544 INFO L462 AbstractCegarLoop]: Abstraction has 15456 states and 42981 transitions. [2019-11-15 20:07:13,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:07:13,544 INFO L276 IsEmpty]: Start isEmpty. Operand 15456 states and 42981 transitions. [2019-11-15 20:07:13,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:07:13,553 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:13,553 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] [2019-11-15 20:07:13,553 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:13,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:13,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1294539962, now seen corresponding path program 1 times [2019-11-15 20:07:13,554 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:13,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138648044] [2019-11-15 20:07:13,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:13,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:13,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:13,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138648044] [2019-11-15 20:07:13,626 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:13,626 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:07:13,626 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139916408] [2019-11-15 20:07:13,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:07:13,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:13,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:07:13,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:07:13,631 INFO L87 Difference]: Start difference. First operand 15456 states and 42981 transitions. Second operand 5 states. [2019-11-15 20:07:13,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:13,692 INFO L93 Difference]: Finished difference Result 5880 states and 13569 transitions. [2019-11-15 20:07:13,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:07:13,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 20:07:13,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:13,698 INFO L225 Difference]: With dead ends: 5880 [2019-11-15 20:07:13,698 INFO L226 Difference]: Without dead ends: 5034 [2019-11-15 20:07:13,698 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:07:13,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5034 states. [2019-11-15 20:07:13,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5034 to 4609. [2019-11-15 20:07:13,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4609 states. [2019-11-15 20:07:13,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4609 states to 4609 states and 10279 transitions. [2019-11-15 20:07:13,757 INFO L78 Accepts]: Start accepts. Automaton has 4609 states and 10279 transitions. Word has length 66 [2019-11-15 20:07:13,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:13,757 INFO L462 AbstractCegarLoop]: Abstraction has 4609 states and 10279 transitions. [2019-11-15 20:07:13,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:07:13,757 INFO L276 IsEmpty]: Start isEmpty. Operand 4609 states and 10279 transitions. [2019-11-15 20:07:13,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 20:07:13,763 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:13,764 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] [2019-11-15 20:07:13,764 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:13,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:13,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1221361139, now seen corresponding path program 1 times [2019-11-15 20:07:13,765 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:13,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691044299] [2019-11-15 20:07:13,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:13,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:13,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:13,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:13,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691044299] [2019-11-15 20:07:13,840 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:13,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:07:13,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491054203] [2019-11-15 20:07:13,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:07:13,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:13,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:07:13,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:07:13,842 INFO L87 Difference]: Start difference. First operand 4609 states and 10279 transitions. Second operand 5 states. [2019-11-15 20:07:14,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:14,049 INFO L93 Difference]: Finished difference Result 5680 states and 12727 transitions. [2019-11-15 20:07:14,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:07:14,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-11-15 20:07:14,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:14,056 INFO L225 Difference]: With dead ends: 5680 [2019-11-15 20:07:14,056 INFO L226 Difference]: Without dead ends: 5680 [2019-11-15 20:07:14,056 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:07:14,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5680 states. [2019-11-15 20:07:14,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5680 to 5029. [2019-11-15 20:07:14,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5029 states. [2019-11-15 20:07:14,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5029 states to 5029 states and 11237 transitions. [2019-11-15 20:07:14,124 INFO L78 Accepts]: Start accepts. Automaton has 5029 states and 11237 transitions. Word has length 72 [2019-11-15 20:07:14,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:14,125 INFO L462 AbstractCegarLoop]: Abstraction has 5029 states and 11237 transitions. [2019-11-15 20:07:14,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:07:14,126 INFO L276 IsEmpty]: Start isEmpty. Operand 5029 states and 11237 transitions. [2019-11-15 20:07:14,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 20:07:14,132 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:14,132 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] [2019-11-15 20:07:14,133 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:14,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:14,133 INFO L82 PathProgramCache]: Analyzing trace with hash 521449196, now seen corresponding path program 1 times [2019-11-15 20:07:14,133 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:14,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088769019] [2019-11-15 20:07:14,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:14,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:14,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:14,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:14,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088769019] [2019-11-15 20:07:14,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:14,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:07:14,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579273367] [2019-11-15 20:07:14,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:07:14,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:14,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:07:14,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:07:14,223 INFO L87 Difference]: Start difference. First operand 5029 states and 11237 transitions. Second operand 7 states. [2019-11-15 20:07:14,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:14,626 INFO L93 Difference]: Finished difference Result 5915 states and 13088 transitions. [2019-11-15 20:07:14,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:07:14,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-11-15 20:07:14,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:14,631 INFO L225 Difference]: With dead ends: 5915 [2019-11-15 20:07:14,631 INFO L226 Difference]: Without dead ends: 5862 [2019-11-15 20:07:14,632 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-15 20:07:14,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5862 states. [2019-11-15 20:07:14,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5862 to 5116. [2019-11-15 20:07:14,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5116 states. [2019-11-15 20:07:14,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5116 states to 5116 states and 11326 transitions. [2019-11-15 20:07:14,683 INFO L78 Accepts]: Start accepts. Automaton has 5116 states and 11326 transitions. Word has length 72 [2019-11-15 20:07:14,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:14,684 INFO L462 AbstractCegarLoop]: Abstraction has 5116 states and 11326 transitions. [2019-11-15 20:07:14,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:07:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 5116 states and 11326 transitions. [2019-11-15 20:07:14,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:07:14,688 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:14,688 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] [2019-11-15 20:07:14,689 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:14,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:14,689 INFO L82 PathProgramCache]: Analyzing trace with hash 809003014, now seen corresponding path program 1 times [2019-11-15 20:07:14,689 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:14,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546281912] [2019-11-15 20:07:14,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:14,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:14,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:14,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:14,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546281912] [2019-11-15 20:07:14,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:14,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:07:14,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508187351] [2019-11-15 20:07:14,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:07:14,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:14,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:07:14,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:07:14,786 INFO L87 Difference]: Start difference. First operand 5116 states and 11326 transitions. Second operand 4 states. [2019-11-15 20:07:14,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:14,903 INFO L93 Difference]: Finished difference Result 6138 states and 13497 transitions. [2019-11-15 20:07:14,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:07:14,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-15 20:07:14,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:14,908 INFO L225 Difference]: With dead ends: 6138 [2019-11-15 20:07:14,908 INFO L226 Difference]: Without dead ends: 6138 [2019-11-15 20:07:14,908 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 20:07:14,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6138 states. [2019-11-15 20:07:14,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6138 to 5425. [2019-11-15 20:07:14,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5425 states. [2019-11-15 20:07:14,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5425 states to 5425 states and 11987 transitions. [2019-11-15 20:07:14,962 INFO L78 Accepts]: Start accepts. Automaton has 5425 states and 11987 transitions. Word has length 93 [2019-11-15 20:07:14,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:14,963 INFO L462 AbstractCegarLoop]: Abstraction has 5425 states and 11987 transitions. [2019-11-15 20:07:14,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:07:14,963 INFO L276 IsEmpty]: Start isEmpty. Operand 5425 states and 11987 transitions. [2019-11-15 20:07:14,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:07:14,968 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:14,968 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:14,969 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:14,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:14,969 INFO L82 PathProgramCache]: Analyzing trace with hash -573488965, now seen corresponding path program 1 times [2019-11-15 20:07:14,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:14,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502207029] [2019-11-15 20:07:14,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:14,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:14,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:15,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 20:07:15,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502207029] [2019-11-15 20:07:15,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:15,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:07:15,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714875768] [2019-11-15 20:07:15,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:07:15,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:15,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:07:15,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:07:15,044 INFO L87 Difference]: Start difference. First operand 5425 states and 11987 transitions. Second operand 5 states. [2019-11-15 20:07:15,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:15,286 INFO L93 Difference]: Finished difference Result 6229 states and 13700 transitions. [2019-11-15 20:07:15,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:07:15,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 20:07:15,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:15,292 INFO L225 Difference]: With dead ends: 6229 [2019-11-15 20:07:15,292 INFO L226 Difference]: Without dead ends: 6229 [2019-11-15 20:07:15,292 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:07:15,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6229 states. [2019-11-15 20:07:15,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6229 to 5442. [2019-11-15 20:07:15,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5442 states. [2019-11-15 20:07:15,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5442 states to 5442 states and 12021 transitions. [2019-11-15 20:07:15,347 INFO L78 Accepts]: Start accepts. Automaton has 5442 states and 12021 transitions. Word has length 95 [2019-11-15 20:07:15,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:15,348 INFO L462 AbstractCegarLoop]: Abstraction has 5442 states and 12021 transitions. [2019-11-15 20:07:15,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:07:15,348 INFO L276 IsEmpty]: Start isEmpty. Operand 5442 states and 12021 transitions. [2019-11-15 20:07:15,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:07:15,352 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:15,353 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:15,353 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:15,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:15,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1888601341, now seen corresponding path program 1 times [2019-11-15 20:07:15,353 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:15,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462298768] [2019-11-15 20:07:15,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:15,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:15,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:15,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:15,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462298768] [2019-11-15 20:07:15,435 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:15,435 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:07:15,435 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851805854] [2019-11-15 20:07:15,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:07:15,436 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:15,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:07:15,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:07:15,436 INFO L87 Difference]: Start difference. First operand 5442 states and 12021 transitions. Second operand 5 states. [2019-11-15 20:07:15,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:15,573 INFO L93 Difference]: Finished difference Result 5911 states and 13042 transitions. [2019-11-15 20:07:15,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:07:15,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 20:07:15,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:15,580 INFO L225 Difference]: With dead ends: 5911 [2019-11-15 20:07:15,580 INFO L226 Difference]: Without dead ends: 5911 [2019-11-15 20:07:15,581 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:07:15,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5911 states. [2019-11-15 20:07:15,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5911 to 4555. [2019-11-15 20:07:15,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4555 states. [2019-11-15 20:07:15,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4555 states to 4555 states and 10050 transitions. [2019-11-15 20:07:15,914 INFO L78 Accepts]: Start accepts. Automaton has 4555 states and 10050 transitions. Word has length 95 [2019-11-15 20:07:15,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:15,914 INFO L462 AbstractCegarLoop]: Abstraction has 4555 states and 10050 transitions. [2019-11-15 20:07:15,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:07:15,914 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 10050 transitions. [2019-11-15 20:07:15,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:07:15,920 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:15,921 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:15,921 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:15,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:15,921 INFO L82 PathProgramCache]: Analyzing trace with hash -680885058, now seen corresponding path program 1 times [2019-11-15 20:07:15,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:15,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503590716] [2019-11-15 20:07:15,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:15,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:15,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:15,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503590716] [2019-11-15 20:07:15,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:15,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:07:15,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258891958] [2019-11-15 20:07:15,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:07:15,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:15,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:07:15,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:07:15,999 INFO L87 Difference]: Start difference. First operand 4555 states and 10050 transitions. Second operand 4 states. [2019-11-15 20:07:16,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:16,109 INFO L93 Difference]: Finished difference Result 4986 states and 11026 transitions. [2019-11-15 20:07:16,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:07:16,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 20:07:16,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:16,115 INFO L225 Difference]: With dead ends: 4986 [2019-11-15 20:07:16,115 INFO L226 Difference]: Without dead ends: 4986 [2019-11-15 20:07:16,116 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:07:16,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4986 states. [2019-11-15 20:07:16,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4986 to 4626. [2019-11-15 20:07:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4626 states. [2019-11-15 20:07:16,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4626 states to 4626 states and 10201 transitions. [2019-11-15 20:07:16,176 INFO L78 Accepts]: Start accepts. Automaton has 4626 states and 10201 transitions. Word has length 95 [2019-11-15 20:07:16,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:16,177 INFO L462 AbstractCegarLoop]: Abstraction has 4626 states and 10201 transitions. [2019-11-15 20:07:16,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:07:16,177 INFO L276 IsEmpty]: Start isEmpty. Operand 4626 states and 10201 transitions. [2019-11-15 20:07:16,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:07:16,182 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:16,183 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:16,183 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:16,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:16,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1191419235, now seen corresponding path program 1 times [2019-11-15 20:07:16,183 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:16,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899450382] [2019-11-15 20:07:16,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:16,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:16,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:16,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:16,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899450382] [2019-11-15 20:07:16,320 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:16,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 20:07:16,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164628840] [2019-11-15 20:07:16,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:07:16,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:16,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:07:16,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:07:16,323 INFO L87 Difference]: Start difference. First operand 4626 states and 10201 transitions. Second operand 8 states. [2019-11-15 20:07:16,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:16,920 INFO L93 Difference]: Finished difference Result 6555 states and 14550 transitions. [2019-11-15 20:07:16,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 20:07:16,921 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-11-15 20:07:16,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:16,926 INFO L225 Difference]: With dead ends: 6555 [2019-11-15 20:07:16,926 INFO L226 Difference]: Without dead ends: 6537 [2019-11-15 20:07:16,926 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2019-11-15 20:07:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6537 states. [2019-11-15 20:07:16,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6537 to 5086. [2019-11-15 20:07:16,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5086 states. [2019-11-15 20:07:16,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5086 states to 5086 states and 11250 transitions. [2019-11-15 20:07:16,986 INFO L78 Accepts]: Start accepts. Automaton has 5086 states and 11250 transitions. Word has length 95 [2019-11-15 20:07:16,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:16,986 INFO L462 AbstractCegarLoop]: Abstraction has 5086 states and 11250 transitions. [2019-11-15 20:07:16,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:07:16,986 INFO L276 IsEmpty]: Start isEmpty. Operand 5086 states and 11250 transitions. [2019-11-15 20:07:16,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:07:16,990 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:16,990 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:16,990 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:16,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:16,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1306596702, now seen corresponding path program 1 times [2019-11-15 20:07:16,991 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:16,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937940271] [2019-11-15 20:07:16,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:16,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:16,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:17,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937940271] [2019-11-15 20:07:17,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:17,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 20:07:17,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185480969] [2019-11-15 20:07:17,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:07:17,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:17,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:07:17,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:07:17,125 INFO L87 Difference]: Start difference. First operand 5086 states and 11250 transitions. Second operand 8 states. [2019-11-15 20:07:17,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:17,935 INFO L93 Difference]: Finished difference Result 8177 states and 17957 transitions. [2019-11-15 20:07:17,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 20:07:17,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-11-15 20:07:17,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:17,944 INFO L225 Difference]: With dead ends: 8177 [2019-11-15 20:07:17,944 INFO L226 Difference]: Without dead ends: 8161 [2019-11-15 20:07:17,945 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-11-15 20:07:17,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8161 states. [2019-11-15 20:07:18,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8161 to 5827. [2019-11-15 20:07:18,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5827 states. [2019-11-15 20:07:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5827 states to 5827 states and 12921 transitions. [2019-11-15 20:07:18,018 INFO L78 Accepts]: Start accepts. Automaton has 5827 states and 12921 transitions. Word has length 95 [2019-11-15 20:07:18,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:18,018 INFO L462 AbstractCegarLoop]: Abstraction has 5827 states and 12921 transitions. [2019-11-15 20:07:18,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:07:18,018 INFO L276 IsEmpty]: Start isEmpty. Operand 5827 states and 12921 transitions. [2019-11-15 20:07:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:07:18,024 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:18,024 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:18,024 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:18,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:18,025 INFO L82 PathProgramCache]: Analyzing trace with hash 994740282, now seen corresponding path program 2 times [2019-11-15 20:07:18,025 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:18,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776546029] [2019-11-15 20:07:18,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:18,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:18,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:18,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776546029] [2019-11-15 20:07:18,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:18,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:07:18,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089864557] [2019-11-15 20:07:18,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:07:18,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:18,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:07:18,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:07:18,144 INFO L87 Difference]: Start difference. First operand 5827 states and 12921 transitions. Second operand 7 states. [2019-11-15 20:07:19,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:19,242 INFO L93 Difference]: Finished difference Result 9847 states and 21689 transitions. [2019-11-15 20:07:19,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 20:07:19,243 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-15 20:07:19,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:19,250 INFO L225 Difference]: With dead ends: 9847 [2019-11-15 20:07:19,250 INFO L226 Difference]: Without dead ends: 9731 [2019-11-15 20:07:19,251 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-11-15 20:07:19,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9731 states. [2019-11-15 20:07:19,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9731 to 6395. [2019-11-15 20:07:19,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6395 states. [2019-11-15 20:07:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6395 states to 6395 states and 14266 transitions. [2019-11-15 20:07:19,332 INFO L78 Accepts]: Start accepts. Automaton has 6395 states and 14266 transitions. Word has length 95 [2019-11-15 20:07:19,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:19,332 INFO L462 AbstractCegarLoop]: Abstraction has 6395 states and 14266 transitions. [2019-11-15 20:07:19,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:07:19,332 INFO L276 IsEmpty]: Start isEmpty. Operand 6395 states and 14266 transitions. [2019-11-15 20:07:19,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:07:19,338 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:19,338 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:19,339 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:19,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:19,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1225016475, now seen corresponding path program 1 times [2019-11-15 20:07:19,339 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:19,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486458844] [2019-11-15 20:07:19,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:19,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:19,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:19,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:19,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486458844] [2019-11-15 20:07:19,478 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:19,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:07:19,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863852169] [2019-11-15 20:07:19,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:07:19,479 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:19,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:07:19,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:07:19,480 INFO L87 Difference]: Start difference. First operand 6395 states and 14266 transitions. Second operand 6 states. [2019-11-15 20:07:19,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:19,664 INFO L93 Difference]: Finished difference Result 6363 states and 13938 transitions. [2019-11-15 20:07:19,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:07:19,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-15 20:07:19,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:19,670 INFO L225 Difference]: With dead ends: 6363 [2019-11-15 20:07:19,670 INFO L226 Difference]: Without dead ends: 6289 [2019-11-15 20:07:19,670 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:07:19,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6289 states. [2019-11-15 20:07:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6289 to 5497. [2019-11-15 20:07:19,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5497 states. [2019-11-15 20:07:19,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5497 states to 5497 states and 12147 transitions. [2019-11-15 20:07:19,725 INFO L78 Accepts]: Start accepts. Automaton has 5497 states and 12147 transitions. Word has length 95 [2019-11-15 20:07:19,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:19,725 INFO L462 AbstractCegarLoop]: Abstraction has 5497 states and 12147 transitions. [2019-11-15 20:07:19,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:07:19,725 INFO L276 IsEmpty]: Start isEmpty. Operand 5497 states and 12147 transitions. [2019-11-15 20:07:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:07:19,729 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:19,730 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:19,730 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:19,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:19,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1577076262, now seen corresponding path program 1 times [2019-11-15 20:07:19,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:19,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243086183] [2019-11-15 20:07:19,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:19,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:19,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:19,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 20:07:19,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243086183] [2019-11-15 20:07:19,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:19,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 20:07:19,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112951126] [2019-11-15 20:07:19,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:07:19,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:19,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:07:19,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:07:19,897 INFO L87 Difference]: Start difference. First operand 5497 states and 12147 transitions. Second operand 10 states. [2019-11-15 20:07:20,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:20,706 INFO L93 Difference]: Finished difference Result 7264 states and 15935 transitions. [2019-11-15 20:07:20,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 20:07:20,707 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-11-15 20:07:20,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:20,712 INFO L225 Difference]: With dead ends: 7264 [2019-11-15 20:07:20,712 INFO L226 Difference]: Without dead ends: 7240 [2019-11-15 20:07:20,713 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-11-15 20:07:20,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7240 states. [2019-11-15 20:07:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7240 to 5705. [2019-11-15 20:07:20,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5705 states. [2019-11-15 20:07:20,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5705 states to 5705 states and 12574 transitions. [2019-11-15 20:07:20,775 INFO L78 Accepts]: Start accepts. Automaton has 5705 states and 12574 transitions. Word has length 95 [2019-11-15 20:07:20,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:20,775 INFO L462 AbstractCegarLoop]: Abstraction has 5705 states and 12574 transitions. [2019-11-15 20:07:20,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:07:20,775 INFO L276 IsEmpty]: Start isEmpty. Operand 5705 states and 12574 transitions. [2019-11-15 20:07:20,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:07:20,780 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:20,780 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:20,780 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:20,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:20,781 INFO L82 PathProgramCache]: Analyzing trace with hash 475672729, now seen corresponding path program 1 times [2019-11-15 20:07:20,781 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:20,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970643558] [2019-11-15 20:07:20,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:20,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:20,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:20,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970643558] [2019-11-15 20:07:20,873 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:20,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:07:20,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30794897] [2019-11-15 20:07:20,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:07:20,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:20,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:07:20,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:07:20,874 INFO L87 Difference]: Start difference. First operand 5705 states and 12574 transitions. Second operand 6 states. [2019-11-15 20:07:21,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:21,320 INFO L93 Difference]: Finished difference Result 7046 states and 15400 transitions. [2019-11-15 20:07:21,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:07:21,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-15 20:07:21,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:21,329 INFO L225 Difference]: With dead ends: 7046 [2019-11-15 20:07:21,329 INFO L226 Difference]: Without dead ends: 6980 [2019-11-15 20:07:21,330 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 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 20:07:21,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6980 states. [2019-11-15 20:07:21,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6980 to 5489. [2019-11-15 20:07:21,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5489 states. [2019-11-15 20:07:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5489 states to 5489 states and 12154 transitions. [2019-11-15 20:07:21,413 INFO L78 Accepts]: Start accepts. Automaton has 5489 states and 12154 transitions. Word has length 95 [2019-11-15 20:07:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:21,414 INFO L462 AbstractCegarLoop]: Abstraction has 5489 states and 12154 transitions. [2019-11-15 20:07:21,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:07:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 5489 states and 12154 transitions. [2019-11-15 20:07:21,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:07:21,420 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:21,420 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:21,420 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:21,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:21,421 INFO L82 PathProgramCache]: Analyzing trace with hash 246172539, now seen corresponding path program 2 times [2019-11-15 20:07:21,421 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:21,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112690503] [2019-11-15 20:07:21,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:21,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:21,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:21,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:21,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112690503] [2019-11-15 20:07:21,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:21,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 20:07:21,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120853391] [2019-11-15 20:07:21,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:07:21,568 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:21,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:07:21,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:07:21,569 INFO L87 Difference]: Start difference. First operand 5489 states and 12154 transitions. Second operand 8 states. [2019-11-15 20:07:22,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:22,346 INFO L93 Difference]: Finished difference Result 7465 states and 16410 transitions. [2019-11-15 20:07:22,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 20:07:22,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-11-15 20:07:22,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:22,354 INFO L225 Difference]: With dead ends: 7465 [2019-11-15 20:07:22,355 INFO L226 Difference]: Without dead ends: 7465 [2019-11-15 20:07:22,356 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-11-15 20:07:22,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7465 states. [2019-11-15 20:07:22,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7465 to 5657. [2019-11-15 20:07:22,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5657 states. [2019-11-15 20:07:22,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5657 states to 5657 states and 12546 transitions. [2019-11-15 20:07:22,443 INFO L78 Accepts]: Start accepts. Automaton has 5657 states and 12546 transitions. Word has length 95 [2019-11-15 20:07:22,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:22,444 INFO L462 AbstractCegarLoop]: Abstraction has 5657 states and 12546 transitions. [2019-11-15 20:07:22,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:07:22,444 INFO L276 IsEmpty]: Start isEmpty. Operand 5657 states and 12546 transitions. [2019-11-15 20:07:22,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:07:22,450 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:22,450 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:22,450 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:22,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:22,451 INFO L82 PathProgramCache]: Analyzing trace with hash -2061312997, now seen corresponding path program 1 times [2019-11-15 20:07:22,451 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:22,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880136458] [2019-11-15 20:07:22,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:22,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:22,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:22,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 20:07:22,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880136458] [2019-11-15 20:07:22,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:22,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 20:07:22,624 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200261553] [2019-11-15 20:07:22,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:07:22,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:22,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:07:22,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:07:22,625 INFO L87 Difference]: Start difference. First operand 5657 states and 12546 transitions. Second operand 10 states. [2019-11-15 20:07:23,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:23,146 INFO L93 Difference]: Finished difference Result 6444 states and 14205 transitions. [2019-11-15 20:07:23,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:07:23,147 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-11-15 20:07:23,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:23,152 INFO L225 Difference]: With dead ends: 6444 [2019-11-15 20:07:23,152 INFO L226 Difference]: Without dead ends: 6444 [2019-11-15 20:07:23,152 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:07:23,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6444 states. [2019-11-15 20:07:23,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6444 to 5737. [2019-11-15 20:07:23,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5737 states. [2019-11-15 20:07:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5737 states to 5737 states and 12720 transitions. [2019-11-15 20:07:23,209 INFO L78 Accepts]: Start accepts. Automaton has 5737 states and 12720 transitions. Word has length 95 [2019-11-15 20:07:23,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:23,209 INFO L462 AbstractCegarLoop]: Abstraction has 5737 states and 12720 transitions. [2019-11-15 20:07:23,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:07:23,209 INFO L276 IsEmpty]: Start isEmpty. Operand 5737 states and 12720 transitions. [2019-11-15 20:07:23,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:07:23,215 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:23,215 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:23,215 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:23,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:23,215 INFO L82 PathProgramCache]: Analyzing trace with hash -53010725, now seen corresponding path program 1 times [2019-11-15 20:07:23,215 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:23,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199182163] [2019-11-15 20:07:23,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:23,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:23,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:23,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:23,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199182163] [2019-11-15 20:07:23,291 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:23,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:07:23,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536236261] [2019-11-15 20:07:23,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:07:23,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:23,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:07:23,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:07:23,293 INFO L87 Difference]: Start difference. First operand 5737 states and 12720 transitions. Second operand 4 states. [2019-11-15 20:07:23,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:23,476 INFO L93 Difference]: Finished difference Result 5818 states and 12909 transitions. [2019-11-15 20:07:23,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:07:23,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 20:07:23,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:23,484 INFO L225 Difference]: With dead ends: 5818 [2019-11-15 20:07:23,484 INFO L226 Difference]: Without dead ends: 5800 [2019-11-15 20:07:23,485 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:07:23,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5800 states. [2019-11-15 20:07:23,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5800 to 5168. [2019-11-15 20:07:23,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5168 states. [2019-11-15 20:07:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5168 states to 5168 states and 11424 transitions. [2019-11-15 20:07:23,554 INFO L78 Accepts]: Start accepts. Automaton has 5168 states and 11424 transitions. Word has length 95 [2019-11-15 20:07:23,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:23,555 INFO L462 AbstractCegarLoop]: Abstraction has 5168 states and 11424 transitions. [2019-11-15 20:07:23,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:07:23,555 INFO L276 IsEmpty]: Start isEmpty. Operand 5168 states and 11424 transitions. [2019-11-15 20:07:23,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:07:23,560 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:23,561 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:23,561 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:23,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:23,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1849962084, now seen corresponding path program 1 times [2019-11-15 20:07:23,562 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:23,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323321603] [2019-11-15 20:07:23,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:23,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:23,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:23,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:23,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323321603] [2019-11-15 20:07:23,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:23,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:07:23,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147806670] [2019-11-15 20:07:23,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:07:23,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:23,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:07:23,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:07:23,691 INFO L87 Difference]: Start difference. First operand 5168 states and 11424 transitions. Second operand 7 states. [2019-11-15 20:07:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:24,007 INFO L93 Difference]: Finished difference Result 5217 states and 11469 transitions. [2019-11-15 20:07:24,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:07:24,007 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-15 20:07:24,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:24,011 INFO L225 Difference]: With dead ends: 5217 [2019-11-15 20:07:24,011 INFO L226 Difference]: Without dead ends: 5217 [2019-11-15 20:07:24,012 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:07:24,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5217 states. [2019-11-15 20:07:24,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5217 to 4750. [2019-11-15 20:07:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4750 states. [2019-11-15 20:07:24,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4750 states to 4750 states and 10501 transitions. [2019-11-15 20:07:24,057 INFO L78 Accepts]: Start accepts. Automaton has 4750 states and 10501 transitions. Word has length 95 [2019-11-15 20:07:24,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:24,057 INFO L462 AbstractCegarLoop]: Abstraction has 4750 states and 10501 transitions. [2019-11-15 20:07:24,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:07:24,057 INFO L276 IsEmpty]: Start isEmpty. Operand 4750 states and 10501 transitions. [2019-11-15 20:07:24,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:07:24,061 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:24,061 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:24,061 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:24,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:24,061 INFO L82 PathProgramCache]: Analyzing trace with hash 546043643, now seen corresponding path program 1 times [2019-11-15 20:07:24,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:24,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443281512] [2019-11-15 20:07:24,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:24,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:24,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:24,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443281512] [2019-11-15 20:07:24,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:24,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:07:24,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181308605] [2019-11-15 20:07:24,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:07:24,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:24,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:07:24,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:07:24,172 INFO L87 Difference]: Start difference. First operand 4750 states and 10501 transitions. Second operand 6 states. [2019-11-15 20:07:24,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:24,342 INFO L93 Difference]: Finished difference Result 5778 states and 12695 transitions. [2019-11-15 20:07:24,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:07:24,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-15 20:07:24,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:24,348 INFO L225 Difference]: With dead ends: 5778 [2019-11-15 20:07:24,348 INFO L226 Difference]: Without dead ends: 5732 [2019-11-15 20:07:24,348 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:07:24,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5732 states. [2019-11-15 20:07:24,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5732 to 5029. [2019-11-15 20:07:24,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5029 states. [2019-11-15 20:07:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5029 states to 5029 states and 11079 transitions. [2019-11-15 20:07:24,402 INFO L78 Accepts]: Start accepts. Automaton has 5029 states and 11079 transitions. Word has length 95 [2019-11-15 20:07:24,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:24,403 INFO L462 AbstractCegarLoop]: Abstraction has 5029 states and 11079 transitions. [2019-11-15 20:07:24,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:07:24,403 INFO L276 IsEmpty]: Start isEmpty. Operand 5029 states and 11079 transitions. [2019-11-15 20:07:24,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:07:24,408 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:24,408 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:24,409 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:24,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:24,409 INFO L82 PathProgramCache]: Analyzing trace with hash 776319836, now seen corresponding path program 1 times [2019-11-15 20:07:24,409 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:24,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540524807] [2019-11-15 20:07:24,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:24,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:24,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:24,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540524807] [2019-11-15 20:07:24,494 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:24,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:07:24,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003145122] [2019-11-15 20:07:24,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:07:24,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:24,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:07:24,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:07:24,496 INFO L87 Difference]: Start difference. First operand 5029 states and 11079 transitions. Second operand 4 states. [2019-11-15 20:07:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:24,537 INFO L93 Difference]: Finished difference Result 4984 states and 10956 transitions. [2019-11-15 20:07:24,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:07:24,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 20:07:24,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:24,542 INFO L225 Difference]: With dead ends: 4984 [2019-11-15 20:07:24,542 INFO L226 Difference]: Without dead ends: 4984 [2019-11-15 20:07:24,542 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:07:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4984 states. [2019-11-15 20:07:24,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4984 to 4702. [2019-11-15 20:07:24,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4702 states. [2019-11-15 20:07:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4702 states to 4702 states and 10340 transitions. [2019-11-15 20:07:24,603 INFO L78 Accepts]: Start accepts. Automaton has 4702 states and 10340 transitions. Word has length 95 [2019-11-15 20:07:24,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:24,603 INFO L462 AbstractCegarLoop]: Abstraction has 4702 states and 10340 transitions. [2019-11-15 20:07:24,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:07:24,603 INFO L276 IsEmpty]: Start isEmpty. Operand 4702 states and 10340 transitions. [2019-11-15 20:07:24,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:07:24,608 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:24,608 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:24,609 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:24,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:24,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1531165700, now seen corresponding path program 1 times [2019-11-15 20:07:24,609 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:24,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857202240] [2019-11-15 20:07:24,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:24,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:24,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:24,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857202240] [2019-11-15 20:07:24,810 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:24,811 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 20:07:24,811 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65825948] [2019-11-15 20:07:24,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:07:24,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:24,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:07:24,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:07:24,812 INFO L87 Difference]: Start difference. First operand 4702 states and 10340 transitions. Second operand 9 states. [2019-11-15 20:07:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:25,584 INFO L93 Difference]: Finished difference Result 5805 states and 12565 transitions. [2019-11-15 20:07:25,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 20:07:25,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-11-15 20:07:25,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:25,592 INFO L225 Difference]: With dead ends: 5805 [2019-11-15 20:07:25,592 INFO L226 Difference]: Without dead ends: 5805 [2019-11-15 20:07:25,592 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-11-15 20:07:25,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5805 states. [2019-11-15 20:07:25,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5805 to 4965. [2019-11-15 20:07:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4965 states. [2019-11-15 20:07:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4965 states to 4965 states and 10854 transitions. [2019-11-15 20:07:25,683 INFO L78 Accepts]: Start accepts. Automaton has 4965 states and 10854 transitions. Word has length 95 [2019-11-15 20:07:25,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:25,683 INFO L462 AbstractCegarLoop]: Abstraction has 4965 states and 10854 transitions. [2019-11-15 20:07:25,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:07:25,684 INFO L276 IsEmpty]: Start isEmpty. Operand 4965 states and 10854 transitions. [2019-11-15 20:07:25,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:07:25,690 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:25,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:25,691 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:25,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:25,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1319814787, now seen corresponding path program 1 times [2019-11-15 20:07:25,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:25,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816946002] [2019-11-15 20:07:25,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:25,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:25,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:25,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:25,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816946002] [2019-11-15 20:07:25,930 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:25,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 20:07:25,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186942651] [2019-11-15 20:07:25,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:07:25,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:25,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:07:25,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:07:25,932 INFO L87 Difference]: Start difference. First operand 4965 states and 10854 transitions. Second operand 9 states. [2019-11-15 20:07:26,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:26,504 INFO L93 Difference]: Finished difference Result 18259 states and 40176 transitions. [2019-11-15 20:07:26,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 20:07:26,505 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-11-15 20:07:26,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:26,516 INFO L225 Difference]: With dead ends: 18259 [2019-11-15 20:07:26,517 INFO L226 Difference]: Without dead ends: 11017 [2019-11-15 20:07:26,518 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-11-15 20:07:26,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11017 states. [2019-11-15 20:07:26,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11017 to 4776. [2019-11-15 20:07:26,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4776 states. [2019-11-15 20:07:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4776 states to 4776 states and 10339 transitions. [2019-11-15 20:07:26,611 INFO L78 Accepts]: Start accepts. Automaton has 4776 states and 10339 transitions. Word has length 95 [2019-11-15 20:07:26,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:26,612 INFO L462 AbstractCegarLoop]: Abstraction has 4776 states and 10339 transitions. [2019-11-15 20:07:26,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:07:26,612 INFO L276 IsEmpty]: Start isEmpty. Operand 4776 states and 10339 transitions. [2019-11-15 20:07:26,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:07:26,617 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:26,618 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:26,618 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:26,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:26,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1965210944, now seen corresponding path program 2 times [2019-11-15 20:07:26,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:26,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855392875] [2019-11-15 20:07:26,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:26,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:26,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:26,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855392875] [2019-11-15 20:07:26,833 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:26,833 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 20:07:26,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043087368] [2019-11-15 20:07:26,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:07:26,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:26,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:07:26,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:07:26,838 INFO L87 Difference]: Start difference. First operand 4776 states and 10339 transitions. Second operand 8 states. [2019-11-15 20:07:27,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:27,220 INFO L93 Difference]: Finished difference Result 5794 states and 12387 transitions. [2019-11-15 20:07:27,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:07:27,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-11-15 20:07:27,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:27,225 INFO L225 Difference]: With dead ends: 5794 [2019-11-15 20:07:27,225 INFO L226 Difference]: Without dead ends: 5794 [2019-11-15 20:07:27,225 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:07:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5794 states. [2019-11-15 20:07:27,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5794 to 4823. [2019-11-15 20:07:27,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4823 states. [2019-11-15 20:07:27,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4823 states to 4823 states and 10451 transitions. [2019-11-15 20:07:27,272 INFO L78 Accepts]: Start accepts. Automaton has 4823 states and 10451 transitions. Word has length 95 [2019-11-15 20:07:27,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:27,272 INFO L462 AbstractCegarLoop]: Abstraction has 4823 states and 10451 transitions. [2019-11-15 20:07:27,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:07:27,273 INFO L276 IsEmpty]: Start isEmpty. Operand 4823 states and 10451 transitions. [2019-11-15 20:07:27,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:07:27,276 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:27,276 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:27,276 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:27,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:27,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1753860031, now seen corresponding path program 2 times [2019-11-15 20:07:27,277 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:27,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896693055] [2019-11-15 20:07:27,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:27,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:27,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:27,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:27,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896693055] [2019-11-15 20:07:27,389 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:27,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:07:27,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847171986] [2019-11-15 20:07:27,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:07:27,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:27,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:07:27,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:07:27,391 INFO L87 Difference]: Start difference. First operand 4823 states and 10451 transitions. Second operand 6 states. [2019-11-15 20:07:27,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:27,494 INFO L93 Difference]: Finished difference Result 7801 states and 16965 transitions. [2019-11-15 20:07:27,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:07:27,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-15 20:07:27,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:27,499 INFO L225 Difference]: With dead ends: 7801 [2019-11-15 20:07:27,499 INFO L226 Difference]: Without dead ends: 3196 [2019-11-15 20:07:27,499 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:07:27,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3196 states. [2019-11-15 20:07:27,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3196 to 3196. [2019-11-15 20:07:27,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3196 states. [2019-11-15 20:07:27,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3196 states to 3196 states and 6928 transitions. [2019-11-15 20:07:27,538 INFO L78 Accepts]: Start accepts. Automaton has 3196 states and 6928 transitions. Word has length 95 [2019-11-15 20:07:27,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:27,538 INFO L462 AbstractCegarLoop]: Abstraction has 3196 states and 6928 transitions. [2019-11-15 20:07:27,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:07:27,539 INFO L276 IsEmpty]: Start isEmpty. Operand 3196 states and 6928 transitions. [2019-11-15 20:07:27,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:07:27,542 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:27,542 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:27,542 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:27,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:27,543 INFO L82 PathProgramCache]: Analyzing trace with hash -2100141997, now seen corresponding path program 3 times [2019-11-15 20:07:27,543 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:27,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553620087] [2019-11-15 20:07:27,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:27,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:27,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:27,735 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553620087] [2019-11-15 20:07:27,735 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:27,735 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 20:07:27,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195749302] [2019-11-15 20:07:27,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:07:27,736 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:27,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:07:27,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:07:27,737 INFO L87 Difference]: Start difference. First operand 3196 states and 6928 transitions. Second operand 10 states. [2019-11-15 20:07:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:28,162 INFO L93 Difference]: Finished difference Result 6076 states and 13307 transitions. [2019-11-15 20:07:28,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 20:07:28,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-11-15 20:07:28,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:28,166 INFO L225 Difference]: With dead ends: 6076 [2019-11-15 20:07:28,166 INFO L226 Difference]: Without dead ends: 4005 [2019-11-15 20:07:28,166 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-11-15 20:07:28,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4005 states. [2019-11-15 20:07:28,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4005 to 3130. [2019-11-15 20:07:28,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2019-11-15 20:07:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 6796 transitions. [2019-11-15 20:07:28,197 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 6796 transitions. Word has length 95 [2019-11-15 20:07:28,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:28,198 INFO L462 AbstractCegarLoop]: Abstraction has 3130 states and 6796 transitions. [2019-11-15 20:07:28,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:07:28,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 6796 transitions. [2019-11-15 20:07:28,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:07:28,202 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:28,202 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:28,202 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:28,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:28,203 INFO L82 PathProgramCache]: Analyzing trace with hash 388956529, now seen corresponding path program 4 times [2019-11-15 20:07:28,203 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:28,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016398236] [2019-11-15 20:07:28,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:28,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:28,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:07:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:07:28,279 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:07:28,279 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:07:28,453 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 20:07:28,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:07:28 BasicIcfg [2019-11-15 20:07:28,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:07:28,455 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:07:28,455 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:07:28,455 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:07:28,456 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:06:44" (3/4) ... [2019-11-15 20:07:28,458 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 20:07:28,577 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d3291483-6280-4426-bedc-d0891cac10c5/bin/uautomizer/witness.graphml [2019-11-15 20:07:28,577 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:07:28,579 INFO L168 Benchmark]: Toolchain (without parser) took 45796.63 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 944.8 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-15 20:07:28,580 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:07:28,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:07:28,580 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:07:28,581 INFO L168 Benchmark]: Boogie Preprocessor took 35.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:07:28,581 INFO L168 Benchmark]: RCFGBuilder took 807.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:07:28,582 INFO L168 Benchmark]: TraceAbstraction took 43996.57 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-11-15 20:07:28,582 INFO L168 Benchmark]: Witness Printer took 122.32 ms. Allocated memory is still 4.6 GB. Free memory was 3.4 GB in the beginning and 3.4 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:07:28,584 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.22 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 759.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 807.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 43996.57 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 122.32 ms. Allocated memory is still 4.6 GB. Free memory was 3.4 GB in the beginning and 3.4 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L703] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L704] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L705] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L706] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L707] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L708] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L709] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L710] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L711] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L712] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L713] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L714] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L715] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L716] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L796] 0 pthread_t t1705; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L797] FCALL, FORK 0 pthread_create(&t1705, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L798] 0 pthread_t t1706; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L799] FCALL, FORK 0 pthread_create(&t1706, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L730] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L731] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L732] 1 x$r_buff0_thd1 = (_Bool)1 [L735] 1 y = 1 VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L763] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L764] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L768] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] EXPR 2 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] 2 x = x$flush_delayed ? x$mem_tmp : x [L771] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L741] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L742] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L774] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L806] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L812] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 218 locations, 3 error locations. Result: UNSAFE, OverallTime: 43.8s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 18.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10236 SDtfs, 11426 SDslu, 27975 SDs, 0 SdLazy, 10156 SolverSat, 519 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 476 GetRequests, 122 SyntacticMatches, 29 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60245occurred 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: 17.2s AutomataMinimizationTime, 39 MinimizatonAttempts, 77507 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 3129 NumberOfCodeBlocks, 3129 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2995 ConstructedInterpolants, 0 QuantifiedInterpolants, 761927 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...