./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi004_power.opt.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_2ebf2c40-115a-47de-b4fc-6501207454de/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2ebf2c40-115a-47de-b4fc-6501207454de/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2ebf2c40-115a-47de-b4fc-6501207454de/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2ebf2c40-115a-47de-b4fc-6501207454de/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi004_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2ebf2c40-115a-47de-b4fc-6501207454de/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2ebf2c40-115a-47de-b4fc-6501207454de/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 d4fe48e4b8c59fe3970fc6e37e17f6ef3138320d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:56:52,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:56:52,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:56:52,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:56:52,784 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:56:52,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:56:52,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:56:52,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:56:52,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:56:52,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:56:52,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:56:52,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:56:52,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:56:52,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:56:52,810 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:56:52,811 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:56:52,812 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:56:52,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:56:52,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:56:52,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:56:52,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:56:52,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:56:52,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:56:52,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:56:52,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:56:52,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:56:52,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:56:52,831 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:56:52,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:56:52,832 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:56:52,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:56:52,833 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:56:52,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:56:52,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:56:52,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:56:52,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:56:52,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:56:52,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:56:52,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:56:52,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:56:52,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:56:52,839 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2ebf2c40-115a-47de-b4fc-6501207454de/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:56:52,864 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:56:52,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:56:52,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:56:52,875 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:56:52,876 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:56:52,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:56:52,876 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:56:52,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:56:52,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:56:52,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:56:52,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:56:52,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:56:52,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:56:52,878 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:56:52,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:56:52,878 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:56:52,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:56:52,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:56:52,880 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:56:52,880 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:56:52,881 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:56:52,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:56:52,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:56:52,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:56:52,882 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:56:52,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:56:52,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:56:52,883 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:56:52,883 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_2ebf2c40-115a-47de-b4fc-6501207454de/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 -> d4fe48e4b8c59fe3970fc6e37e17f6ef3138320d [2019-11-15 23:56:52,916 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:56:52,930 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:56:52,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:56:52,935 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:56:52,936 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:56:52,937 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2ebf2c40-115a-47de-b4fc-6501207454de/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi004_power.opt.i [2019-11-15 23:56:52,993 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2ebf2c40-115a-47de-b4fc-6501207454de/bin/uautomizer/data/acd88f784/1b1c85250375432184b3761c766c38a4/FLAG82cf43e59 [2019-11-15 23:56:53,520 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:56:53,520 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2ebf2c40-115a-47de-b4fc-6501207454de/sv-benchmarks/c/pthread-wmm/rfi004_power.opt.i [2019-11-15 23:56:53,539 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2ebf2c40-115a-47de-b4fc-6501207454de/bin/uautomizer/data/acd88f784/1b1c85250375432184b3761c766c38a4/FLAG82cf43e59 [2019-11-15 23:56:53,867 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2ebf2c40-115a-47de-b4fc-6501207454de/bin/uautomizer/data/acd88f784/1b1c85250375432184b3761c766c38a4 [2019-11-15 23:56:53,872 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:56:53,874 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:56:53,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:56:53,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:56:53,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:56:53,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:56:53" (1/1) ... [2019-11-15 23:56:53,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@433af1c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:53, skipping insertion in model container [2019-11-15 23:56:53,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:56:53" (1/1) ... [2019-11-15 23:56:53,896 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:56:53,942 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:56:54,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:56:54,382 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:56:54,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:56:54,550 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:56:54,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:54 WrapperNode [2019-11-15 23:56:54,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:56:54,551 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:56:54,551 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:56:54,551 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:56:54,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:54" (1/1) ... [2019-11-15 23:56:54,575 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:54" (1/1) ... [2019-11-15 23:56:54,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:56:54,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:56:54,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:56:54,604 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:56:54,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:54" (1/1) ... [2019-11-15 23:56:54,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:54" (1/1) ... [2019-11-15 23:56:54,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:54" (1/1) ... [2019-11-15 23:56:54,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:54" (1/1) ... [2019-11-15 23:56:54,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:54" (1/1) ... [2019-11-15 23:56:54,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:54" (1/1) ... [2019-11-15 23:56:54,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:54" (1/1) ... [2019-11-15 23:56:54,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:56:54,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:56:54,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:56:54,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:56:54,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ebf2c40-115a-47de-b4fc-6501207454de/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:56:54,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:56:54,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 23:56:54,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:56:54,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:56:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 23:56:54,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 23:56:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 23:56:54,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 23:56:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 23:56:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:56:54,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:56:54,729 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 23:56:55,548 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:56:55,548 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:56:55,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:56:55 BoogieIcfgContainer [2019-11-15 23:56:55,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:56:55,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:56:55,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:56:55,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:56:55,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:56:53" (1/3) ... [2019-11-15 23:56:55,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ceb1756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:56:55, skipping insertion in model container [2019-11-15 23:56:55,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:54" (2/3) ... [2019-11-15 23:56:55,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ceb1756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:56:55, skipping insertion in model container [2019-11-15 23:56:55,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:56:55" (3/3) ... [2019-11-15 23:56:55,555 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_power.opt.i [2019-11-15 23:56:55,589 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,589 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,589 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,590 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,590 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,590 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,590 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,590 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,591 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,591 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,591 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,591 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,591 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,592 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,592 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,592 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,592 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,592 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,593 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,593 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,593 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,593 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,593 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,594 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,594 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,594 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,594 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,594 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,594 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,595 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,595 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,595 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,595 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,595 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,595 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,596 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,596 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,596 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,596 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,596 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,597 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,597 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,597 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,597 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,597 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,597 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,598 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,598 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,598 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,598 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,598 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,599 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,599 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,599 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,599 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,599 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,599 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,600 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,600 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,600 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,600 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,600 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,601 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,601 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,601 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,601 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,601 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,601 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,602 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,602 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,602 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,602 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,602 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,602 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,603 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,603 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,603 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,603 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,603 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,604 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,604 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,604 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,604 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,604 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,604 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,605 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,605 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,605 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,605 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,605 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,605 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,606 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,606 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,606 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,607 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,607 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,607 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,607 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,607 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,607 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,607 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,608 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,608 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,608 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,608 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,608 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,609 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,609 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,609 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,609 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,609 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,609 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,610 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,610 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,610 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,610 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,610 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,611 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,611 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,611 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,611 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,611 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,611 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,612 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,612 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,612 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,612 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,612 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:56:55,617 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 23:56:55,618 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:56:55,625 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 23:56:55,635 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 23:56:55,653 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:56:55,653 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:56:55,653 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:56:55,653 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:56:55,653 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:56:55,654 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:56:55,654 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:56:55,654 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:56:55,665 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 130 places, 162 transitions [2019-11-15 23:56:57,467 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25976 states. [2019-11-15 23:56:57,469 INFO L276 IsEmpty]: Start isEmpty. Operand 25976 states. [2019-11-15 23:56:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 23:56:57,478 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:57,479 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] [2019-11-15 23:56:57,481 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:57,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:57,486 INFO L82 PathProgramCache]: Analyzing trace with hash 607370489, now seen corresponding path program 1 times [2019-11-15 23:56:57,494 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:57,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456428679] [2019-11-15 23:56:57,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:57,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:57,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:57,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:57,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456428679] [2019-11-15 23:56:57,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:57,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:57,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412174448] [2019-11-15 23:56:57,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:57,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:57,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:57,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:57,775 INFO L87 Difference]: Start difference. First operand 25976 states. Second operand 4 states. [2019-11-15 23:56:58,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:58,431 INFO L93 Difference]: Finished difference Result 26616 states and 102121 transitions. [2019-11-15 23:56:58,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:58,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-15 23:56:58,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:58,674 INFO L225 Difference]: With dead ends: 26616 [2019-11-15 23:56:58,675 INFO L226 Difference]: Without dead ends: 20360 [2019-11-15 23:56:58,677 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20360 states. [2019-11-15 23:56:59,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20360 to 20360. [2019-11-15 23:56:59,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2019-11-15 23:56:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 78425 transitions. [2019-11-15 23:56:59,893 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 78425 transitions. Word has length 39 [2019-11-15 23:56:59,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:59,895 INFO L462 AbstractCegarLoop]: Abstraction has 20360 states and 78425 transitions. [2019-11-15 23:56:59,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:59,895 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 78425 transitions. [2019-11-15 23:56:59,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 23:56:59,908 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:59,908 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:59,908 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:59,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:59,909 INFO L82 PathProgramCache]: Analyzing trace with hash -885351668, now seen corresponding path program 1 times [2019-11-15 23:56:59,909 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:59,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160529049] [2019-11-15 23:56:59,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:59,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:59,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:00,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:00,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160529049] [2019-11-15 23:57:00,082 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:00,082 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:57:00,082 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154418069] [2019-11-15 23:57:00,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:57:00,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:00,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:57:00,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:57:00,086 INFO L87 Difference]: Start difference. First operand 20360 states and 78425 transitions. Second operand 5 states. [2019-11-15 23:57:01,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:01,142 INFO L93 Difference]: Finished difference Result 31838 states and 116042 transitions. [2019-11-15 23:57:01,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:57:01,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-15 23:57:01,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:01,282 INFO L225 Difference]: With dead ends: 31838 [2019-11-15 23:57:01,282 INFO L226 Difference]: Without dead ends: 31286 [2019-11-15 23:57:01,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:57:01,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31286 states. [2019-11-15 23:57:02,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31286 to 29705. [2019-11-15 23:57:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29705 states. [2019-11-15 23:57:02,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29705 states to 29705 states and 109519 transitions. [2019-11-15 23:57:02,598 INFO L78 Accepts]: Start accepts. Automaton has 29705 states and 109519 transitions. Word has length 47 [2019-11-15 23:57:02,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:02,601 INFO L462 AbstractCegarLoop]: Abstraction has 29705 states and 109519 transitions. [2019-11-15 23:57:02,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:57:02,601 INFO L276 IsEmpty]: Start isEmpty. Operand 29705 states and 109519 transitions. [2019-11-15 23:57:02,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 23:57:02,609 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:02,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] [2019-11-15 23:57:02,609 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:02,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:02,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1873873386, now seen corresponding path program 1 times [2019-11-15 23:57:02,611 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:02,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208801051] [2019-11-15 23:57:02,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:02,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:02,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:02,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:02,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208801051] [2019-11-15 23:57:02,720 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:02,720 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:57:02,721 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106943844] [2019-11-15 23:57:02,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:57:02,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:02,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:57:02,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:57:02,722 INFO L87 Difference]: Start difference. First operand 29705 states and 109519 transitions. Second operand 5 states. [2019-11-15 23:57:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:03,620 INFO L93 Difference]: Finished difference Result 38696 states and 139691 transitions. [2019-11-15 23:57:03,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:57:03,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-15 23:57:03,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:03,768 INFO L225 Difference]: With dead ends: 38696 [2019-11-15 23:57:03,768 INFO L226 Difference]: Without dead ends: 38248 [2019-11-15 23:57:03,769 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:57:03,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38248 states. [2019-11-15 23:57:04,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38248 to 32951. [2019-11-15 23:57:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32951 states. [2019-11-15 23:57:04,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32951 states to 32951 states and 120528 transitions. [2019-11-15 23:57:04,816 INFO L78 Accepts]: Start accepts. Automaton has 32951 states and 120528 transitions. Word has length 48 [2019-11-15 23:57:04,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:04,817 INFO L462 AbstractCegarLoop]: Abstraction has 32951 states and 120528 transitions. [2019-11-15 23:57:04,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:57:04,817 INFO L276 IsEmpty]: Start isEmpty. Operand 32951 states and 120528 transitions. [2019-11-15 23:57:04,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 23:57:04,826 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:04,826 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:04,827 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:04,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:04,827 INFO L82 PathProgramCache]: Analyzing trace with hash -317500932, now seen corresponding path program 1 times [2019-11-15 23:57:04,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:04,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907179185] [2019-11-15 23:57:04,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:04,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:04,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:04,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:04,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907179185] [2019-11-15 23:57:04,883 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:04,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:57:04,883 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656900284] [2019-11-15 23:57:04,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:57:04,883 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:04,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:57:04,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:57:04,884 INFO L87 Difference]: Start difference. First operand 32951 states and 120528 transitions. Second operand 3 states. [2019-11-15 23:57:05,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:05,144 INFO L93 Difference]: Finished difference Result 42412 states and 152019 transitions. [2019-11-15 23:57:05,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:57:05,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-15 23:57:05,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:05,291 INFO L225 Difference]: With dead ends: 42412 [2019-11-15 23:57:05,292 INFO L226 Difference]: Without dead ends: 42412 [2019-11-15 23:57:05,292 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:57:06,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42412 states. [2019-11-15 23:57:06,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42412 to 37665. [2019-11-15 23:57:06,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37665 states. [2019-11-15 23:57:06,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37665 states to 37665 states and 136332 transitions. [2019-11-15 23:57:06,629 INFO L78 Accepts]: Start accepts. Automaton has 37665 states and 136332 transitions. Word has length 50 [2019-11-15 23:57:06,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:06,629 INFO L462 AbstractCegarLoop]: Abstraction has 37665 states and 136332 transitions. [2019-11-15 23:57:06,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:57:06,629 INFO L276 IsEmpty]: Start isEmpty. Operand 37665 states and 136332 transitions. [2019-11-15 23:57:06,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:57:06,644 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:06,644 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:06,645 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:06,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:06,645 INFO L82 PathProgramCache]: Analyzing trace with hash 259150685, now seen corresponding path program 1 times [2019-11-15 23:57:06,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:06,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491864555] [2019-11-15 23:57:06,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:06,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:06,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:06,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491864555] [2019-11-15 23:57:06,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:06,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:57:06,725 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204358934] [2019-11-15 23:57:06,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:57:06,725 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:06,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:57:06,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:57:06,726 INFO L87 Difference]: Start difference. First operand 37665 states and 136332 transitions. Second operand 6 states. [2019-11-15 23:57:07,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:07,417 INFO L93 Difference]: Finished difference Result 48756 states and 172981 transitions. [2019-11-15 23:57:07,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:57:07,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-15 23:57:07,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:07,528 INFO L225 Difference]: With dead ends: 48756 [2019-11-15 23:57:07,529 INFO L226 Difference]: Without dead ends: 48236 [2019-11-15 23:57:07,529 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:57:07,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48236 states. [2019-11-15 23:57:08,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48236 to 38229. [2019-11-15 23:57:08,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38229 states. [2019-11-15 23:57:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38229 states to 38229 states and 138495 transitions. [2019-11-15 23:57:09,031 INFO L78 Accepts]: Start accepts. Automaton has 38229 states and 138495 transitions. Word has length 54 [2019-11-15 23:57:09,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:09,031 INFO L462 AbstractCegarLoop]: Abstraction has 38229 states and 138495 transitions. [2019-11-15 23:57:09,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:57:09,032 INFO L276 IsEmpty]: Start isEmpty. Operand 38229 states and 138495 transitions. [2019-11-15 23:57:09,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:57:09,045 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:09,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] [2019-11-15 23:57:09,046 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:09,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:09,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1550627923, now seen corresponding path program 1 times [2019-11-15 23:57:09,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:09,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342796736] [2019-11-15 23:57:09,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:09,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:09,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:09,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:09,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342796736] [2019-11-15 23:57:09,172 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:09,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:57:09,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922710798] [2019-11-15 23:57:09,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:57:09,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:09,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:57:09,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:57:09,174 INFO L87 Difference]: Start difference. First operand 38229 states and 138495 transitions. Second operand 6 states. [2019-11-15 23:57:09,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:09,962 INFO L93 Difference]: Finished difference Result 53005 states and 189571 transitions. [2019-11-15 23:57:09,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:57:09,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-15 23:57:09,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:10,071 INFO L225 Difference]: With dead ends: 53005 [2019-11-15 23:57:10,071 INFO L226 Difference]: Without dead ends: 52029 [2019-11-15 23:57:10,071 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:57:10,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52029 states. [2019-11-15 23:57:10,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52029 to 48782. [2019-11-15 23:57:10,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48782 states. [2019-11-15 23:57:11,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48782 states to 48782 states and 175226 transitions. [2019-11-15 23:57:11,970 INFO L78 Accepts]: Start accepts. Automaton has 48782 states and 175226 transitions. Word has length 54 [2019-11-15 23:57:11,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:11,970 INFO L462 AbstractCegarLoop]: Abstraction has 48782 states and 175226 transitions. [2019-11-15 23:57:11,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:57:11,970 INFO L276 IsEmpty]: Start isEmpty. Operand 48782 states and 175226 transitions. [2019-11-15 23:57:11,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:57:11,985 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:11,985 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:11,986 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:11,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:11,986 INFO L82 PathProgramCache]: Analyzing trace with hash 947388014, now seen corresponding path program 1 times [2019-11-15 23:57:11,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:11,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610430661] [2019-11-15 23:57:11,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:11,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:11,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:12,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610430661] [2019-11-15 23:57:12,124 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:12,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:57:12,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107914468] [2019-11-15 23:57:12,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:57:12,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:12,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:57:12,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:57:12,126 INFO L87 Difference]: Start difference. First operand 48782 states and 175226 transitions. Second operand 7 states. [2019-11-15 23:57:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:13,177 INFO L93 Difference]: Finished difference Result 70897 states and 244523 transitions. [2019-11-15 23:57:13,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:57:13,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-15 23:57:13,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:13,334 INFO L225 Difference]: With dead ends: 70897 [2019-11-15 23:57:13,334 INFO L226 Difference]: Without dead ends: 70897 [2019-11-15 23:57:13,335 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:57:13,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70897 states. [2019-11-15 23:57:14,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70897 to 57890. [2019-11-15 23:57:14,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57890 states. [2019-11-15 23:57:14,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57890 states to 57890 states and 203150 transitions. [2019-11-15 23:57:14,402 INFO L78 Accepts]: Start accepts. Automaton has 57890 states and 203150 transitions. Word has length 54 [2019-11-15 23:57:14,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:14,403 INFO L462 AbstractCegarLoop]: Abstraction has 57890 states and 203150 transitions. [2019-11-15 23:57:14,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:57:14,403 INFO L276 IsEmpty]: Start isEmpty. Operand 57890 states and 203150 transitions. [2019-11-15 23:57:14,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:57:14,415 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:14,416 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:14,416 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:14,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:14,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1834891695, now seen corresponding path program 1 times [2019-11-15 23:57:14,416 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:14,416 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494556163] [2019-11-15 23:57:14,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:14,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:14,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:14,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494556163] [2019-11-15 23:57:14,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:14,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:57:14,487 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294398823] [2019-11-15 23:57:14,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:57:14,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:14,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:57:14,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:57:14,488 INFO L87 Difference]: Start difference. First operand 57890 states and 203150 transitions. Second operand 4 states. [2019-11-15 23:57:14,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:14,545 INFO L93 Difference]: Finished difference Result 10860 states and 33395 transitions. [2019-11-15 23:57:14,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:57:14,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-15 23:57:14,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:14,557 INFO L225 Difference]: With dead ends: 10860 [2019-11-15 23:57:14,557 INFO L226 Difference]: Without dead ends: 9361 [2019-11-15 23:57:14,558 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:57:14,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9361 states. [2019-11-15 23:57:14,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9361 to 9313. [2019-11-15 23:57:14,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9313 states. [2019-11-15 23:57:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9313 states to 9313 states and 28345 transitions. [2019-11-15 23:57:14,665 INFO L78 Accepts]: Start accepts. Automaton has 9313 states and 28345 transitions. Word has length 54 [2019-11-15 23:57:14,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:14,665 INFO L462 AbstractCegarLoop]: Abstraction has 9313 states and 28345 transitions. [2019-11-15 23:57:14,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:57:14,666 INFO L276 IsEmpty]: Start isEmpty. Operand 9313 states and 28345 transitions. [2019-11-15 23:57:17,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 23:57:17,222 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:17,222 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:17,222 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:17,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:17,222 INFO L82 PathProgramCache]: Analyzing trace with hash -345267242, now seen corresponding path program 1 times [2019-11-15 23:57:17,222 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:17,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712824083] [2019-11-15 23:57:17,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:17,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:17,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:17,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:17,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712824083] [2019-11-15 23:57:17,279 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:17,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:57:17,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683170515] [2019-11-15 23:57:17,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:57:17,280 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:17,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:57:17,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:57:17,281 INFO L87 Difference]: Start difference. First operand 9313 states and 28345 transitions. Second operand 4 states. [2019-11-15 23:57:17,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:17,452 INFO L93 Difference]: Finished difference Result 10888 states and 33037 transitions. [2019-11-15 23:57:17,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:57:17,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-15 23:57:17,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:17,472 INFO L225 Difference]: With dead ends: 10888 [2019-11-15 23:57:17,472 INFO L226 Difference]: Without dead ends: 10888 [2019-11-15 23:57:17,472 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:57:17,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10888 states. [2019-11-15 23:57:17,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10888 to 9880. [2019-11-15 23:57:17,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9880 states. [2019-11-15 23:57:17,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9880 states to 9880 states and 30016 transitions. [2019-11-15 23:57:17,646 INFO L78 Accepts]: Start accepts. Automaton has 9880 states and 30016 transitions. Word has length 64 [2019-11-15 23:57:17,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:17,646 INFO L462 AbstractCegarLoop]: Abstraction has 9880 states and 30016 transitions. [2019-11-15 23:57:17,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:57:17,646 INFO L276 IsEmpty]: Start isEmpty. Operand 9880 states and 30016 transitions. [2019-11-15 23:57:17,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 23:57:17,653 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:17,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] [2019-11-15 23:57:17,656 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:17,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:17,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1397543093, now seen corresponding path program 1 times [2019-11-15 23:57:17,656 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:17,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142348783] [2019-11-15 23:57:17,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:17,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:17,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:17,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:17,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142348783] [2019-11-15 23:57:17,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:17,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:57:17,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071311967] [2019-11-15 23:57:17,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:57:17,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:17,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:57:17,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:57:17,757 INFO L87 Difference]: Start difference. First operand 9880 states and 30016 transitions. Second operand 6 states. [2019-11-15 23:57:18,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:18,249 INFO L93 Difference]: Finished difference Result 12786 states and 38226 transitions. [2019-11-15 23:57:18,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:57:18,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-11-15 23:57:18,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:18,273 INFO L225 Difference]: With dead ends: 12786 [2019-11-15 23:57:18,273 INFO L226 Difference]: Without dead ends: 12738 [2019-11-15 23:57:18,273 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:57:18,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12738 states. [2019-11-15 23:57:18,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12738 to 10619. [2019-11-15 23:57:18,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10619 states. [2019-11-15 23:57:18,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10619 states to 10619 states and 32069 transitions. [2019-11-15 23:57:18,419 INFO L78 Accepts]: Start accepts. Automaton has 10619 states and 32069 transitions. Word has length 64 [2019-11-15 23:57:18,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:18,419 INFO L462 AbstractCegarLoop]: Abstraction has 10619 states and 32069 transitions. [2019-11-15 23:57:18,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:57:18,420 INFO L276 IsEmpty]: Start isEmpty. Operand 10619 states and 32069 transitions. [2019-11-15 23:57:18,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:57:18,426 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:18,426 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:18,426 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:18,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:18,426 INFO L82 PathProgramCache]: Analyzing trace with hash -960211393, now seen corresponding path program 1 times [2019-11-15 23:57:18,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:18,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723757776] [2019-11-15 23:57:18,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:18,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:18,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:18,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723757776] [2019-11-15 23:57:18,478 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:18,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:57:18,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405360641] [2019-11-15 23:57:18,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:57:18,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:18,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:57:18,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:57:18,479 INFO L87 Difference]: Start difference. First operand 10619 states and 32069 transitions. Second operand 4 states. [2019-11-15 23:57:18,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:18,688 INFO L93 Difference]: Finished difference Result 13321 states and 39671 transitions. [2019-11-15 23:57:18,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:57:18,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 23:57:18,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:18,705 INFO L225 Difference]: With dead ends: 13321 [2019-11-15 23:57:18,705 INFO L226 Difference]: Without dead ends: 13321 [2019-11-15 23:57:18,705 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:57:18,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13321 states. [2019-11-15 23:57:18,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13321 to 12175. [2019-11-15 23:57:18,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12175 states. [2019-11-15 23:57:18,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12175 states to 12175 states and 36360 transitions. [2019-11-15 23:57:18,857 INFO L78 Accepts]: Start accepts. Automaton has 12175 states and 36360 transitions. Word has length 66 [2019-11-15 23:57:18,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:18,857 INFO L462 AbstractCegarLoop]: Abstraction has 12175 states and 36360 transitions. [2019-11-15 23:57:18,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:57:18,857 INFO L276 IsEmpty]: Start isEmpty. Operand 12175 states and 36360 transitions. [2019-11-15 23:57:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:57:18,867 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:18,867 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:18,867 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:18,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:18,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1257546560, now seen corresponding path program 1 times [2019-11-15 23:57:18,867 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:18,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815120302] [2019-11-15 23:57:18,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:18,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:18,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:18,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:18,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815120302] [2019-11-15 23:57:18,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:18,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:57:18,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812174075] [2019-11-15 23:57:18,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:57:18,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:18,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:57:18,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:57:18,906 INFO L87 Difference]: Start difference. First operand 12175 states and 36360 transitions. Second operand 3 states. [2019-11-15 23:57:19,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:19,058 INFO L93 Difference]: Finished difference Result 12701 states and 37765 transitions. [2019-11-15 23:57:19,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:57:19,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-15 23:57:19,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:19,075 INFO L225 Difference]: With dead ends: 12701 [2019-11-15 23:57:19,075 INFO L226 Difference]: Without dead ends: 12701 [2019-11-15 23:57:19,076 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:57:19,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12701 states. [2019-11-15 23:57:19,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12701 to 12463. [2019-11-15 23:57:19,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12463 states. [2019-11-15 23:57:19,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12463 states to 12463 states and 37124 transitions. [2019-11-15 23:57:19,251 INFO L78 Accepts]: Start accepts. Automaton has 12463 states and 37124 transitions. Word has length 66 [2019-11-15 23:57:19,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:19,251 INFO L462 AbstractCegarLoop]: Abstraction has 12463 states and 37124 transitions. [2019-11-15 23:57:19,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:57:19,252 INFO L276 IsEmpty]: Start isEmpty. Operand 12463 states and 37124 transitions. [2019-11-15 23:57:19,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:57:19,261 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:19,261 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:19,261 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:19,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:19,262 INFO L82 PathProgramCache]: Analyzing trace with hash -749438172, now seen corresponding path program 1 times [2019-11-15 23:57:19,262 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:19,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115013211] [2019-11-15 23:57:19,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:19,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:19,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:19,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115013211] [2019-11-15 23:57:19,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:19,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:57:19,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46075808] [2019-11-15 23:57:19,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:57:19,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:19,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:57:19,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:57:19,362 INFO L87 Difference]: Start difference. First operand 12463 states and 37124 transitions. Second operand 6 states. [2019-11-15 23:57:19,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:19,905 INFO L93 Difference]: Finished difference Result 13734 states and 40363 transitions. [2019-11-15 23:57:19,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:57:19,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-15 23:57:19,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:19,922 INFO L225 Difference]: With dead ends: 13734 [2019-11-15 23:57:19,923 INFO L226 Difference]: Without dead ends: 13734 [2019-11-15 23:57:19,923 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:57:19,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13734 states. [2019-11-15 23:57:20,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13734 to 13248. [2019-11-15 23:57:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13248 states. [2019-11-15 23:57:20,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13248 states to 13248 states and 39079 transitions. [2019-11-15 23:57:20,087 INFO L78 Accepts]: Start accepts. Automaton has 13248 states and 39079 transitions. Word has length 68 [2019-11-15 23:57:20,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:20,087 INFO L462 AbstractCegarLoop]: Abstraction has 13248 states and 39079 transitions. [2019-11-15 23:57:20,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:57:20,087 INFO L276 IsEmpty]: Start isEmpty. Operand 13248 states and 39079 transitions. [2019-11-15 23:57:20,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:57:20,099 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:20,100 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:20,100 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:20,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:20,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1468319781, now seen corresponding path program 1 times [2019-11-15 23:57:20,100 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:20,101 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500081793] [2019-11-15 23:57:20,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:20,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:20,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:20,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:20,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500081793] [2019-11-15 23:57:20,195 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:20,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:57:20,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865872245] [2019-11-15 23:57:20,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:57:20,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:20,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:57:20,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:57:20,197 INFO L87 Difference]: Start difference. First operand 13248 states and 39079 transitions. Second operand 6 states. [2019-11-15 23:57:20,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:20,673 INFO L93 Difference]: Finished difference Result 15571 states and 44589 transitions. [2019-11-15 23:57:20,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:57:20,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-15 23:57:20,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:20,695 INFO L225 Difference]: With dead ends: 15571 [2019-11-15 23:57:20,695 INFO L226 Difference]: Without dead ends: 15571 [2019-11-15 23:57:20,696 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:57:20,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15571 states. [2019-11-15 23:57:20,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15571 to 13822. [2019-11-15 23:57:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13822 states. [2019-11-15 23:57:20,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 39929 transitions. [2019-11-15 23:57:20,867 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 39929 transitions. Word has length 68 [2019-11-15 23:57:20,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:20,867 INFO L462 AbstractCegarLoop]: Abstraction has 13822 states and 39929 transitions. [2019-11-15 23:57:20,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:57:20,867 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 39929 transitions. [2019-11-15 23:57:20,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:57:20,877 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:20,877 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:20,878 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:20,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:20,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1679670694, now seen corresponding path program 1 times [2019-11-15 23:57:20,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:20,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108377761] [2019-11-15 23:57:20,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:20,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:20,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:20,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:20,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108377761] [2019-11-15 23:57:20,941 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:20,941 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:57:20,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439848107] [2019-11-15 23:57:20,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:57:20,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:20,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:57:20,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:57:20,942 INFO L87 Difference]: Start difference. First operand 13822 states and 39929 transitions. Second operand 5 states. [2019-11-15 23:57:21,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:21,212 INFO L93 Difference]: Finished difference Result 17383 states and 50008 transitions. [2019-11-15 23:57:21,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:57:21,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-15 23:57:21,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:21,233 INFO L225 Difference]: With dead ends: 17383 [2019-11-15 23:57:21,233 INFO L226 Difference]: Without dead ends: 17383 [2019-11-15 23:57:21,233 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:57:21,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17383 states. [2019-11-15 23:57:21,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17383 to 14860. [2019-11-15 23:57:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14860 states. [2019-11-15 23:57:21,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14860 states to 14860 states and 42561 transitions. [2019-11-15 23:57:21,416 INFO L78 Accepts]: Start accepts. Automaton has 14860 states and 42561 transitions. Word has length 68 [2019-11-15 23:57:21,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:21,417 INFO L462 AbstractCegarLoop]: Abstraction has 14860 states and 42561 transitions. [2019-11-15 23:57:21,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:57:21,417 INFO L276 IsEmpty]: Start isEmpty. Operand 14860 states and 42561 transitions. [2019-11-15 23:57:21,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:57:21,425 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:21,425 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:21,425 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:21,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:21,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1169136517, now seen corresponding path program 1 times [2019-11-15 23:57:21,425 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:21,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818659188] [2019-11-15 23:57:21,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:21,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:21,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:21,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:21,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818659188] [2019-11-15 23:57:21,494 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:21,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:57:21,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477980710] [2019-11-15 23:57:21,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:57:21,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:21,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:57:21,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:57:21,495 INFO L87 Difference]: Start difference. First operand 14860 states and 42561 transitions. Second operand 5 states. [2019-11-15 23:57:21,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:21,942 INFO L93 Difference]: Finished difference Result 19765 states and 56508 transitions. [2019-11-15 23:57:21,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:57:21,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-15 23:57:21,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:21,965 INFO L225 Difference]: With dead ends: 19765 [2019-11-15 23:57:21,965 INFO L226 Difference]: Without dead ends: 19765 [2019-11-15 23:57:21,965 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:57:21,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19765 states. [2019-11-15 23:57:22,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19765 to 15765. [2019-11-15 23:57:22,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15765 states. [2019-11-15 23:57:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15765 states to 15765 states and 45147 transitions. [2019-11-15 23:57:22,174 INFO L78 Accepts]: Start accepts. Automaton has 15765 states and 45147 transitions. Word has length 68 [2019-11-15 23:57:22,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:22,174 INFO L462 AbstractCegarLoop]: Abstraction has 15765 states and 45147 transitions. [2019-11-15 23:57:22,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:57:22,174 INFO L276 IsEmpty]: Start isEmpty. Operand 15765 states and 45147 transitions. [2019-11-15 23:57:22,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:57:22,183 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:22,183 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:22,183 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:22,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:22,183 INFO L82 PathProgramCache]: Analyzing trace with hash -638317946, now seen corresponding path program 1 times [2019-11-15 23:57:22,183 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:22,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526579937] [2019-11-15 23:57:22,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:22,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:22,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:22,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526579937] [2019-11-15 23:57:22,273 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:22,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:57:22,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095194915] [2019-11-15 23:57:22,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:57:22,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:22,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:57:22,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:57:22,275 INFO L87 Difference]: Start difference. First operand 15765 states and 45147 transitions. Second operand 6 states. [2019-11-15 23:57:23,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:23,017 INFO L93 Difference]: Finished difference Result 24912 states and 71471 transitions. [2019-11-15 23:57:23,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:57:23,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-15 23:57:23,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:23,050 INFO L225 Difference]: With dead ends: 24912 [2019-11-15 23:57:23,050 INFO L226 Difference]: Without dead ends: 24912 [2019-11-15 23:57:23,050 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:57:23,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24912 states. [2019-11-15 23:57:23,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24912 to 19875. [2019-11-15 23:57:23,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19875 states. [2019-11-15 23:57:23,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19875 states to 19875 states and 57550 transitions. [2019-11-15 23:57:23,347 INFO L78 Accepts]: Start accepts. Automaton has 19875 states and 57550 transitions. Word has length 68 [2019-11-15 23:57:23,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:23,348 INFO L462 AbstractCegarLoop]: Abstraction has 19875 states and 57550 transitions. [2019-11-15 23:57:23,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:57:23,348 INFO L276 IsEmpty]: Start isEmpty. Operand 19875 states and 57550 transitions. [2019-11-15 23:57:23,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:57:23,359 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:23,359 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:23,360 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:23,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:23,360 INFO L82 PathProgramCache]: Analyzing trace with hash 249185735, now seen corresponding path program 1 times [2019-11-15 23:57:23,360 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:23,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978844137] [2019-11-15 23:57:23,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:23,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:23,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:23,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:23,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978844137] [2019-11-15 23:57:23,425 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:23,426 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:57:23,426 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552755100] [2019-11-15 23:57:23,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:57:23,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:23,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:57:23,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:57:23,428 INFO L87 Difference]: Start difference. First operand 19875 states and 57550 transitions. Second operand 4 states. [2019-11-15 23:57:23,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:23,842 INFO L93 Difference]: Finished difference Result 21582 states and 61994 transitions. [2019-11-15 23:57:23,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:57:23,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-15 23:57:23,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:23,868 INFO L225 Difference]: With dead ends: 21582 [2019-11-15 23:57:23,868 INFO L226 Difference]: Without dead ends: 21246 [2019-11-15 23:57:23,869 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:57:23,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21246 states. [2019-11-15 23:57:24,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21246 to 19704. [2019-11-15 23:57:24,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19704 states. [2019-11-15 23:57:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19704 states to 19704 states and 56674 transitions. [2019-11-15 23:57:24,110 INFO L78 Accepts]: Start accepts. Automaton has 19704 states and 56674 transitions. Word has length 68 [2019-11-15 23:57:24,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:24,110 INFO L462 AbstractCegarLoop]: Abstraction has 19704 states and 56674 transitions. [2019-11-15 23:57:24,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:57:24,110 INFO L276 IsEmpty]: Start isEmpty. Operand 19704 states and 56674 transitions. [2019-11-15 23:57:24,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:57:24,121 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:24,121 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:24,121 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:24,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:24,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1859697991, now seen corresponding path program 1 times [2019-11-15 23:57:24,122 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:24,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474039148] [2019-11-15 23:57:24,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:24,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:24,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:24,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:24,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474039148] [2019-11-15 23:57:24,258 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:24,258 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:57:24,258 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389787499] [2019-11-15 23:57:24,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:57:24,260 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:24,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:57:24,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:57:24,260 INFO L87 Difference]: Start difference. First operand 19704 states and 56674 transitions. Second operand 9 states. [2019-11-15 23:57:24,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:24,768 INFO L93 Difference]: Finished difference Result 25031 states and 71607 transitions. [2019-11-15 23:57:24,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:57:24,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-11-15 23:57:24,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:24,803 INFO L225 Difference]: With dead ends: 25031 [2019-11-15 23:57:24,803 INFO L226 Difference]: Without dead ends: 25031 [2019-11-15 23:57:24,803 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:57:24,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25031 states. [2019-11-15 23:57:25,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25031 to 21057. [2019-11-15 23:57:25,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21057 states. [2019-11-15 23:57:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21057 states to 21057 states and 60604 transitions. [2019-11-15 23:57:25,087 INFO L78 Accepts]: Start accepts. Automaton has 21057 states and 60604 transitions. Word has length 68 [2019-11-15 23:57:25,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:25,087 INFO L462 AbstractCegarLoop]: Abstraction has 21057 states and 60604 transitions. [2019-11-15 23:57:25,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:57:25,087 INFO L276 IsEmpty]: Start isEmpty. Operand 21057 states and 60604 transitions. [2019-11-15 23:57:25,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:57:25,100 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:25,100 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:25,101 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:25,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:25,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1547765624, now seen corresponding path program 1 times [2019-11-15 23:57:25,101 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:25,101 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321087636] [2019-11-15 23:57:25,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:25,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:25,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:25,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:25,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321087636] [2019-11-15 23:57:25,163 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:25,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:57:25,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869565917] [2019-11-15 23:57:25,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:57:25,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:25,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:57:25,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:57:25,165 INFO L87 Difference]: Start difference. First operand 21057 states and 60604 transitions. Second operand 5 states. [2019-11-15 23:57:25,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:25,231 INFO L93 Difference]: Finished difference Result 6189 states and 14491 transitions. [2019-11-15 23:57:25,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:57:25,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-15 23:57:25,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:25,237 INFO L225 Difference]: With dead ends: 6189 [2019-11-15 23:57:25,237 INFO L226 Difference]: Without dead ends: 5017 [2019-11-15 23:57:25,237 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:57:25,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5017 states. [2019-11-15 23:57:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5017 to 4280. [2019-11-15 23:57:25,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4280 states. [2019-11-15 23:57:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 9827 transitions. [2019-11-15 23:57:25,276 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 9827 transitions. Word has length 68 [2019-11-15 23:57:25,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:25,276 INFO L462 AbstractCegarLoop]: Abstraction has 4280 states and 9827 transitions. [2019-11-15 23:57:25,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:57:25,277 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 9827 transitions. [2019-11-15 23:57:25,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 23:57:25,280 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:25,280 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-15 23:57:25,280 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:25,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:25,280 INFO L82 PathProgramCache]: Analyzing trace with hash -191495264, now seen corresponding path program 1 times [2019-11-15 23:57:25,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:25,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075340470] [2019-11-15 23:57:25,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:25,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:25,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:25,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:25,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075340470] [2019-11-15 23:57:25,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:25,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:57:25,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247002651] [2019-11-15 23:57:25,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:57:25,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:25,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:57:25,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:57:25,345 INFO L87 Difference]: Start difference. First operand 4280 states and 9827 transitions. Second operand 5 states. [2019-11-15 23:57:25,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:25,554 INFO L93 Difference]: Finished difference Result 4933 states and 11178 transitions. [2019-11-15 23:57:25,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:57:25,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-11-15 23:57:25,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:25,559 INFO L225 Difference]: With dead ends: 4933 [2019-11-15 23:57:25,559 INFO L226 Difference]: Without dead ends: 4902 [2019-11-15 23:57:25,559 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:57:25,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2019-11-15 23:57:25,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 4417. [2019-11-15 23:57:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4417 states. [2019-11-15 23:57:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4417 states to 4417 states and 10096 transitions. [2019-11-15 23:57:25,604 INFO L78 Accepts]: Start accepts. Automaton has 4417 states and 10096 transitions. Word has length 83 [2019-11-15 23:57:25,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:25,605 INFO L462 AbstractCegarLoop]: Abstraction has 4417 states and 10096 transitions. [2019-11-15 23:57:25,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:57:25,605 INFO L276 IsEmpty]: Start isEmpty. Operand 4417 states and 10096 transitions. [2019-11-15 23:57:25,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 23:57:25,608 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:25,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, 1] [2019-11-15 23:57:25,609 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:25,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:25,609 INFO L82 PathProgramCache]: Analyzing trace with hash 978114163, now seen corresponding path program 1 times [2019-11-15 23:57:25,610 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:25,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477381937] [2019-11-15 23:57:25,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:25,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:25,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:25,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477381937] [2019-11-15 23:57:25,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:25,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:57:25,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706280932] [2019-11-15 23:57:25,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:57:25,725 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:25,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:57:25,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:57:25,726 INFO L87 Difference]: Start difference. First operand 4417 states and 10096 transitions. Second operand 6 states. [2019-11-15 23:57:25,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:25,982 INFO L93 Difference]: Finished difference Result 5736 states and 13062 transitions. [2019-11-15 23:57:25,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:57:25,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-11-15 23:57:25,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:25,987 INFO L225 Difference]: With dead ends: 5736 [2019-11-15 23:57:25,987 INFO L226 Difference]: Without dead ends: 5718 [2019-11-15 23:57:25,987 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-15 23:57:25,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5718 states. [2019-11-15 23:57:26,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5718 to 4710. [2019-11-15 23:57:26,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4710 states. [2019-11-15 23:57:26,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4710 states to 4710 states and 10801 transitions. [2019-11-15 23:57:26,037 INFO L78 Accepts]: Start accepts. Automaton has 4710 states and 10801 transitions. Word has length 83 [2019-11-15 23:57:26,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:26,038 INFO L462 AbstractCegarLoop]: Abstraction has 4710 states and 10801 transitions. [2019-11-15 23:57:26,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:57:26,038 INFO L276 IsEmpty]: Start isEmpty. Operand 4710 states and 10801 transitions. [2019-11-15 23:57:26,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 23:57:26,041 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:26,041 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-15 23:57:26,042 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:26,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:26,042 INFO L82 PathProgramCache]: Analyzing trace with hash -818837196, now seen corresponding path program 1 times [2019-11-15 23:57:26,042 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:26,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777764427] [2019-11-15 23:57:26,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:26,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:26,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:26,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777764427] [2019-11-15 23:57:26,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:26,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:57:26,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722594382] [2019-11-15 23:57:26,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:57:26,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:26,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:57:26,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:57:26,116 INFO L87 Difference]: Start difference. First operand 4710 states and 10801 transitions. Second operand 7 states. [2019-11-15 23:57:26,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:26,455 INFO L93 Difference]: Finished difference Result 6901 states and 15917 transitions. [2019-11-15 23:57:26,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:57:26,455 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-11-15 23:57:26,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:26,461 INFO L225 Difference]: With dead ends: 6901 [2019-11-15 23:57:26,461 INFO L226 Difference]: Without dead ends: 6901 [2019-11-15 23:57:26,461 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:57:26,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6901 states. [2019-11-15 23:57:26,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6901 to 5159. [2019-11-15 23:57:26,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5159 states. [2019-11-15 23:57:26,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5159 states to 5159 states and 11889 transitions. [2019-11-15 23:57:26,519 INFO L78 Accepts]: Start accepts. Automaton has 5159 states and 11889 transitions. Word has length 83 [2019-11-15 23:57:26,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:26,519 INFO L462 AbstractCegarLoop]: Abstraction has 5159 states and 11889 transitions. [2019-11-15 23:57:26,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:57:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 5159 states and 11889 transitions. [2019-11-15 23:57:26,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 23:57:26,523 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:26,523 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-15 23:57:26,523 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:26,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:26,524 INFO L82 PathProgramCache]: Analyzing trace with hash 68666485, now seen corresponding path program 1 times [2019-11-15 23:57:26,524 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:26,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546427773] [2019-11-15 23:57:26,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:26,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:26,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:26,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:26,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546427773] [2019-11-15 23:57:26,631 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:26,632 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:57:26,632 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755189978] [2019-11-15 23:57:26,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:57:26,632 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:26,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:57:26,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:57:26,634 INFO L87 Difference]: Start difference. First operand 5159 states and 11889 transitions. Second operand 6 states. [2019-11-15 23:57:26,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:26,681 INFO L93 Difference]: Finished difference Result 5923 states and 13536 transitions. [2019-11-15 23:57:26,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:57:26,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-11-15 23:57:26,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:26,686 INFO L225 Difference]: With dead ends: 5923 [2019-11-15 23:57:26,686 INFO L226 Difference]: Without dead ends: 5923 [2019-11-15 23:57:26,687 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:57:26,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5923 states. [2019-11-15 23:57:26,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5923 to 4712. [2019-11-15 23:57:26,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4712 states. [2019-11-15 23:57:26,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4712 states to 4712 states and 10766 transitions. [2019-11-15 23:57:26,733 INFO L78 Accepts]: Start accepts. Automaton has 4712 states and 10766 transitions. Word has length 83 [2019-11-15 23:57:26,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:26,733 INFO L462 AbstractCegarLoop]: Abstraction has 4712 states and 10766 transitions. [2019-11-15 23:57:26,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:57:26,734 INFO L276 IsEmpty]: Start isEmpty. Operand 4712 states and 10766 transitions. [2019-11-15 23:57:26,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 23:57:26,737 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:26,737 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-15 23:57:26,737 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:26,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:26,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1663309067, now seen corresponding path program 1 times [2019-11-15 23:57:26,738 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:26,738 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013172388] [2019-11-15 23:57:26,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:26,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:26,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:26,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:26,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013172388] [2019-11-15 23:57:26,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:26,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:57:26,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222356977] [2019-11-15 23:57:26,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:57:26,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:26,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:57:26,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:57:26,848 INFO L87 Difference]: Start difference. First operand 4712 states and 10766 transitions. Second operand 6 states. [2019-11-15 23:57:27,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:27,001 INFO L93 Difference]: Finished difference Result 4532 states and 10229 transitions. [2019-11-15 23:57:27,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:57:27,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-11-15 23:57:27,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:27,006 INFO L225 Difference]: With dead ends: 4532 [2019-11-15 23:57:27,006 INFO L226 Difference]: Without dead ends: 4532 [2019-11-15 23:57:27,007 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:57:27,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4532 states. [2019-11-15 23:57:27,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4532 to 3096. [2019-11-15 23:57:27,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3096 states. [2019-11-15 23:57:27,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 7068 transitions. [2019-11-15 23:57:27,056 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 7068 transitions. Word has length 83 [2019-11-15 23:57:27,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:27,056 INFO L462 AbstractCegarLoop]: Abstraction has 3096 states and 7068 transitions. [2019-11-15 23:57:27,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:57:27,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 7068 transitions. [2019-11-15 23:57:27,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 23:57:27,060 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:27,060 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] [2019-11-15 23:57:27,061 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:27,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:27,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1812350299, now seen corresponding path program 1 times [2019-11-15 23:57:27,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:27,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694605779] [2019-11-15 23:57:27,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:27,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:27,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:27,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:27,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694605779] [2019-11-15 23:57:27,250 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:27,250 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:57:27,250 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113786644] [2019-11-15 23:57:27,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:57:27,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:27,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:57:27,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:57:27,252 INFO L87 Difference]: Start difference. First operand 3096 states and 7068 transitions. Second operand 8 states. [2019-11-15 23:57:27,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:27,674 INFO L93 Difference]: Finished difference Result 3596 states and 8134 transitions. [2019-11-15 23:57:27,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:57:27,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-11-15 23:57:27,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:27,678 INFO L225 Difference]: With dead ends: 3596 [2019-11-15 23:57:27,679 INFO L226 Difference]: Without dead ends: 3596 [2019-11-15 23:57:27,679 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:57:27,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3596 states. [2019-11-15 23:57:27,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3596 to 3195. [2019-11-15 23:57:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3195 states. [2019-11-15 23:57:27,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 3195 states and 7272 transitions. [2019-11-15 23:57:27,724 INFO L78 Accepts]: Start accepts. Automaton has 3195 states and 7272 transitions. Word has length 85 [2019-11-15 23:57:27,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:27,725 INFO L462 AbstractCegarLoop]: Abstraction has 3195 states and 7272 transitions. [2019-11-15 23:57:27,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:57:27,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3195 states and 7272 transitions. [2019-11-15 23:57:27,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 23:57:27,729 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:27,729 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] [2019-11-15 23:57:27,730 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:27,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:27,730 INFO L82 PathProgramCache]: Analyzing trace with hash -924846618, now seen corresponding path program 1 times [2019-11-15 23:57:27,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:27,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681334538] [2019-11-15 23:57:27,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:27,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:27,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:27,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681334538] [2019-11-15 23:57:27,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:27,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:57:27,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109296412] [2019-11-15 23:57:27,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:57:27,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:27,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:57:27,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:57:27,902 INFO L87 Difference]: Start difference. First operand 3195 states and 7272 transitions. Second operand 9 states. [2019-11-15 23:57:28,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:28,304 INFO L93 Difference]: Finished difference Result 8549 states and 19618 transitions. [2019-11-15 23:57:28,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 23:57:28,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-11-15 23:57:28,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:28,309 INFO L225 Difference]: With dead ends: 8549 [2019-11-15 23:57:28,309 INFO L226 Difference]: Without dead ends: 5650 [2019-11-15 23:57:28,309 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-11-15 23:57:28,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5650 states. [2019-11-15 23:57:28,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5650 to 3373. [2019-11-15 23:57:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3373 states. [2019-11-15 23:57:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 3373 states and 7636 transitions. [2019-11-15 23:57:28,373 INFO L78 Accepts]: Start accepts. Automaton has 3373 states and 7636 transitions. Word has length 85 [2019-11-15 23:57:28,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:28,373 INFO L462 AbstractCegarLoop]: Abstraction has 3373 states and 7636 transitions. [2019-11-15 23:57:28,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:57:28,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3373 states and 7636 transitions. [2019-11-15 23:57:28,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 23:57:28,376 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:28,376 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] [2019-11-15 23:57:28,377 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:28,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:28,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1219878257, now seen corresponding path program 1 times [2019-11-15 23:57:28,377 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:28,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77035358] [2019-11-15 23:57:28,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:28,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:28,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:28,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:28,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77035358] [2019-11-15 23:57:28,469 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:28,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:57:28,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389912578] [2019-11-15 23:57:28,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:57:28,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:28,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:57:28,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:57:28,470 INFO L87 Difference]: Start difference. First operand 3373 states and 7636 transitions. Second operand 6 states. [2019-11-15 23:57:28,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:28,687 INFO L93 Difference]: Finished difference Result 3722 states and 8360 transitions. [2019-11-15 23:57:28,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:57:28,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-11-15 23:57:28,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:28,691 INFO L225 Difference]: With dead ends: 3722 [2019-11-15 23:57:28,691 INFO L226 Difference]: Without dead ends: 3650 [2019-11-15 23:57:28,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:57:28,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states. [2019-11-15 23:57:28,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 3267. [2019-11-15 23:57:28,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3267 states. [2019-11-15 23:57:28,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3267 states to 3267 states and 7331 transitions. [2019-11-15 23:57:28,720 INFO L78 Accepts]: Start accepts. Automaton has 3267 states and 7331 transitions. Word has length 85 [2019-11-15 23:57:28,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:28,720 INFO L462 AbstractCegarLoop]: Abstraction has 3267 states and 7331 transitions. [2019-11-15 23:57:28,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:57:28,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3267 states and 7331 transitions. [2019-11-15 23:57:28,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 23:57:28,723 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:28,723 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] [2019-11-15 23:57:28,723 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:28,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:28,723 INFO L82 PathProgramCache]: Analyzing trace with hash -857331086, now seen corresponding path program 2 times [2019-11-15 23:57:28,724 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:28,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060813745] [2019-11-15 23:57:28,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:28,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:28,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:28,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:28,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060813745] [2019-11-15 23:57:28,861 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:28,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:57:28,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948476117] [2019-11-15 23:57:28,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:57:28,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:28,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:57:28,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:57:28,862 INFO L87 Difference]: Start difference. First operand 3267 states and 7331 transitions. Second operand 8 states. [2019-11-15 23:57:28,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:28,973 INFO L93 Difference]: Finished difference Result 5512 states and 12425 transitions. [2019-11-15 23:57:28,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:57:28,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-11-15 23:57:28,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:28,976 INFO L225 Difference]: With dead ends: 5512 [2019-11-15 23:57:28,976 INFO L226 Difference]: Without dead ends: 2334 [2019-11-15 23:57:28,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:57:28,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states. [2019-11-15 23:57:29,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 2334. [2019-11-15 23:57:29,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2334 states. [2019-11-15 23:57:29,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2334 states and 5239 transitions. [2019-11-15 23:57:29,005 INFO L78 Accepts]: Start accepts. Automaton has 2334 states and 5239 transitions. Word has length 85 [2019-11-15 23:57:29,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:29,006 INFO L462 AbstractCegarLoop]: Abstraction has 2334 states and 5239 transitions. [2019-11-15 23:57:29,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:57:29,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 5239 transitions. [2019-11-15 23:57:29,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 23:57:29,008 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:29,009 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] [2019-11-15 23:57:29,009 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:29,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:29,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1526104122, now seen corresponding path program 3 times [2019-11-15 23:57:29,009 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:29,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277093057] [2019-11-15 23:57:29,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:29,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:29,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:29,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:29,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277093057] [2019-11-15 23:57:29,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:29,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:57:29,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124975343] [2019-11-15 23:57:29,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:57:29,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:29,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:57:29,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:57:29,092 INFO L87 Difference]: Start difference. First operand 2334 states and 5239 transitions. Second operand 5 states. [2019-11-15 23:57:29,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:29,137 INFO L93 Difference]: Finished difference Result 2459 states and 5494 transitions. [2019-11-15 23:57:29,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:57:29,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-11-15 23:57:29,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:29,140 INFO L225 Difference]: With dead ends: 2459 [2019-11-15 23:57:29,140 INFO L226 Difference]: Without dead ends: 2459 [2019-11-15 23:57:29,141 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:57:29,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2019-11-15 23:57:29,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2418. [2019-11-15 23:57:29,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2418 states. [2019-11-15 23:57:29,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 5409 transitions. [2019-11-15 23:57:29,172 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 5409 transitions. Word has length 85 [2019-11-15 23:57:29,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:29,172 INFO L462 AbstractCegarLoop]: Abstraction has 2418 states and 5409 transitions. [2019-11-15 23:57:29,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:57:29,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 5409 transitions. [2019-11-15 23:57:29,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 23:57:29,175 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:29,175 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] [2019-11-15 23:57:29,176 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:29,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:29,176 INFO L82 PathProgramCache]: Analyzing trace with hash 243307137, now seen corresponding path program 1 times [2019-11-15 23:57:29,176 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:29,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285662113] [2019-11-15 23:57:29,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:29,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:29,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:29,264 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:57:29,264 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:57:29,458 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 23:57:29,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:57:29 BasicIcfg [2019-11-15 23:57:29,459 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:57:29,460 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:57:29,460 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:57:29,460 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:57:29,461 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:56:55" (3/4) ... [2019-11-15 23:57:29,463 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:57:29,569 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2ebf2c40-115a-47de-b4fc-6501207454de/bin/uautomizer/witness.graphml [2019-11-15 23:57:29,570 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:57:29,572 INFO L168 Benchmark]: Toolchain (without parser) took 35697.49 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 944.8 MB in the beginning and 4.1 GB in the end (delta: -3.2 GB). Peak memory consumption was 577.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:29,572 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:57:29,572 INFO L168 Benchmark]: CACSL2BoogieTranslator took 676.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -153.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:29,573 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:29,573 INFO L168 Benchmark]: Boogie Preprocessor took 46.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:57:29,573 INFO L168 Benchmark]: RCFGBuilder took 898.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:29,574 INFO L168 Benchmark]: TraceAbstraction took 33909.56 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 521.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:29,574 INFO L168 Benchmark]: Witness Printer took 109.88 ms. Allocated memory is still 4.8 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:29,576 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 676.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -153.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.71 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 898.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33909.56 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 521.7 MB. Max. memory is 11.5 GB. * Witness Printer took 109.88 ms. Allocated memory is still 4.8 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L707] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L709] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L710] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L711] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L712] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L713] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L714] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L715] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L716] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L717] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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}] [L718] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L719] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L720] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L721] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, 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] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L801] 0 pthread_t t1651; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L802] FCALL, FORK 0 pthread_create(&t1651, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L803] 0 pthread_t t1652; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L804] FCALL, FORK 0 pthread_create(&t1652, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L764] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L765] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L766] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = (_Bool)1 [L770] 2 z = 1 [L773] 2 __unbuffered_p1_EAX = z [L776] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 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) [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L781] 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 [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L782] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L783] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y = y$flush_delayed ? y$mem_tmp : y [L747] 1 y$flush_delayed = (_Bool)0 [L752] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] 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 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 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) [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] 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 [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 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 [L817] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=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=1, 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, 196 locations, 3 error locations. Result: UNSAFE, OverallTime: 33.8s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8204 SDtfs, 9296 SDslu, 19010 SDs, 0 SdLazy, 6629 SolverSat, 467 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 79 SyntacticMatches, 13 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57890occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 71477 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2129 NumberOfCodeBlocks, 2129 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2014 ConstructedInterpolants, 0 QuantifiedInterpolants, 399452 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...