./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_tso.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_7758f856-eaff-4115-9a56-2c128306e31c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7758f856-eaff-4115-9a56-2c128306e31c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7758f856-eaff-4115-9a56-2c128306e31c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7758f856-eaff-4115-9a56-2c128306e31c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7758f856-eaff-4115-9a56-2c128306e31c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7758f856-eaff-4115-9a56-2c128306e31c/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 51e00420332ce124fa129feb09802a38331e4efb .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-16 00:02:00,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:02:00,797 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:02:00,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:02:00,813 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:02:00,814 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:02:00,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:02:00,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:02:00,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:02:00,835 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:02:00,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:02:00,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:02:00,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:02:00,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:02:00,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:02:00,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:02:00,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:02:00,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:02:00,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:02:00,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:02:00,853 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:02:00,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:02:00,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:02:00,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:02:00,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:02:00,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:02:00,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:02:00,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:02:00,865 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:02:00,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:02:00,866 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:02:00,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:02:00,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:02:00,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:02:00,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:02:00,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:02:00,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:02:00,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:02:00,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:02:00,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:02:00,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:02:00,873 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7758f856-eaff-4115-9a56-2c128306e31c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:02:00,898 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:02:00,899 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:02:00,900 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:02:00,900 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:02:00,900 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:02:00,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:02:00,901 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:02:00,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:02:00,901 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:02:00,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:02:00,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:02:00,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:02:00,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:02:00,902 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:02:00,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:02:00,903 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:02:00,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:02:00,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:02:00,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:02:00,904 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:02:00,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:02:00,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:02:00,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:02:00,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:02:00,905 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:02:00,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:02:00,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:02:00,906 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:02:00,906 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_7758f856-eaff-4115-9a56-2c128306e31c/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 -> 51e00420332ce124fa129feb09802a38331e4efb [2019-11-16 00:02:00,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:02:00,943 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:02:00,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:02:00,949 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:02:00,949 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:02:00,950 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7758f856-eaff-4115-9a56-2c128306e31c/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi001_tso.oepc.i [2019-11-16 00:02:01,017 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7758f856-eaff-4115-9a56-2c128306e31c/bin/uautomizer/data/062aa3cc0/f38ee90c750b44568ab2ff1f5e796f55/FLAG9344329b7 [2019-11-16 00:02:01,442 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:02:01,442 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7758f856-eaff-4115-9a56-2c128306e31c/sv-benchmarks/c/pthread-wmm/rfi001_tso.oepc.i [2019-11-16 00:02:01,455 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7758f856-eaff-4115-9a56-2c128306e31c/bin/uautomizer/data/062aa3cc0/f38ee90c750b44568ab2ff1f5e796f55/FLAG9344329b7 [2019-11-16 00:02:01,740 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7758f856-eaff-4115-9a56-2c128306e31c/bin/uautomizer/data/062aa3cc0/f38ee90c750b44568ab2ff1f5e796f55 [2019-11-16 00:02:01,742 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:02:01,743 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:02:01,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:02:01,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:02:01,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:02:01,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:02:01" (1/1) ... [2019-11-16 00:02:01,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ea90f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:01, skipping insertion in model container [2019-11-16 00:02:01,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:02:01" (1/1) ... [2019-11-16 00:02:01,758 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:02:01,799 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:02:02,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:02:02,294 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:02:02,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:02:02,418 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:02:02,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:02 WrapperNode [2019-11-16 00:02:02,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:02:02,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:02:02,419 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:02:02,419 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:02:02,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:02" (1/1) ... [2019-11-16 00:02:02,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:02" (1/1) ... [2019-11-16 00:02:02,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:02:02,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:02:02,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:02:02,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:02:02,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:02" (1/1) ... [2019-11-16 00:02:02,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:02" (1/1) ... [2019-11-16 00:02:02,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:02" (1/1) ... [2019-11-16 00:02:02,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:02" (1/1) ... [2019-11-16 00:02:02,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:02" (1/1) ... [2019-11-16 00:02:02,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:02" (1/1) ... [2019-11-16 00:02:02,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:02" (1/1) ... [2019-11-16 00:02:02,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:02:02,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:02:02,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:02:02,521 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:02:02,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7758f856-eaff-4115-9a56-2c128306e31c/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-16 00:02:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:02:02,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-16 00:02:02,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:02:02,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:02:02,613 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-16 00:02:02,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-16 00:02:02,614 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-16 00:02:02,614 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-16 00:02:02,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-16 00:02:02,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:02:02,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:02:02,619 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-16 00:02:03,292 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:02:03,292 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:02:03,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:02:03 BoogieIcfgContainer [2019-11-16 00:02:03,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:02:03,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:02:03,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:02:03,297 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:02:03,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:02:01" (1/3) ... [2019-11-16 00:02:03,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36850abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:02:03, skipping insertion in model container [2019-11-16 00:02:03,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:02" (2/3) ... [2019-11-16 00:02:03,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36850abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:02:03, skipping insertion in model container [2019-11-16 00:02:03,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:02:03" (3/3) ... [2019-11-16 00:02:03,303 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_tso.oepc.i [2019-11-16 00:02:03,358 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,359 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,359 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,359 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,359 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,359 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,360 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,360 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,360 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,360 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,360 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,360 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,361 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,361 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,361 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,361 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,361 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,361 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,362 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,362 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,362 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,362 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,362 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,363 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,363 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,363 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,363 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,363 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,364 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,364 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,365 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,365 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,365 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,365 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,365 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,365 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,365 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,366 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,367 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,367 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,367 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,368 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,368 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,368 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,368 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,369 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,370 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,370 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,370 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,370 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,370 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,370 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,371 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,371 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,372 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,372 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,372 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,372 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,372 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,373 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,373 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,373 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,373 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,373 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:03,379 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-16 00:02:03,379 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:02:03,388 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-16 00:02:03,398 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-16 00:02:03,420 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:02:03,420 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:02:03,420 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:02:03,420 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:02:03,421 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:02:03,421 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:02:03,422 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:02:03,422 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:02:03,443 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141 places, 179 transitions [2019-11-16 00:02:05,078 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22495 states. [2019-11-16 00:02:05,080 INFO L276 IsEmpty]: Start isEmpty. Operand 22495 states. [2019-11-16 00:02:05,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-16 00:02:05,090 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:05,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] [2019-11-16 00:02:05,094 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:05,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:05,100 INFO L82 PathProgramCache]: Analyzing trace with hash -697756791, now seen corresponding path program 1 times [2019-11-16 00:02:05,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:05,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277909734] [2019-11-16 00:02:05,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:05,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:05,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:05,421 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-16 00:02:05,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277909734] [2019-11-16 00:02:05,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:05,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:02:05,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901659996] [2019-11-16 00:02:05,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:02:05,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:05,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:02:05,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:02:05,447 INFO L87 Difference]: Start difference. First operand 22495 states. Second operand 4 states. [2019-11-16 00:02:06,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:06,034 INFO L93 Difference]: Finished difference Result 23447 states and 91748 transitions. [2019-11-16 00:02:06,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:02:06,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-16 00:02:06,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:06,293 INFO L225 Difference]: With dead ends: 23447 [2019-11-16 00:02:06,294 INFO L226 Difference]: Without dead ends: 21271 [2019-11-16 00:02:06,297 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-16 00:02:06,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21271 states. [2019-11-16 00:02:07,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21271 to 21271. [2019-11-16 00:02:07,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21271 states. [2019-11-16 00:02:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21271 states to 21271 states and 83772 transitions. [2019-11-16 00:02:07,745 INFO L78 Accepts]: Start accepts. Automaton has 21271 states and 83772 transitions. Word has length 38 [2019-11-16 00:02:07,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:07,746 INFO L462 AbstractCegarLoop]: Abstraction has 21271 states and 83772 transitions. [2019-11-16 00:02:07,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:02:07,747 INFO L276 IsEmpty]: Start isEmpty. Operand 21271 states and 83772 transitions. [2019-11-16 00:02:07,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-16 00:02:07,761 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:07,761 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:07,763 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:07,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:07,764 INFO L82 PathProgramCache]: Analyzing trace with hash 298957026, now seen corresponding path program 1 times [2019-11-16 00:02:07,764 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:07,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532211732] [2019-11-16 00:02:07,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:07,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:07,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:07,892 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-16 00:02:07,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532211732] [2019-11-16 00:02:07,892 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:07,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:02:07,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452231579] [2019-11-16 00:02:07,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:02:07,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:07,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:02:07,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:02:07,895 INFO L87 Difference]: Start difference. First operand 21271 states and 83772 transitions. Second operand 5 states. [2019-11-16 00:02:08,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:08,786 INFO L93 Difference]: Finished difference Result 34705 states and 129064 transitions. [2019-11-16 00:02:08,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:02:08,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-16 00:02:08,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:08,963 INFO L225 Difference]: With dead ends: 34705 [2019-11-16 00:02:08,964 INFO L226 Difference]: Without dead ends: 34561 [2019-11-16 00:02:08,965 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-16 00:02:09,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34561 states. [2019-11-16 00:02:10,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34561 to 33061. [2019-11-16 00:02:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33061 states. [2019-11-16 00:02:10,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33061 states to 33061 states and 123952 transitions. [2019-11-16 00:02:10,490 INFO L78 Accepts]: Start accepts. Automaton has 33061 states and 123952 transitions. Word has length 45 [2019-11-16 00:02:10,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:10,492 INFO L462 AbstractCegarLoop]: Abstraction has 33061 states and 123952 transitions. [2019-11-16 00:02:10,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:02:10,493 INFO L276 IsEmpty]: Start isEmpty. Operand 33061 states and 123952 transitions. [2019-11-16 00:02:10,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-16 00:02:10,501 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:10,501 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-16 00:02:10,501 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:10,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:10,502 INFO L82 PathProgramCache]: Analyzing trace with hash 528900453, now seen corresponding path program 1 times [2019-11-16 00:02:10,502 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:10,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405822974] [2019-11-16 00:02:10,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:10,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:10,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:10,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:10,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405822974] [2019-11-16 00:02:10,609 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:10,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:02:10,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830281572] [2019-11-16 00:02:10,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:02:10,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:10,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:02:10,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:02:10,611 INFO L87 Difference]: Start difference. First operand 33061 states and 123952 transitions. Second operand 5 states. [2019-11-16 00:02:11,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:11,715 INFO L93 Difference]: Finished difference Result 40213 states and 148621 transitions. [2019-11-16 00:02:11,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:02:11,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-16 00:02:11,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:11,870 INFO L225 Difference]: With dead ends: 40213 [2019-11-16 00:02:11,871 INFO L226 Difference]: Without dead ends: 40053 [2019-11-16 00:02:11,872 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-16 00:02:12,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40053 states. [2019-11-16 00:02:12,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40053 to 34634. [2019-11-16 00:02:12,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34634 states. [2019-11-16 00:02:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34634 states to 34634 states and 129248 transitions. [2019-11-16 00:02:12,887 INFO L78 Accepts]: Start accepts. Automaton has 34634 states and 129248 transitions. Word has length 46 [2019-11-16 00:02:12,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:12,887 INFO L462 AbstractCegarLoop]: Abstraction has 34634 states and 129248 transitions. [2019-11-16 00:02:12,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:02:12,887 INFO L276 IsEmpty]: Start isEmpty. Operand 34634 states and 129248 transitions. [2019-11-16 00:02:12,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:02:12,899 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:12,899 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-16 00:02:12,900 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:12,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:12,900 INFO L82 PathProgramCache]: Analyzing trace with hash 440704446, now seen corresponding path program 1 times [2019-11-16 00:02:12,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:12,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830290407] [2019-11-16 00:02:12,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:12,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:12,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:13,066 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-16 00:02:13,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830290407] [2019-11-16 00:02:13,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:13,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:02:13,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977274185] [2019-11-16 00:02:13,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:02:13,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:13,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:02:13,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:02:13,069 INFO L87 Difference]: Start difference. First operand 34634 states and 129248 transitions. Second operand 6 states. [2019-11-16 00:02:14,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:14,913 INFO L93 Difference]: Finished difference Result 45662 states and 166142 transitions. [2019-11-16 00:02:14,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:02:14,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-16 00:02:14,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:15,002 INFO L225 Difference]: With dead ends: 45662 [2019-11-16 00:02:15,002 INFO L226 Difference]: Without dead ends: 45518 [2019-11-16 00:02:15,003 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:02:15,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45518 states. [2019-11-16 00:02:15,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45518 to 33597. [2019-11-16 00:02:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33597 states. [2019-11-16 00:02:15,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33597 states to 33597 states and 125403 transitions. [2019-11-16 00:02:15,732 INFO L78 Accepts]: Start accepts. Automaton has 33597 states and 125403 transitions. Word has length 53 [2019-11-16 00:02:15,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:15,733 INFO L462 AbstractCegarLoop]: Abstraction has 33597 states and 125403 transitions. [2019-11-16 00:02:15,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:02:15,733 INFO L276 IsEmpty]: Start isEmpty. Operand 33597 states and 125403 transitions. [2019-11-16 00:02:15,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-16 00:02:15,767 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:15,768 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:15,768 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:15,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:15,769 INFO L82 PathProgramCache]: Analyzing trace with hash -2021901069, now seen corresponding path program 1 times [2019-11-16 00:02:15,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:15,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313215709] [2019-11-16 00:02:15,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:15,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:15,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:15,853 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-16 00:02:15,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313215709] [2019-11-16 00:02:15,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:15,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:02:15,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891850345] [2019-11-16 00:02:15,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:02:15,854 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:15,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:02:15,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:02:15,854 INFO L87 Difference]: Start difference. First operand 33597 states and 125403 transitions. Second operand 6 states. [2019-11-16 00:02:16,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:16,494 INFO L93 Difference]: Finished difference Result 46069 states and 167836 transitions. [2019-11-16 00:02:16,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:02:16,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-16 00:02:16,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:17,475 INFO L225 Difference]: With dead ends: 46069 [2019-11-16 00:02:17,475 INFO L226 Difference]: Without dead ends: 45829 [2019-11-16 00:02:17,476 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:02:17,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45829 states. [2019-11-16 00:02:18,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45829 to 39958. [2019-11-16 00:02:18,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39958 states. [2019-11-16 00:02:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39958 states to 39958 states and 147327 transitions. [2019-11-16 00:02:18,253 INFO L78 Accepts]: Start accepts. Automaton has 39958 states and 147327 transitions. Word has length 60 [2019-11-16 00:02:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:18,254 INFO L462 AbstractCegarLoop]: Abstraction has 39958 states and 147327 transitions. [2019-11-16 00:02:18,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:02:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 39958 states and 147327 transitions. [2019-11-16 00:02:18,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-16 00:02:18,296 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:18,297 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:18,297 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:18,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:18,297 INFO L82 PathProgramCache]: Analyzing trace with hash -481942333, now seen corresponding path program 1 times [2019-11-16 00:02:18,298 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:18,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625039540] [2019-11-16 00:02:18,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:18,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:18,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:18,351 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-16 00:02:18,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625039540] [2019-11-16 00:02:18,351 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:18,351 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:02:18,352 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625084777] [2019-11-16 00:02:18,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:02:18,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:18,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:02:18,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:02:18,353 INFO L87 Difference]: Start difference. First operand 39958 states and 147327 transitions. Second operand 3 states. [2019-11-16 00:02:18,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:18,618 INFO L93 Difference]: Finished difference Result 50256 states and 182162 transitions. [2019-11-16 00:02:18,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:02:18,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-16 00:02:18,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:18,734 INFO L225 Difference]: With dead ends: 50256 [2019-11-16 00:02:18,734 INFO L226 Difference]: Without dead ends: 50256 [2019-11-16 00:02:18,734 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-16 00:02:18,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50256 states. [2019-11-16 00:02:19,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50256 to 43888. [2019-11-16 00:02:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43888 states. [2019-11-16 00:02:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43888 states to 43888 states and 160765 transitions. [2019-11-16 00:02:20,724 INFO L78 Accepts]: Start accepts. Automaton has 43888 states and 160765 transitions. Word has length 62 [2019-11-16 00:02:20,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:20,726 INFO L462 AbstractCegarLoop]: Abstraction has 43888 states and 160765 transitions. [2019-11-16 00:02:20,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:02:20,726 INFO L276 IsEmpty]: Start isEmpty. Operand 43888 states and 160765 transitions. [2019-11-16 00:02:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:02:20,764 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:20,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] [2019-11-16 00:02:20,764 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:20,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:20,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1024024957, now seen corresponding path program 1 times [2019-11-16 00:02:20,765 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:20,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362224554] [2019-11-16 00:02:20,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:20,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:20,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02: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-16 00:02:20,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362224554] [2019-11-16 00:02:20,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:20,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:02:20,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082111395] [2019-11-16 00:02:20,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:02:20,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:20,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:02:20,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:02:20,874 INFO L87 Difference]: Start difference. First operand 43888 states and 160765 transitions. Second operand 7 states. [2019-11-16 00:02:21,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:21,887 INFO L93 Difference]: Finished difference Result 55884 states and 200499 transitions. [2019-11-16 00:02:21,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:02:21,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-11-16 00:02:21,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:22,013 INFO L225 Difference]: With dead ends: 55884 [2019-11-16 00:02:22,013 INFO L226 Difference]: Without dead ends: 55644 [2019-11-16 00:02:22,014 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:02:22,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55644 states. [2019-11-16 00:02:22,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55644 to 45114. [2019-11-16 00:02:22,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45114 states. [2019-11-16 00:02:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45114 states to 45114 states and 164932 transitions. [2019-11-16 00:02:22,947 INFO L78 Accepts]: Start accepts. Automaton has 45114 states and 164932 transitions. Word has length 66 [2019-11-16 00:02:22,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:22,948 INFO L462 AbstractCegarLoop]: Abstraction has 45114 states and 164932 transitions. [2019-11-16 00:02:22,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:02:22,948 INFO L276 IsEmpty]: Start isEmpty. Operand 45114 states and 164932 transitions. [2019-11-16 00:02:22,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:02:22,987 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:22,988 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] [2019-11-16 00:02:22,988 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:22,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:22,988 INFO L82 PathProgramCache]: Analyzing trace with hash -2014746228, now seen corresponding path program 1 times [2019-11-16 00:02:22,989 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:22,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965074763] [2019-11-16 00:02:22,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:22,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:22,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:23,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:23,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965074763] [2019-11-16 00:02:23,116 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:23,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:02:23,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628640050] [2019-11-16 00:02:23,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:02:23,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:23,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:02:23,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:02:23,118 INFO L87 Difference]: Start difference. First operand 45114 states and 164932 transitions. Second operand 7 states. [2019-11-16 00:02:24,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:24,445 INFO L93 Difference]: Finished difference Result 55098 states and 197676 transitions. [2019-11-16 00:02:24,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:02:24,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-11-16 00:02:24,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:24,565 INFO L225 Difference]: With dead ends: 55098 [2019-11-16 00:02:24,565 INFO L226 Difference]: Without dead ends: 54898 [2019-11-16 00:02:24,566 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:02:25,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54898 states. [2019-11-16 00:02:25,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54898 to 45992. [2019-11-16 00:02:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45992 states. [2019-11-16 00:02:26,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45992 states to 45992 states and 167803 transitions. [2019-11-16 00:02:26,014 INFO L78 Accepts]: Start accepts. Automaton has 45992 states and 167803 transitions. Word has length 67 [2019-11-16 00:02:26,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:26,014 INFO L462 AbstractCegarLoop]: Abstraction has 45992 states and 167803 transitions. [2019-11-16 00:02:26,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:02:26,014 INFO L276 IsEmpty]: Start isEmpty. Operand 45992 states and 167803 transitions. [2019-11-16 00:02:26,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:02:26,050 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:26,050 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:26,050 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:26,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:26,050 INFO L82 PathProgramCache]: Analyzing trace with hash 883100043, now seen corresponding path program 1 times [2019-11-16 00:02:26,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:26,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748475697] [2019-11-16 00:02:26,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:26,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:26,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:26,132 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-16 00:02:26,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748475697] [2019-11-16 00:02:26,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:26,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:02:26,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582431035] [2019-11-16 00:02:26,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:02:26,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:26,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:02:26,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:02:26,134 INFO L87 Difference]: Start difference. First operand 45992 states and 167803 transitions. Second operand 3 states. [2019-11-16 00:02:26,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:26,594 INFO L93 Difference]: Finished difference Result 61486 states and 224137 transitions. [2019-11-16 00:02:26,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:02:26,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-16 00:02:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:26,739 INFO L225 Difference]: With dead ends: 61486 [2019-11-16 00:02:26,739 INFO L226 Difference]: Without dead ends: 61486 [2019-11-16 00:02:26,740 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-16 00:02:26,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61486 states. [2019-11-16 00:02:27,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61486 to 53433. [2019-11-16 00:02:27,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53433 states. [2019-11-16 00:02:27,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53433 states to 53433 states and 195616 transitions. [2019-11-16 00:02:27,895 INFO L78 Accepts]: Start accepts. Automaton has 53433 states and 195616 transitions. Word has length 69 [2019-11-16 00:02:27,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:27,895 INFO L462 AbstractCegarLoop]: Abstraction has 53433 states and 195616 transitions. [2019-11-16 00:02:27,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:02:27,896 INFO L276 IsEmpty]: Start isEmpty. Operand 53433 states and 195616 transitions. [2019-11-16 00:02:27,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:02:27,946 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:27,946 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:27,947 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:27,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:27,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1887210997, now seen corresponding path program 1 times [2019-11-16 00:02:27,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:27,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604271946] [2019-11-16 00:02:27,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:27,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:27,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:28,072 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-16 00:02:28,072 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604271946] [2019-11-16 00:02:28,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:28,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:02:28,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496680270] [2019-11-16 00:02:28,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:02:28,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:28,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:02:28,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:02:28,074 INFO L87 Difference]: Start difference. First operand 53433 states and 195616 transitions. Second operand 6 states. [2019-11-16 00:02:28,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:28,847 INFO L93 Difference]: Finished difference Result 65982 states and 238830 transitions. [2019-11-16 00:02:28,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:02:28,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-11-16 00:02:28,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:28,993 INFO L225 Difference]: With dead ends: 65982 [2019-11-16 00:02:28,993 INFO L226 Difference]: Without dead ends: 65338 [2019-11-16 00:02:28,993 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:02:29,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65338 states. [2019-11-16 00:02:30,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65338 to 56042. [2019-11-16 00:02:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56042 states. [2019-11-16 00:02:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56042 states to 56042 states and 204333 transitions. [2019-11-16 00:02:30,498 INFO L78 Accepts]: Start accepts. Automaton has 56042 states and 204333 transitions. Word has length 69 [2019-11-16 00:02:30,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:30,499 INFO L462 AbstractCegarLoop]: Abstraction has 56042 states and 204333 transitions. [2019-11-16 00:02:30,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:02:30,499 INFO L276 IsEmpty]: Start isEmpty. Operand 56042 states and 204333 transitions. [2019-11-16 00:02:30,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:02:30,553 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:30,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, 1, 1, 1] [2019-11-16 00:02:30,553 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:30,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:30,554 INFO L82 PathProgramCache]: Analyzing trace with hash -925596980, now seen corresponding path program 1 times [2019-11-16 00:02:30,554 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:30,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137282372] [2019-11-16 00:02:30,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:30,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:30,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:30,660 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-16 00:02:30,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137282372] [2019-11-16 00:02:30,661 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:30,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:02:30,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358972238] [2019-11-16 00:02:30,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:02:30,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:30,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:02:30,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:02:30,662 INFO L87 Difference]: Start difference. First operand 56042 states and 204333 transitions. Second operand 7 states. [2019-11-16 00:02:31,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:31,692 INFO L93 Difference]: Finished difference Result 83030 states and 292761 transitions. [2019-11-16 00:02:31,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:02:31,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-11-16 00:02:31,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:31,878 INFO L225 Difference]: With dead ends: 83030 [2019-11-16 00:02:31,879 INFO L226 Difference]: Without dead ends: 83030 [2019-11-16 00:02:31,879 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:02:32,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83030 states. [2019-11-16 00:02:33,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83030 to 76079. [2019-11-16 00:02:33,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76079 states. [2019-11-16 00:02:38,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76079 states to 76079 states and 270628 transitions. [2019-11-16 00:02:38,665 INFO L78 Accepts]: Start accepts. Automaton has 76079 states and 270628 transitions. Word has length 69 [2019-11-16 00:02:38,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:38,665 INFO L462 AbstractCegarLoop]: Abstraction has 76079 states and 270628 transitions. [2019-11-16 00:02:38,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:02:38,665 INFO L276 IsEmpty]: Start isEmpty. Operand 76079 states and 270628 transitions. [2019-11-16 00:02:38,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:02:38,726 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:38,727 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:38,727 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:38,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:38,727 INFO L82 PathProgramCache]: Analyzing trace with hash 319167501, now seen corresponding path program 1 times [2019-11-16 00:02:38,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:38,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668142184] [2019-11-16 00:02:38,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:38,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:38,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:38,813 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-16 00:02:38,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668142184] [2019-11-16 00:02:38,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:38,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:02:38,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948032660] [2019-11-16 00:02:38,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:02:38,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:38,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:02:38,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:02:38,815 INFO L87 Difference]: Start difference. First operand 76079 states and 270628 transitions. Second operand 4 states. [2019-11-16 00:02:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:38,923 INFO L93 Difference]: Finished difference Result 17224 states and 54506 transitions. [2019-11-16 00:02:38,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:02:38,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-16 00:02:38,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:38,958 INFO L225 Difference]: With dead ends: 17224 [2019-11-16 00:02:38,959 INFO L226 Difference]: Without dead ends: 16746 [2019-11-16 00:02:38,959 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-16 00:02:38,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16746 states. [2019-11-16 00:02:39,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16746 to 16734. [2019-11-16 00:02:39,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16734 states. [2019-11-16 00:02:39,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16734 states to 16734 states and 53001 transitions. [2019-11-16 00:02:39,200 INFO L78 Accepts]: Start accepts. Automaton has 16734 states and 53001 transitions. Word has length 69 [2019-11-16 00:02:39,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:39,201 INFO L462 AbstractCegarLoop]: Abstraction has 16734 states and 53001 transitions. [2019-11-16 00:02:39,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:02:39,201 INFO L276 IsEmpty]: Start isEmpty. Operand 16734 states and 53001 transitions. [2019-11-16 00:02:39,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-16 00:02:39,214 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:39,214 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] [2019-11-16 00:02:39,214 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:39,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:39,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1328735438, now seen corresponding path program 1 times [2019-11-16 00:02:39,215 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:39,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917611574] [2019-11-16 00:02:39,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:39,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:39,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:39,295 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-16 00:02:39,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917611574] [2019-11-16 00:02:39,296 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:39,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:02:39,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717535408] [2019-11-16 00:02:39,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:02:39,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:39,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:02:39,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:02:39,298 INFO L87 Difference]: Start difference. First operand 16734 states and 53001 transitions. Second operand 4 states. [2019-11-16 00:02:39,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:39,627 INFO L93 Difference]: Finished difference Result 22098 states and 69082 transitions. [2019-11-16 00:02:39,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:02:39,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-16 00:02:39,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:39,674 INFO L225 Difference]: With dead ends: 22098 [2019-11-16 00:02:39,675 INFO L226 Difference]: Without dead ends: 22098 [2019-11-16 00:02:39,675 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:02:39,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22098 states. [2019-11-16 00:02:39,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22098 to 17610. [2019-11-16 00:02:39,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17610 states. [2019-11-16 00:02:40,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17610 states to 17610 states and 55560 transitions. [2019-11-16 00:02:40,027 INFO L78 Accepts]: Start accepts. Automaton has 17610 states and 55560 transitions. Word has length 79 [2019-11-16 00:02:40,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:40,028 INFO L462 AbstractCegarLoop]: Abstraction has 17610 states and 55560 transitions. [2019-11-16 00:02:40,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:02:40,028 INFO L276 IsEmpty]: Start isEmpty. Operand 17610 states and 55560 transitions. [2019-11-16 00:02:40,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-16 00:02:40,045 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:40,045 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:40,045 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:40,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:40,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1583471983, now seen corresponding path program 1 times [2019-11-16 00:02:40,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:40,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792212839] [2019-11-16 00:02:40,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:40,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:40,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:40,196 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-16 00:02:40,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792212839] [2019-11-16 00:02:40,197 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:40,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:02:40,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510042466] [2019-11-16 00:02:40,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:02:40,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:40,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:02:40,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:02:40,199 INFO L87 Difference]: Start difference. First operand 17610 states and 55560 transitions. Second operand 8 states. [2019-11-16 00:02:41,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:41,272 INFO L93 Difference]: Finished difference Result 19704 states and 61636 transitions. [2019-11-16 00:02:41,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-16 00:02:41,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2019-11-16 00:02:41,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:41,304 INFO L225 Difference]: With dead ends: 19704 [2019-11-16 00:02:41,305 INFO L226 Difference]: Without dead ends: 19656 [2019-11-16 00:02:41,305 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-11-16 00:02:41,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19656 states. [2019-11-16 00:02:41,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19656 to 15528. [2019-11-16 00:02:41,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15528 states. [2019-11-16 00:02:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15528 states to 15528 states and 49294 transitions. [2019-11-16 00:02:41,558 INFO L78 Accepts]: Start accepts. Automaton has 15528 states and 49294 transitions. Word has length 79 [2019-11-16 00:02:41,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:41,558 INFO L462 AbstractCegarLoop]: Abstraction has 15528 states and 49294 transitions. [2019-11-16 00:02:41,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:02:41,558 INFO L276 IsEmpty]: Start isEmpty. Operand 15528 states and 49294 transitions. [2019-11-16 00:02:41,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-16 00:02:41,570 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:41,570 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] [2019-11-16 00:02:41,570 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:41,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:41,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1668140051, now seen corresponding path program 1 times [2019-11-16 00:02:41,571 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:41,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374767009] [2019-11-16 00:02:41,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:41,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:41,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:41,611 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-16 00:02:41,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374767009] [2019-11-16 00:02:41,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:41,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:02:41,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15823592] [2019-11-16 00:02:41,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:02:41,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:41,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:02:41,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:02:41,613 INFO L87 Difference]: Start difference. First operand 15528 states and 49294 transitions. Second operand 3 states. [2019-11-16 00:02:41,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:41,888 INFO L93 Difference]: Finished difference Result 16792 states and 53007 transitions. [2019-11-16 00:02:41,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:02:41,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-16 00:02:41,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:41,913 INFO L225 Difference]: With dead ends: 16792 [2019-11-16 00:02:41,914 INFO L226 Difference]: Without dead ends: 16792 [2019-11-16 00:02:41,914 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-16 00:02:41,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16792 states. [2019-11-16 00:02:42,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16792 to 16144. [2019-11-16 00:02:42,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16144 states. [2019-11-16 00:02:42,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16144 states to 16144 states and 51108 transitions. [2019-11-16 00:02:42,137 INFO L78 Accepts]: Start accepts. Automaton has 16144 states and 51108 transitions. Word has length 80 [2019-11-16 00:02:42,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:42,137 INFO L462 AbstractCegarLoop]: Abstraction has 16144 states and 51108 transitions. [2019-11-16 00:02:42,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:02:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 16144 states and 51108 transitions. [2019-11-16 00:02:42,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:02:42,149 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:42,149 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] [2019-11-16 00:02:42,149 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:42,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:42,150 INFO L82 PathProgramCache]: Analyzing trace with hash -274217251, now seen corresponding path program 1 times [2019-11-16 00:02:42,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:42,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122694801] [2019-11-16 00:02:42,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:42,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:42,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:42,211 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-16 00:02:42,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122694801] [2019-11-16 00:02:42,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:42,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:02:42,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583861615] [2019-11-16 00:02:42,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:02:42,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:42,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:02:42,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:02:42,212 INFO L87 Difference]: Start difference. First operand 16144 states and 51108 transitions. Second operand 4 states. [2019-11-16 00:02:42,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:42,566 INFO L93 Difference]: Finished difference Result 19272 states and 60154 transitions. [2019-11-16 00:02:42,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:02:42,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-16 00:02:42,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:42,603 INFO L225 Difference]: With dead ends: 19272 [2019-11-16 00:02:42,603 INFO L226 Difference]: Without dead ends: 19272 [2019-11-16 00:02:42,604 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-16 00:02:42,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19272 states. [2019-11-16 00:02:42,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19272 to 18249. [2019-11-16 00:02:42,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18249 states. [2019-11-16 00:02:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18249 states to 18249 states and 57270 transitions. [2019-11-16 00:02:42,947 INFO L78 Accepts]: Start accepts. Automaton has 18249 states and 57270 transitions. Word has length 81 [2019-11-16 00:02:42,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:42,947 INFO L462 AbstractCegarLoop]: Abstraction has 18249 states and 57270 transitions. [2019-11-16 00:02:42,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:02:42,947 INFO L276 IsEmpty]: Start isEmpty. Operand 18249 states and 57270 transitions. [2019-11-16 00:02:42,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:02:42,969 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:42,969 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] [2019-11-16 00:02:42,969 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:42,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:42,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2085089758, now seen corresponding path program 1 times [2019-11-16 00:02:42,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:42,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270344747] [2019-11-16 00:02:42,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:42,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:42,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:43,012 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-16 00:02:43,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270344747] [2019-11-16 00:02:43,013 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:43,013 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:02:43,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32865022] [2019-11-16 00:02:43,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:02:43,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:43,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:02:43,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:02:43,014 INFO L87 Difference]: Start difference. First operand 18249 states and 57270 transitions. Second operand 3 states. [2019-11-16 00:02:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:43,306 INFO L93 Difference]: Finished difference Result 19580 states and 61169 transitions. [2019-11-16 00:02:43,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:02:43,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-16 00:02:43,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:43,333 INFO L225 Difference]: With dead ends: 19580 [2019-11-16 00:02:43,334 INFO L226 Difference]: Without dead ends: 19580 [2019-11-16 00:02:43,334 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-16 00:02:43,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19580 states. [2019-11-16 00:02:43,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19580 to 18921. [2019-11-16 00:02:43,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18921 states. [2019-11-16 00:02:43,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18921 states to 18921 states and 59234 transitions. [2019-11-16 00:02:43,591 INFO L78 Accepts]: Start accepts. Automaton has 18921 states and 59234 transitions. Word has length 81 [2019-11-16 00:02:43,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:43,591 INFO L462 AbstractCegarLoop]: Abstraction has 18921 states and 59234 transitions. [2019-11-16 00:02:43,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:02:43,591 INFO L276 IsEmpty]: Start isEmpty. Operand 18921 states and 59234 transitions. [2019-11-16 00:02:43,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:02:43,609 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:43,609 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] [2019-11-16 00:02:43,609 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:43,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:43,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1839598223, now seen corresponding path program 1 times [2019-11-16 00:02:43,610 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:43,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933027994] [2019-11-16 00:02:43,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:43,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:43,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:43,681 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-16 00:02:43,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933027994] [2019-11-16 00:02:43,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:43,682 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:02:43,682 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705430117] [2019-11-16 00:02:43,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:02:43,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:43,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:02:43,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:02:43,684 INFO L87 Difference]: Start difference. First operand 18921 states and 59234 transitions. Second operand 4 states. [2019-11-16 00:02:44,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:44,015 INFO L93 Difference]: Finished difference Result 31886 states and 99190 transitions. [2019-11-16 00:02:44,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:02:44,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-16 00:02:44,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:44,066 INFO L225 Difference]: With dead ends: 31886 [2019-11-16 00:02:44,067 INFO L226 Difference]: Without dead ends: 31886 [2019-11-16 00:02:44,067 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-16 00:02:44,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31886 states. [2019-11-16 00:02:44,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31886 to 17558. [2019-11-16 00:02:44,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17558 states. [2019-11-16 00:02:44,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17558 states to 17558 states and 54308 transitions. [2019-11-16 00:02:44,395 INFO L78 Accepts]: Start accepts. Automaton has 17558 states and 54308 transitions. Word has length 82 [2019-11-16 00:02:44,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:44,396 INFO L462 AbstractCegarLoop]: Abstraction has 17558 states and 54308 transitions. [2019-11-16 00:02:44,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:02:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 17558 states and 54308 transitions. [2019-11-16 00:02:44,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:02:44,411 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:44,411 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] [2019-11-16 00:02:44,411 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:44,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:44,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1509832462, now seen corresponding path program 1 times [2019-11-16 00:02:44,411 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:44,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98359411] [2019-11-16 00:02:44,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:44,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:44,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:44,507 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-16 00:02:44,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98359411] [2019-11-16 00:02:44,508 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:44,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:02:44,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242539330] [2019-11-16 00:02:44,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:02:44,510 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:44,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:02:44,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:02:44,511 INFO L87 Difference]: Start difference. First operand 17558 states and 54308 transitions. Second operand 6 states. [2019-11-16 00:02:45,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:45,356 INFO L93 Difference]: Finished difference Result 25982 states and 78626 transitions. [2019-11-16 00:02:45,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:02:45,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-11-16 00:02:45,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:45,401 INFO L225 Difference]: With dead ends: 25982 [2019-11-16 00:02:45,401 INFO L226 Difference]: Without dead ends: 25676 [2019-11-16 00:02:45,401 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:02:45,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25676 states. [2019-11-16 00:02:45,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25676 to 20546. [2019-11-16 00:02:45,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20546 states. [2019-11-16 00:02:45,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20546 states to 20546 states and 63287 transitions. [2019-11-16 00:02:45,742 INFO L78 Accepts]: Start accepts. Automaton has 20546 states and 63287 transitions. Word has length 82 [2019-11-16 00:02:45,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:45,742 INFO L462 AbstractCegarLoop]: Abstraction has 20546 states and 63287 transitions. [2019-11-16 00:02:45,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:02:45,743 INFO L276 IsEmpty]: Start isEmpty. Operand 20546 states and 63287 transitions. [2019-11-16 00:02:45,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:02:45,759 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:45,759 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] [2019-11-16 00:02:45,760 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:45,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:45,760 INFO L82 PathProgramCache]: Analyzing trace with hash -548218445, now seen corresponding path program 1 times [2019-11-16 00:02:45,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:45,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189159207] [2019-11-16 00:02:45,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:45,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:45,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:45,870 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-16 00:02:45,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189159207] [2019-11-16 00:02:45,870 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:45,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:02:45,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356283197] [2019-11-16 00:02:45,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:02:45,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:45,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:02:45,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:02:45,872 INFO L87 Difference]: Start difference. First operand 20546 states and 63287 transitions. Second operand 7 states. [2019-11-16 00:02:46,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:46,907 INFO L93 Difference]: Finished difference Result 38183 states and 115440 transitions. [2019-11-16 00:02:46,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:02:46,908 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-11-16 00:02:46,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:46,973 INFO L225 Difference]: With dead ends: 38183 [2019-11-16 00:02:46,973 INFO L226 Difference]: Without dead ends: 38111 [2019-11-16 00:02:46,974 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:02:47,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38111 states. [2019-11-16 00:02:47,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38111 to 23772. [2019-11-16 00:02:47,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23772 states. [2019-11-16 00:02:47,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23772 states to 23772 states and 73008 transitions. [2019-11-16 00:02:47,570 INFO L78 Accepts]: Start accepts. Automaton has 23772 states and 73008 transitions. Word has length 82 [2019-11-16 00:02:47,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:47,570 INFO L462 AbstractCegarLoop]: Abstraction has 23772 states and 73008 transitions. [2019-11-16 00:02:47,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:02:47,570 INFO L276 IsEmpty]: Start isEmpty. Operand 23772 states and 73008 transitions. [2019-11-16 00:02:47,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:02:47,590 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:47,590 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] [2019-11-16 00:02:47,590 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:47,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:47,591 INFO L82 PathProgramCache]: Analyzing trace with hash 696546036, now seen corresponding path program 1 times [2019-11-16 00:02:47,591 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:47,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683674586] [2019-11-16 00:02:47,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:47,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:47,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:47,673 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-16 00:02:47,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683674586] [2019-11-16 00:02:47,674 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:47,674 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:02:47,674 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864518533] [2019-11-16 00:02:47,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:02:47,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:47,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:02:47,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:02:47,678 INFO L87 Difference]: Start difference. First operand 23772 states and 73008 transitions. Second operand 6 states. [2019-11-16 00:02:48,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:48,240 INFO L93 Difference]: Finished difference Result 36182 states and 111020 transitions. [2019-11-16 00:02:48,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:02:48,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-11-16 00:02:48,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:48,314 INFO L225 Difference]: With dead ends: 36182 [2019-11-16 00:02:48,315 INFO L226 Difference]: Without dead ends: 36182 [2019-11-16 00:02:48,317 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:02:48,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36182 states. [2019-11-16 00:02:48,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36182 to 23483. [2019-11-16 00:02:48,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23483 states. [2019-11-16 00:02:48,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23483 states to 23483 states and 71652 transitions. [2019-11-16 00:02:48,711 INFO L78 Accepts]: Start accepts. Automaton has 23483 states and 71652 transitions. Word has length 82 [2019-11-16 00:02:48,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:48,711 INFO L462 AbstractCegarLoop]: Abstraction has 23483 states and 71652 transitions. [2019-11-16 00:02:48,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:02:48,711 INFO L276 IsEmpty]: Start isEmpty. Operand 23483 states and 71652 transitions. [2019-11-16 00:02:48,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:02:48,730 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:48,731 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] [2019-11-16 00:02:48,731 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:48,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:48,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1177262452, now seen corresponding path program 1 times [2019-11-16 00:02:48,732 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:48,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295835433] [2019-11-16 00:02:48,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:48,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:48,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:48,820 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-16 00:02:48,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295835433] [2019-11-16 00:02:48,820 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:48,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:02:48,821 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110976455] [2019-11-16 00:02:48,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:02:48,821 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:48,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:02:48,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:02:48,822 INFO L87 Difference]: Start difference. First operand 23483 states and 71652 transitions. Second operand 7 states. [2019-11-16 00:02:49,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:49,718 INFO L93 Difference]: Finished difference Result 29663 states and 88861 transitions. [2019-11-16 00:02:49,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:02:49,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-11-16 00:02:49,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:49,776 INFO L225 Difference]: With dead ends: 29663 [2019-11-16 00:02:49,776 INFO L226 Difference]: Without dead ends: 29663 [2019-11-16 00:02:49,777 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:02:49,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29663 states. [2019-11-16 00:02:50,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29663 to 25526. [2019-11-16 00:02:50,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25526 states. [2019-11-16 00:02:50,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25526 states to 25526 states and 77703 transitions. [2019-11-16 00:02:50,303 INFO L78 Accepts]: Start accepts. Automaton has 25526 states and 77703 transitions. Word has length 82 [2019-11-16 00:02:50,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:50,303 INFO L462 AbstractCegarLoop]: Abstraction has 25526 states and 77703 transitions. [2019-11-16 00:02:50,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:02:50,304 INFO L276 IsEmpty]: Start isEmpty. Operand 25526 states and 77703 transitions. [2019-11-16 00:02:50,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:02:50,334 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:50,335 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] [2019-11-16 00:02:50,335 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:50,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:50,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1872940363, now seen corresponding path program 1 times [2019-11-16 00:02:50,336 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:50,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698678605] [2019-11-16 00:02:50,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:50,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:50,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:50,384 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-16 00:02:50,384 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698678605] [2019-11-16 00:02:50,384 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:50,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:02:50,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74690566] [2019-11-16 00:02:50,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:02:50,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:50,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:02:50,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:02:50,388 INFO L87 Difference]: Start difference. First operand 25526 states and 77703 transitions. Second operand 3 states. [2019-11-16 00:02:50,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:50,522 INFO L93 Difference]: Finished difference Result 20945 states and 63351 transitions. [2019-11-16 00:02:50,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:02:50,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-16 00:02:50,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:50,551 INFO L225 Difference]: With dead ends: 20945 [2019-11-16 00:02:50,552 INFO L226 Difference]: Without dead ends: 20867 [2019-11-16 00:02:50,552 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-16 00:02:50,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20867 states. [2019-11-16 00:02:50,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20867 to 19115. [2019-11-16 00:02:50,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19115 states. [2019-11-16 00:02:50,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19115 states to 19115 states and 58071 transitions. [2019-11-16 00:02:50,830 INFO L78 Accepts]: Start accepts. Automaton has 19115 states and 58071 transitions. Word has length 82 [2019-11-16 00:02:50,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:50,830 INFO L462 AbstractCegarLoop]: Abstraction has 19115 states and 58071 transitions. [2019-11-16 00:02:50,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:02:50,830 INFO L276 IsEmpty]: Start isEmpty. Operand 19115 states and 58071 transitions. [2019-11-16 00:02:50,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-16 00:02:50,847 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:50,848 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] [2019-11-16 00:02:50,848 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:50,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:50,848 INFO L82 PathProgramCache]: Analyzing trace with hash -412492618, now seen corresponding path program 1 times [2019-11-16 00:02:50,849 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:50,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388685940] [2019-11-16 00:02:50,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:50,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:50,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:50,961 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-16 00:02:50,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388685940] [2019-11-16 00:02:50,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:50,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:02:50,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217373434] [2019-11-16 00:02:50,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:02:50,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:50,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:02:50,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:02:50,963 INFO L87 Difference]: Start difference. First operand 19115 states and 58071 transitions. Second operand 6 states. [2019-11-16 00:02:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:51,560 INFO L93 Difference]: Finished difference Result 31808 states and 95636 transitions. [2019-11-16 00:02:51,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:02:51,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-11-16 00:02:51,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:51,611 INFO L225 Difference]: With dead ends: 31808 [2019-11-16 00:02:51,611 INFO L226 Difference]: Without dead ends: 31664 [2019-11-16 00:02:51,612 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:02:51,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31664 states. [2019-11-16 00:02:51,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31664 to 25454. [2019-11-16 00:02:51,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25454 states. [2019-11-16 00:02:52,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25454 states to 25454 states and 77768 transitions. [2019-11-16 00:02:52,014 INFO L78 Accepts]: Start accepts. Automaton has 25454 states and 77768 transitions. Word has length 83 [2019-11-16 00:02:52,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:52,014 INFO L462 AbstractCegarLoop]: Abstraction has 25454 states and 77768 transitions. [2019-11-16 00:02:52,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:02:52,014 INFO L276 IsEmpty]: Start isEmpty. Operand 25454 states and 77768 transitions. [2019-11-16 00:02:52,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-16 00:02:52,038 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:52,038 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] [2019-11-16 00:02:52,038 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:52,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:52,038 INFO L82 PathProgramCache]: Analyzing trace with hash 832271863, now seen corresponding path program 1 times [2019-11-16 00:02:52,039 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:52,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699682694] [2019-11-16 00:02:52,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:52,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:52,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:52,107 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-16 00:02:52,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699682694] [2019-11-16 00:02:52,108 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:52,108 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:02:52,108 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128007724] [2019-11-16 00:02:52,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:02:52,109 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:52,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:02:52,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:02:52,110 INFO L87 Difference]: Start difference. First operand 25454 states and 77768 transitions. Second operand 5 states. [2019-11-16 00:02:52,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:52,160 INFO L93 Difference]: Finished difference Result 3089 states and 7622 transitions. [2019-11-16 00:02:52,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:02:52,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-11-16 00:02:52,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:52,164 INFO L225 Difference]: With dead ends: 3089 [2019-11-16 00:02:52,165 INFO L226 Difference]: Without dead ends: 2750 [2019-11-16 00:02:52,165 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-16 00:02:52,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2019-11-16 00:02:52,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2652. [2019-11-16 00:02:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2652 states. [2019-11-16 00:02:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 6501 transitions. [2019-11-16 00:02:52,199 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 6501 transitions. Word has length 83 [2019-11-16 00:02:52,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:52,199 INFO L462 AbstractCegarLoop]: Abstraction has 2652 states and 6501 transitions. [2019-11-16 00:02:52,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:02:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 6501 transitions. [2019-11-16 00:02:52,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:02:52,203 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:52,203 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:52,203 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:52,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:52,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1287554093, now seen corresponding path program 1 times [2019-11-16 00:02:52,204 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:52,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013259334] [2019-11-16 00:02:52,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:52,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:52,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:52,396 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-16 00:02:52,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013259334] [2019-11-16 00:02:52,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:52,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:02:52,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443903484] [2019-11-16 00:02:52,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:02:52,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:52,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:02:52,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:02:52,399 INFO L87 Difference]: Start difference. First operand 2652 states and 6501 transitions. Second operand 7 states. [2019-11-16 00:02:52,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:52,615 INFO L93 Difference]: Finished difference Result 2825 states and 6810 transitions. [2019-11-16 00:02:52,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:02:52,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-11-16 00:02:52,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:52,618 INFO L225 Difference]: With dead ends: 2825 [2019-11-16 00:02:52,619 INFO L226 Difference]: Without dead ends: 2825 [2019-11-16 00:02:52,619 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:02:52,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2825 states. [2019-11-16 00:02:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2825 to 2663. [2019-11-16 00:02:52,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2663 states. [2019-11-16 00:02:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 6477 transitions. [2019-11-16 00:02:52,650 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 6477 transitions. Word has length 96 [2019-11-16 00:02:52,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:52,650 INFO L462 AbstractCegarLoop]: Abstraction has 2663 states and 6477 transitions. [2019-11-16 00:02:52,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:02:52,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 6477 transitions. [2019-11-16 00:02:52,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:02:52,652 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:52,653 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:52,653 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:52,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:52,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1544456849, now seen corresponding path program 1 times [2019-11-16 00:02:52,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:52,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333368273] [2019-11-16 00:02:52,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:52,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:52,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:52,818 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-16 00:02:52,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333368273] [2019-11-16 00:02:52,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:52,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:02:52,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815653803] [2019-11-16 00:02:52,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:02:52,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:52,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:02:52,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:02:52,820 INFO L87 Difference]: Start difference. First operand 2663 states and 6477 transitions. Second operand 6 states. [2019-11-16 00:02:52,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:52,950 INFO L93 Difference]: Finished difference Result 2836 states and 6745 transitions. [2019-11-16 00:02:52,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:02:52,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-11-16 00:02:52,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:52,953 INFO L225 Difference]: With dead ends: 2836 [2019-11-16 00:02:52,954 INFO L226 Difference]: Without dead ends: 2785 [2019-11-16 00:02:52,954 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:02:52,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2785 states. [2019-11-16 00:02:52,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2785 to 2660. [2019-11-16 00:02:52,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2019-11-16 00:02:52,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 6392 transitions. [2019-11-16 00:02:52,990 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 6392 transitions. Word has length 96 [2019-11-16 00:02:52,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:52,990 INFO L462 AbstractCegarLoop]: Abstraction has 2660 states and 6392 transitions. [2019-11-16 00:02:52,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:02:52,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 6392 transitions. [2019-11-16 00:02:52,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:02:52,994 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:52,994 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:52,995 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:52,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:52,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1049769968, now seen corresponding path program 1 times [2019-11-16 00:02:52,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:52,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683182432] [2019-11-16 00:02:52,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:52,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:52,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:53,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:02:53,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683182432] [2019-11-16 00:02:53,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:53,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:02:53,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339776819] [2019-11-16 00:02:53,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:02:53,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:53,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:02:53,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:02:53,117 INFO L87 Difference]: Start difference. First operand 2660 states and 6392 transitions. Second operand 6 states. [2019-11-16 00:02:53,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:53,301 INFO L93 Difference]: Finished difference Result 2817 states and 6669 transitions. [2019-11-16 00:02:53,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:02:53,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-11-16 00:02:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:53,305 INFO L225 Difference]: With dead ends: 2817 [2019-11-16 00:02:53,306 INFO L226 Difference]: Without dead ends: 2817 [2019-11-16 00:02:53,306 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-16 00:02:53,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2019-11-16 00:02:53,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2646. [2019-11-16 00:02:53,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2646 states. [2019-11-16 00:02:53,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2646 states and 6336 transitions. [2019-11-16 00:02:53,350 INFO L78 Accepts]: Start accepts. Automaton has 2646 states and 6336 transitions. Word has length 96 [2019-11-16 00:02:53,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:53,350 INFO L462 AbstractCegarLoop]: Abstraction has 2646 states and 6336 transitions. [2019-11-16 00:02:53,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:02:53,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2646 states and 6336 transitions. [2019-11-16 00:02:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:02:53,354 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:53,354 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:53,355 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:53,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:53,355 INFO L82 PathProgramCache]: Analyzing trace with hash -885890319, now seen corresponding path program 1 times [2019-11-16 00:02:53,356 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:53,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333994137] [2019-11-16 00:02:53,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:53,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:53,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:53,424 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-16 00:02:53,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333994137] [2019-11-16 00:02:53,425 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:53,425 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:02:53,425 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564106614] [2019-11-16 00:02:53,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:02:53,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:53,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:02:53,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:02:53,426 INFO L87 Difference]: Start difference. First operand 2646 states and 6336 transitions. Second operand 4 states. [2019-11-16 00:02:53,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:53,508 INFO L93 Difference]: Finished difference Result 2610 states and 6216 transitions. [2019-11-16 00:02:53,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:02:53,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-16 00:02:53,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:53,510 INFO L225 Difference]: With dead ends: 2610 [2019-11-16 00:02:53,510 INFO L226 Difference]: Without dead ends: 2610 [2019-11-16 00:02:53,511 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-16 00:02:53,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2019-11-16 00:02:53,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610. [2019-11-16 00:02:53,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2019-11-16 00:02:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 6216 transitions. [2019-11-16 00:02:53,533 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 6216 transitions. Word has length 96 [2019-11-16 00:02:53,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:53,534 INFO L462 AbstractCegarLoop]: Abstraction has 2610 states and 6216 transitions. [2019-11-16 00:02:53,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:02:53,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 6216 transitions. [2019-11-16 00:02:53,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:02:53,536 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:53,536 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:53,536 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:53,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:53,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1115822672, now seen corresponding path program 1 times [2019-11-16 00:02:53,537 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:53,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484801197] [2019-11-16 00:02:53,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:53,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:53,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:53,626 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-16 00:02:53,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484801197] [2019-11-16 00:02:53,627 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:53,627 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:02:53,627 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515943292] [2019-11-16 00:02:53,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:02:53,628 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:53,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:02:53,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:02:53,628 INFO L87 Difference]: Start difference. First operand 2610 states and 6216 transitions. Second operand 5 states. [2019-11-16 00:02:53,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:53,839 INFO L93 Difference]: Finished difference Result 2916 states and 6921 transitions. [2019-11-16 00:02:53,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:02:53,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-11-16 00:02:53,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:53,842 INFO L225 Difference]: With dead ends: 2916 [2019-11-16 00:02:53,843 INFO L226 Difference]: Without dead ends: 2898 [2019-11-16 00:02:53,843 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:02:53,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2019-11-16 00:02:53,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2637. [2019-11-16 00:02:53,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2637 states. [2019-11-16 00:02:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 6270 transitions. [2019-11-16 00:02:53,872 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 6270 transitions. Word has length 96 [2019-11-16 00:02:53,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:53,873 INFO L462 AbstractCegarLoop]: Abstraction has 2637 states and 6270 transitions. [2019-11-16 00:02:53,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:02:53,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 6270 transitions. [2019-11-16 00:02:53,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:02:53,875 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:53,875 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:53,875 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:53,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:53,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1934380143, now seen corresponding path program 1 times [2019-11-16 00:02:53,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:53,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210364239] [2019-11-16 00:02:53,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:53,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:53,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:54,009 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-16 00:02:54,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210364239] [2019-11-16 00:02:54,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:54,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:02:54,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439888221] [2019-11-16 00:02:54,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:02:54,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:54,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:02:54,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:02:54,012 INFO L87 Difference]: Start difference. First operand 2637 states and 6270 transitions. Second operand 7 states. [2019-11-16 00:02:54,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:54,139 INFO L93 Difference]: Finished difference Result 3928 states and 9406 transitions. [2019-11-16 00:02:54,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:02:54,140 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-11-16 00:02:54,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:54,142 INFO L225 Difference]: With dead ends: 3928 [2019-11-16 00:02:54,142 INFO L226 Difference]: Without dead ends: 1372 [2019-11-16 00:02:54,142 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:02:54,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2019-11-16 00:02:54,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1372. [2019-11-16 00:02:54,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-11-16 00:02:54,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 3268 transitions. [2019-11-16 00:02:54,164 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 3268 transitions. Word has length 96 [2019-11-16 00:02:54,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:54,165 INFO L462 AbstractCegarLoop]: Abstraction has 1372 states and 3268 transitions. [2019-11-16 00:02:54,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:02:54,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 3268 transitions. [2019-11-16 00:02:54,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:02:54,167 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:54,167 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:54,168 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:54,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:54,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2062962383, now seen corresponding path program 2 times [2019-11-16 00:02:54,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:54,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033355086] [2019-11-16 00:02:54,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:54,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:54,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:02:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:02:54,299 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:02:54,299 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:02:54,512 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-16 00:02:54,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:02:54 BasicIcfg [2019-11-16 00:02:54,516 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:02:54,517 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:02:54,517 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:02:54,518 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:02:54,518 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:02:03" (3/4) ... [2019-11-16 00:02:54,525 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:02:54,709 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7758f856-eaff-4115-9a56-2c128306e31c/bin/uautomizer/witness.graphml [2019-11-16 00:02:54,709 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:02:54,712 INFO L168 Benchmark]: Toolchain (without parser) took 52967.52 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.4 GB). Free memory was 939.3 MB in the beginning and 1.9 GB in the end (delta: -997.6 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2019-11-16 00:02:54,712 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:02:54,712 INFO L168 Benchmark]: CACSL2BoogieTranslator took 674.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:02:54,713 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.21 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:02:54,713 INFO L168 Benchmark]: Boogie Preprocessor took 42.90 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-16 00:02:54,713 INFO L168 Benchmark]: RCFGBuilder took 772.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:02:54,714 INFO L168 Benchmark]: TraceAbstraction took 51222.40 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -960.2 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-11-16 00:02:54,714 INFO L168 Benchmark]: Witness Printer took 192.49 ms. Allocated memory is still 5.4 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 79.9 MB). Peak memory consumption was 79.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:02:54,717 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 674.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.21 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 772.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 51222.40 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -960.2 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 192.49 ms. Allocated memory is still 5.4 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 79.9 MB). Peak memory consumption was 79.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_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] [L704] 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, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L707] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L708] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L709] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L710] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L711] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L712] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L713] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L714] 0 int *y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L715] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L716] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L717] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L718] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L721] 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L722] 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 0 pthread_t t1613; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK 0 pthread_create(&t1613, ((void *)0), P0, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 0 pthread_t t1614; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1614, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L746] 2 y$w_buff1 = y$w_buff0 [L747] 2 y$w_buff0 = 2 [L748] 2 y$w_buff1_used = y$w_buff0_used [L749] 2 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 2 !(!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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L751] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L752] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L753] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = (_Bool)1 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 1 x = 1 [L729] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=1, z=1] [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=1, z=1] [L732] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L739] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L798] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 y$flush_delayed = weak$$choice2 [L807] 0 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L809] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L810] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L811] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L812] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L814] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] 0 y = y$flush_delayed ? y$mem_tmp : y [L817] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 177 locations, 3 error locations. Result: UNSAFE, OverallTime: 51.0s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 20.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9030 SDtfs, 9391 SDslu, 19041 SDs, 0 SdLazy, 8514 SolverSat, 595 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 84 SyntacticMatches, 16 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76079occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 24.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 145185 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2443 NumberOfCodeBlocks, 2443 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2316 ConstructedInterpolants, 0 QuantifiedInterpolants, 407802 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...