./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix022_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bcf64206-c098-4dcc-a4ea-c017c49c457e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bcf64206-c098-4dcc-a4ea-c017c49c457e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bcf64206-c098-4dcc-a4ea-c017c49c457e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bcf64206-c098-4dcc-a4ea-c017c49c457e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix022_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bcf64206-c098-4dcc-a4ea-c017c49c457e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bcf64206-c098-4dcc-a4ea-c017c49c457e/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 61950e5134783ff41854193442a0b82c08021557 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:58:40,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:58:40,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:58:40,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:58:40,867 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:58:40,868 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:58:40,870 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:58:40,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:58:40,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:58:40,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:58:40,890 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:58:40,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:58:40,892 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:58:40,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:58:40,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:58:40,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:58:40,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:58:40,897 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:58:40,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:58:40,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:58:40,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:58:40,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:58:40,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:58:40,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:58:40,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:58:40,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:58:40,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:58:40,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:58:40,918 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:58:40,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:58:40,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:58:40,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:58:40,920 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:58:40,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:58:40,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:58:40,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:58:40,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:58:40,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:58:40,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:58:40,924 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:58:40,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:58:40,926 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bcf64206-c098-4dcc-a4ea-c017c49c457e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:58:40,952 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:58:40,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:58:40,963 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:58:40,964 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:58:40,964 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:58:40,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:58:40,964 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:58:40,965 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:58:40,965 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:58:40,965 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:58:40,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:58:40,966 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:58:40,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:58:40,966 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:58:40,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:58:40,967 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:58:40,967 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:58:40,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:58:40,968 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:58:40,968 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:58:40,968 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:58:40,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:58:40,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:58:40,969 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:58:40,970 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:58:40,970 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:58:40,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:58:40,970 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:58:40,971 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_bcf64206-c098-4dcc-a4ea-c017c49c457e/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 -> 61950e5134783ff41854193442a0b82c08021557 [2019-11-15 21:58:41,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:58:41,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:58:41,030 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:58:41,031 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:58:41,031 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:58:41,033 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bcf64206-c098-4dcc-a4ea-c017c49c457e/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix022_pso.oepc.i [2019-11-15 21:58:41,095 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bcf64206-c098-4dcc-a4ea-c017c49c457e/bin/uautomizer/data/9aa2466e0/b002ae9bed9b4c6e89221fc12601aac2/FLAGc4409c61f [2019-11-15 21:58:41,643 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:58:41,644 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bcf64206-c098-4dcc-a4ea-c017c49c457e/sv-benchmarks/c/pthread-wmm/mix022_pso.oepc.i [2019-11-15 21:58:41,660 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bcf64206-c098-4dcc-a4ea-c017c49c457e/bin/uautomizer/data/9aa2466e0/b002ae9bed9b4c6e89221fc12601aac2/FLAGc4409c61f [2019-11-15 21:58:41,940 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bcf64206-c098-4dcc-a4ea-c017c49c457e/bin/uautomizer/data/9aa2466e0/b002ae9bed9b4c6e89221fc12601aac2 [2019-11-15 21:58:41,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:58:41,944 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:58:41,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:58:41,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:58:41,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:58:41,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:58:41" (1/1) ... [2019-11-15 21:58:41,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f1b5ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:41, skipping insertion in model container [2019-11-15 21:58:41,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:58:41" (1/1) ... [2019-11-15 21:58:41,962 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:58:42,020 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:58:42,438 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:58:42,462 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:58:42,526 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:58:42,607 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:58:42,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:42 WrapperNode [2019-11-15 21:58:42,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:58:42,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:58:42,609 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:58:42,609 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:58:42,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:42" (1/1) ... [2019-11-15 21:58:42,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:42" (1/1) ... [2019-11-15 21:58:42,678 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:58:42,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:58:42,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:58:42,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:58:42,688 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:42" (1/1) ... [2019-11-15 21:58:42,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:42" (1/1) ... [2019-11-15 21:58:42,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:42" (1/1) ... [2019-11-15 21:58:42,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:42" (1/1) ... [2019-11-15 21:58:42,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:42" (1/1) ... [2019-11-15 21:58:42,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:42" (1/1) ... [2019-11-15 21:58:42,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:42" (1/1) ... [2019-11-15 21:58:42,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:58:42,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:58:42,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:58:42,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:58:42,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bcf64206-c098-4dcc-a4ea-c017c49c457e/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:58:42,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:58:42,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 21:58:42,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:58:42,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:58:42,813 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 21:58:42,814 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 21:58:42,814 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 21:58:42,814 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 21:58:42,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 21:58:42,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:58:42,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:58:42,818 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 21:58:43,595 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:58:43,596 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 21:58:43,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:58:43 BoogieIcfgContainer [2019-11-15 21:58:43,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:58:43,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:58:43,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:58:43,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:58:43,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:58:41" (1/3) ... [2019-11-15 21:58:43,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4500e73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:58:43, skipping insertion in model container [2019-11-15 21:58:43,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:58:42" (2/3) ... [2019-11-15 21:58:43,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4500e73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:58:43, skipping insertion in model container [2019-11-15 21:58:43,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:58:43" (3/3) ... [2019-11-15 21:58:43,603 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_pso.oepc.i [2019-11-15 21:58:43,641 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,641 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,641 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,642 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,642 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,642 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,643 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,643 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,643 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,643 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,644 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,644 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,644 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,644 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,644 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,645 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,645 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,645 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,645 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,646 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,646 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,646 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,646 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,647 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,647 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,647 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,647 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,648 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,648 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,648 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,648 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,648 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,649 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,649 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,650 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,650 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,650 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,651 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,651 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,651 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,651 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,651 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,652 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,652 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,652 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,652 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,653 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,653 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,653 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,653 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,654 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,654 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,654 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,654 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,654 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,655 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,655 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,655 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,655 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,656 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,656 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,656 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,656 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,657 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,657 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,657 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,657 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,658 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,658 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,658 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,658 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,660 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,660 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,660 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,660 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,661 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,661 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,661 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,661 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,662 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,662 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,662 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,662 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,662 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,663 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,663 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,663 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,663 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,665 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,665 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,665 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,665 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,669 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,669 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,669 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,669 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,670 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,670 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,670 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,670 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,670 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,671 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,671 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,671 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,671 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,671 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,672 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,672 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,672 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,672 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,673 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,673 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,673 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,673 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,674 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,674 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,674 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,674 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,674 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,675 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,675 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,675 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,675 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,675 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,676 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,676 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,676 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,676 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:58:43,685 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 21:58:43,686 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:58:43,694 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 21:58:43,704 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 21:58:43,721 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:58:43,721 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:58:43,722 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:58:43,722 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:58:43,722 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:58:43,722 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:58:43,722 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:58:43,722 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:58:43,733 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 178 transitions [2019-11-15 21:58:46,634 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32590 states. [2019-11-15 21:58:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand 32590 states. [2019-11-15 21:58:46,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 21:58:46,646 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:46,647 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:58:46,651 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:58:46,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:46,656 INFO L82 PathProgramCache]: Analyzing trace with hash -460425359, now seen corresponding path program 1 times [2019-11-15 21:58:46,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:46,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540801121] [2019-11-15 21:58:46,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:46,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:46,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:46,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:58:46,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540801121] [2019-11-15 21:58:46,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:58:46,995 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:58:46,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923759783] [2019-11-15 21:58:47,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:58:47,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:47,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:58:47,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:58:47,017 INFO L87 Difference]: Start difference. First operand 32590 states. Second operand 4 states. [2019-11-15 21:58:47,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:47,841 INFO L93 Difference]: Finished difference Result 33590 states and 129567 transitions. [2019-11-15 21:58:47,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:58:47,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-15 21:58:47,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:48,088 INFO L225 Difference]: With dead ends: 33590 [2019-11-15 21:58:48,089 INFO L226 Difference]: Without dead ends: 25702 [2019-11-15 21:58:48,090 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:58:48,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2019-11-15 21:58:49,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 25702. [2019-11-15 21:58:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25702 states. [2019-11-15 21:58:49,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25702 states to 25702 states and 99583 transitions. [2019-11-15 21:58:49,515 INFO L78 Accepts]: Start accepts. Automaton has 25702 states and 99583 transitions. Word has length 33 [2019-11-15 21:58:49,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:49,516 INFO L462 AbstractCegarLoop]: Abstraction has 25702 states and 99583 transitions. [2019-11-15 21:58:49,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:58:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 25702 states and 99583 transitions. [2019-11-15 21:58:49,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 21:58:49,525 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:49,525 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:58:49,525 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:58:49,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:49,526 INFO L82 PathProgramCache]: Analyzing trace with hash 407606531, now seen corresponding path program 1 times [2019-11-15 21:58:49,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:49,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620797828] [2019-11-15 21:58:49,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:49,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:49,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:58:49,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620797828] [2019-11-15 21:58:49,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:58:49,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:58:49,644 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087481573] [2019-11-15 21:58:49,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:58:49,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:49,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:58:49,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:58:49,646 INFO L87 Difference]: Start difference. First operand 25702 states and 99583 transitions. Second operand 5 states. [2019-11-15 21:58:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:50,488 INFO L93 Difference]: Finished difference Result 41080 states and 150430 transitions. [2019-11-15 21:58:50,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:58:50,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-15 21:58:50,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:50,667 INFO L225 Difference]: With dead ends: 41080 [2019-11-15 21:58:50,668 INFO L226 Difference]: Without dead ends: 40544 [2019-11-15 21:58:50,671 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:58:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40544 states. [2019-11-15 21:58:52,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40544 to 38924. [2019-11-15 21:58:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38924 states. [2019-11-15 21:58:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38924 states to 38924 states and 143580 transitions. [2019-11-15 21:58:52,248 INFO L78 Accepts]: Start accepts. Automaton has 38924 states and 143580 transitions. Word has length 45 [2019-11-15 21:58:52,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:52,252 INFO L462 AbstractCegarLoop]: Abstraction has 38924 states and 143580 transitions. [2019-11-15 21:58:52,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:58:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand 38924 states and 143580 transitions. [2019-11-15 21:58:52,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 21:58:52,259 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:52,260 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:58:52,260 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:58:52,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:52,260 INFO L82 PathProgramCache]: Analyzing trace with hash 464590315, now seen corresponding path program 1 times [2019-11-15 21:58:52,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:52,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552334453] [2019-11-15 21:58:52,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:52,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:52,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:52,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:58:52,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552334453] [2019-11-15 21:58:52,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:58:52,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:58:52,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767102895] [2019-11-15 21:58:52,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:58:52,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:52,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:58:52,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:58:52,357 INFO L87 Difference]: Start difference. First operand 38924 states and 143580 transitions. Second operand 5 states. [2019-11-15 21:58:53,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:53,400 INFO L93 Difference]: Finished difference Result 49777 states and 180632 transitions. [2019-11-15 21:58:53,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:58:53,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-15 21:58:53,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:53,565 INFO L225 Difference]: With dead ends: 49777 [2019-11-15 21:58:53,565 INFO L226 Difference]: Without dead ends: 49273 [2019-11-15 21:58:53,567 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:58:53,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49273 states. [2019-11-15 21:58:54,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49273 to 42676. [2019-11-15 21:58:54,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42676 states. [2019-11-15 21:58:54,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42676 states to 42676 states and 156591 transitions. [2019-11-15 21:58:54,694 INFO L78 Accepts]: Start accepts. Automaton has 42676 states and 156591 transitions. Word has length 46 [2019-11-15 21:58:54,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:54,695 INFO L462 AbstractCegarLoop]: Abstraction has 42676 states and 156591 transitions. [2019-11-15 21:58:54,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:58:54,695 INFO L276 IsEmpty]: Start isEmpty. Operand 42676 states and 156591 transitions. [2019-11-15 21:58:54,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 21:58:54,703 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:54,703 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:58:54,703 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:58:54,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:54,704 INFO L82 PathProgramCache]: Analyzing trace with hash 765924305, now seen corresponding path program 1 times [2019-11-15 21:58:54,704 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:54,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474422640] [2019-11-15 21:58:54,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:54,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:54,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:54,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:58:54,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474422640] [2019-11-15 21:58:54,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:58:54,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:58:54,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296532903] [2019-11-15 21:58:54,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:58:54,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:54,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:58:54,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:58:54,763 INFO L87 Difference]: Start difference. First operand 42676 states and 156591 transitions. Second operand 3 states. [2019-11-15 21:58:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:55,750 INFO L93 Difference]: Finished difference Result 61086 states and 221429 transitions. [2019-11-15 21:58:55,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:58:55,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-15 21:58:55,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:55,940 INFO L225 Difference]: With dead ends: 61086 [2019-11-15 21:58:55,941 INFO L226 Difference]: Without dead ends: 61086 [2019-11-15 21:58:55,941 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:58:56,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61086 states. [2019-11-15 21:58:56,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61086 to 48015. [2019-11-15 21:58:56,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48015 states. [2019-11-15 21:58:57,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48015 states to 48015 states and 174178 transitions. [2019-11-15 21:58:57,110 INFO L78 Accepts]: Start accepts. Automaton has 48015 states and 174178 transitions. Word has length 48 [2019-11-15 21:58:57,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:57,110 INFO L462 AbstractCegarLoop]: Abstraction has 48015 states and 174178 transitions. [2019-11-15 21:58:57,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:58:57,110 INFO L276 IsEmpty]: Start isEmpty. Operand 48015 states and 174178 transitions. [2019-11-15 21:58:57,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 21:58:57,123 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:57,124 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:58:57,124 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:58:57,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:57,124 INFO L82 PathProgramCache]: Analyzing trace with hash 147603122, now seen corresponding path program 1 times [2019-11-15 21:58:57,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:57,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618856016] [2019-11-15 21:58:57,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:57,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:57,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:57,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:58:57,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618856016] [2019-11-15 21:58:57,274 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:58:57,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:58:57,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396534128] [2019-11-15 21:58:57,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:58:57,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:57,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:58:57,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:58:57,275 INFO L87 Difference]: Start difference. First operand 48015 states and 174178 transitions. Second operand 6 states. [2019-11-15 21:58:58,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:58,968 INFO L93 Difference]: Finished difference Result 63755 states and 229378 transitions. [2019-11-15 21:58:58,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:58:58,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 21:58:58,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:59,116 INFO L225 Difference]: With dead ends: 63755 [2019-11-15 21:58:59,116 INFO L226 Difference]: Without dead ends: 63755 [2019-11-15 21:58:59,117 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 21:58:59,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63755 states. [2019-11-15 21:59:00,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63755 to 59948. [2019-11-15 21:59:00,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59948 states. [2019-11-15 21:59:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59948 states to 59948 states and 215671 transitions. [2019-11-15 21:59:00,405 INFO L78 Accepts]: Start accepts. Automaton has 59948 states and 215671 transitions. Word has length 52 [2019-11-15 21:59:00,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:00,406 INFO L462 AbstractCegarLoop]: Abstraction has 59948 states and 215671 transitions. [2019-11-15 21:59:00,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:59:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand 59948 states and 215671 transitions. [2019-11-15 21:59:00,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 21:59:00,420 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:00,420 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:59:00,420 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:00,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:00,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1649348237, now seen corresponding path program 1 times [2019-11-15 21:59:00,421 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:00,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771780060] [2019-11-15 21:59:00,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:00,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:00,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:00,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:00,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771780060] [2019-11-15 21:59:00,509 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:00,509 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:59:00,509 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905309920] [2019-11-15 21:59:00,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:59:00,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:00,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:59:00,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:59:00,510 INFO L87 Difference]: Start difference. First operand 59948 states and 215671 transitions. Second operand 3 states. [2019-11-15 21:59:01,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:01,378 INFO L93 Difference]: Finished difference Result 54020 states and 188917 transitions. [2019-11-15 21:59:01,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:59:01,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-15 21:59:01,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:01,489 INFO L225 Difference]: With dead ends: 54020 [2019-11-15 21:59:01,489 INFO L226 Difference]: Without dead ends: 54020 [2019-11-15 21:59:01,489 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:59:01,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54020 states. [2019-11-15 21:59:02,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54020 to 53405. [2019-11-15 21:59:02,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53405 states. [2019-11-15 21:59:02,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53405 states to 53405 states and 187036 transitions. [2019-11-15 21:59:02,499 INFO L78 Accepts]: Start accepts. Automaton has 53405 states and 187036 transitions. Word has length 52 [2019-11-15 21:59:02,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:02,500 INFO L462 AbstractCegarLoop]: Abstraction has 53405 states and 187036 transitions. [2019-11-15 21:59:02,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:59:02,500 INFO L276 IsEmpty]: Start isEmpty. Operand 53405 states and 187036 transitions. [2019-11-15 21:59:02,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 21:59:02,509 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:02,509 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:59:02,509 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:02,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:02,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1935410276, now seen corresponding path program 1 times [2019-11-15 21:59:02,510 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:02,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338768390] [2019-11-15 21:59:02,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:02,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:02,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:02,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338768390] [2019-11-15 21:59:02,580 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:02,580 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:59:02,580 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055823952] [2019-11-15 21:59:02,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:59:02,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:02,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:59:02,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:59:02,581 INFO L87 Difference]: Start difference. First operand 53405 states and 187036 transitions. Second operand 6 states. [2019-11-15 21:59:03,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:03,339 INFO L93 Difference]: Finished difference Result 68645 states and 237300 transitions. [2019-11-15 21:59:03,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:59:03,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 21:59:03,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:03,505 INFO L225 Difference]: With dead ends: 68645 [2019-11-15 21:59:03,506 INFO L226 Difference]: Without dead ends: 68077 [2019-11-15 21:59:03,506 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:59:04,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68077 states. [2019-11-15 21:59:05,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68077 to 53489. [2019-11-15 21:59:05,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53489 states. [2019-11-15 21:59:05,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53489 states to 53489 states and 187733 transitions. [2019-11-15 21:59:05,162 INFO L78 Accepts]: Start accepts. Automaton has 53489 states and 187733 transitions. Word has length 52 [2019-11-15 21:59:05,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:05,162 INFO L462 AbstractCegarLoop]: Abstraction has 53489 states and 187733 transitions. [2019-11-15 21:59:05,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:59:05,163 INFO L276 IsEmpty]: Start isEmpty. Operand 53489 states and 187733 transitions. [2019-11-15 21:59:05,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 21:59:05,175 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:05,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] [2019-11-15 21:59:05,175 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:05,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:05,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1611667424, now seen corresponding path program 1 times [2019-11-15 21:59:05,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:05,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365247275] [2019-11-15 21:59:05,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:05,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:05,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:05,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365247275] [2019-11-15 21:59:05,271 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:05,271 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:59:05,271 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401121078] [2019-11-15 21:59:05,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:59:05,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:05,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:59:05,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:59:05,272 INFO L87 Difference]: Start difference. First operand 53489 states and 187733 transitions. Second operand 5 states. [2019-11-15 21:59:05,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:05,363 INFO L93 Difference]: Finished difference Result 10211 states and 31245 transitions. [2019-11-15 21:59:05,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:59:05,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-11-15 21:59:05,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:05,379 INFO L225 Difference]: With dead ends: 10211 [2019-11-15 21:59:05,379 INFO L226 Difference]: Without dead ends: 8506 [2019-11-15 21:59:05,380 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:59:05,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8506 states. [2019-11-15 21:59:05,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8506 to 8458. [2019-11-15 21:59:05,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8458 states. [2019-11-15 21:59:05,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8458 states to 8458 states and 25324 transitions. [2019-11-15 21:59:05,529 INFO L78 Accepts]: Start accepts. Automaton has 8458 states and 25324 transitions. Word has length 53 [2019-11-15 21:59:05,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:05,529 INFO L462 AbstractCegarLoop]: Abstraction has 8458 states and 25324 transitions. [2019-11-15 21:59:05,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:59:05,529 INFO L276 IsEmpty]: Start isEmpty. Operand 8458 states and 25324 transitions. [2019-11-15 21:59:05,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 21:59:05,533 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:05,533 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:59:05,534 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:05,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:05,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1079306888, now seen corresponding path program 1 times [2019-11-15 21:59:05,534 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:05,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134574179] [2019-11-15 21:59:05,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:05,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:05,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:05,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134574179] [2019-11-15 21:59:05,590 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:05,590 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:59:05,590 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477765302] [2019-11-15 21:59:05,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:59:05,591 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:05,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:59:05,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:59:05,591 INFO L87 Difference]: Start difference. First operand 8458 states and 25324 transitions. Second operand 4 states. [2019-11-15 21:59:05,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:05,711 INFO L93 Difference]: Finished difference Result 9705 states and 29103 transitions. [2019-11-15 21:59:05,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:59:05,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 21:59:05,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:05,723 INFO L225 Difference]: With dead ends: 9705 [2019-11-15 21:59:05,723 INFO L226 Difference]: Without dead ends: 9705 [2019-11-15 21:59:05,724 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:59:05,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9705 states. [2019-11-15 21:59:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9705 to 8878. [2019-11-15 21:59:05,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8878 states. [2019-11-15 21:59:05,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8878 states to 8878 states and 26587 transitions. [2019-11-15 21:59:05,842 INFO L78 Accepts]: Start accepts. Automaton has 8878 states and 26587 transitions. Word has length 60 [2019-11-15 21:59:05,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:05,843 INFO L462 AbstractCegarLoop]: Abstraction has 8878 states and 26587 transitions. [2019-11-15 21:59:05,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:59:05,843 INFO L276 IsEmpty]: Start isEmpty. Operand 8878 states and 26587 transitions. [2019-11-15 21:59:05,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 21:59:05,845 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:05,846 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:59:05,846 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:05,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:05,846 INFO L82 PathProgramCache]: Analyzing trace with hash 663503447, now seen corresponding path program 1 times [2019-11-15 21:59:05,846 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:05,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365721703] [2019-11-15 21:59:05,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:05,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:05,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:05,926 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365721703] [2019-11-15 21:59:05,926 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:05,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:59:05,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669772] [2019-11-15 21:59:05,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:59:05,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:05,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:59:05,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:59:05,928 INFO L87 Difference]: Start difference. First operand 8878 states and 26587 transitions. Second operand 6 states. [2019-11-15 21:59:06,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:06,245 INFO L93 Difference]: Finished difference Result 11194 states and 33074 transitions. [2019-11-15 21:59:06,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:59:06,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-15 21:59:06,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:06,260 INFO L225 Difference]: With dead ends: 11194 [2019-11-15 21:59:06,260 INFO L226 Difference]: Without dead ends: 11133 [2019-11-15 21:59:06,260 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:59:06,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11133 states. [2019-11-15 21:59:06,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11133 to 10409. [2019-11-15 21:59:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10409 states. [2019-11-15 21:59:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10409 states to 10409 states and 30941 transitions. [2019-11-15 21:59:06,404 INFO L78 Accepts]: Start accepts. Automaton has 10409 states and 30941 transitions. Word has length 60 [2019-11-15 21:59:06,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:06,405 INFO L462 AbstractCegarLoop]: Abstraction has 10409 states and 30941 transitions. [2019-11-15 21:59:06,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:59:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 10409 states and 30941 transitions. [2019-11-15 21:59:06,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:59:06,410 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:06,410 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 21:59:06,410 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:06,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:06,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1874779720, now seen corresponding path program 1 times [2019-11-15 21:59:06,411 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:06,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731799831] [2019-11-15 21:59:06,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:06,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:06,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:06,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:06,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731799831] [2019-11-15 21:59:06,457 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:06,457 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:59:06,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375091369] [2019-11-15 21:59:06,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:59:06,458 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:06,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:59:06,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:59:06,458 INFO L87 Difference]: Start difference. First operand 10409 states and 30941 transitions. Second operand 3 states. [2019-11-15 21:59:06,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:06,535 INFO L93 Difference]: Finished difference Result 12981 states and 38320 transitions. [2019-11-15 21:59:06,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:59:06,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-15 21:59:06,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:06,559 INFO L225 Difference]: With dead ends: 12981 [2019-11-15 21:59:06,559 INFO L226 Difference]: Without dead ends: 12981 [2019-11-15 21:59:06,560 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:59:06,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12981 states. [2019-11-15 21:59:06,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12981 to 10055. [2019-11-15 21:59:06,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10055 states. [2019-11-15 21:59:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10055 states to 10055 states and 29419 transitions. [2019-11-15 21:59:06,765 INFO L78 Accepts]: Start accepts. Automaton has 10055 states and 29419 transitions. Word has length 66 [2019-11-15 21:59:06,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:06,765 INFO L462 AbstractCegarLoop]: Abstraction has 10055 states and 29419 transitions. [2019-11-15 21:59:06,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:59:06,765 INFO L276 IsEmpty]: Start isEmpty. Operand 10055 states and 29419 transitions. [2019-11-15 21:59:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:59:06,773 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:06,774 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 21:59:06,774 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:06,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:06,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1877855896, now seen corresponding path program 1 times [2019-11-15 21:59:06,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:06,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145534215] [2019-11-15 21:59:06,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:06,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:06,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:06,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:06,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145534215] [2019-11-15 21:59:06,870 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:06,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:59:06,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337565692] [2019-11-15 21:59:06,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:59:06,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:06,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:59:06,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:59:06,871 INFO L87 Difference]: Start difference. First operand 10055 states and 29419 transitions. Second operand 4 states. [2019-11-15 21:59:07,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:07,207 INFO L93 Difference]: Finished difference Result 13024 states and 37644 transitions. [2019-11-15 21:59:07,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:59:07,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 21:59:07,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:07,230 INFO L225 Difference]: With dead ends: 13024 [2019-11-15 21:59:07,231 INFO L226 Difference]: Without dead ends: 13024 [2019-11-15 21:59:07,231 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:59:07,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13024 states. [2019-11-15 21:59:07,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13024 to 11485. [2019-11-15 21:59:07,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11485 states. [2019-11-15 21:59:07,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11485 states to 11485 states and 33302 transitions. [2019-11-15 21:59:07,409 INFO L78 Accepts]: Start accepts. Automaton has 11485 states and 33302 transitions. Word has length 66 [2019-11-15 21:59:07,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:07,410 INFO L462 AbstractCegarLoop]: Abstraction has 11485 states and 33302 transitions. [2019-11-15 21:59:07,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:59:07,410 INFO L276 IsEmpty]: Start isEmpty. Operand 11485 states and 33302 transitions. [2019-11-15 21:59:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:59:07,418 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:07,418 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 21:59:07,418 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:07,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:07,418 INFO L82 PathProgramCache]: Analyzing trace with hash -633091415, now seen corresponding path program 1 times [2019-11-15 21:59:07,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:07,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55399597] [2019-11-15 21:59:07,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:07,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:07,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:07,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:07,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55399597] [2019-11-15 21:59:07,540 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:07,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:59:07,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538216223] [2019-11-15 21:59:07,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:59:07,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:07,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:59:07,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:59:07,542 INFO L87 Difference]: Start difference. First operand 11485 states and 33302 transitions. Second operand 6 states. [2019-11-15 21:59:08,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:08,133 INFO L93 Difference]: Finished difference Result 12624 states and 35968 transitions. [2019-11-15 21:59:08,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:59:08,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 21:59:08,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:08,152 INFO L225 Difference]: With dead ends: 12624 [2019-11-15 21:59:08,152 INFO L226 Difference]: Without dead ends: 12624 [2019-11-15 21:59:08,152 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 21:59:08,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12624 states. [2019-11-15 21:59:08,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12624 to 12326. [2019-11-15 21:59:08,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12326 states. [2019-11-15 21:59:08,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12326 states to 12326 states and 35227 transitions. [2019-11-15 21:59:08,337 INFO L78 Accepts]: Start accepts. Automaton has 12326 states and 35227 transitions. Word has length 66 [2019-11-15 21:59:08,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:08,337 INFO L462 AbstractCegarLoop]: Abstraction has 12326 states and 35227 transitions. [2019-11-15 21:59:08,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:59:08,338 INFO L276 IsEmpty]: Start isEmpty. Operand 12326 states and 35227 transitions. [2019-11-15 21:59:08,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:59:08,347 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:08,348 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 21:59:08,348 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:08,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:08,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1584666538, now seen corresponding path program 1 times [2019-11-15 21:59:08,348 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:08,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230513849] [2019-11-15 21:59:08,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:08,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:08,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:08,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230513849] [2019-11-15 21:59:08,452 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:08,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:59:08,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729233610] [2019-11-15 21:59:08,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:59:08,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:08,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:59:08,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:59:08,454 INFO L87 Difference]: Start difference. First operand 12326 states and 35227 transitions. Second operand 6 states. [2019-11-15 21:59:08,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:08,935 INFO L93 Difference]: Finished difference Result 14179 states and 39338 transitions. [2019-11-15 21:59:08,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:59:08,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 21:59:08,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:08,953 INFO L225 Difference]: With dead ends: 14179 [2019-11-15 21:59:08,953 INFO L226 Difference]: Without dead ends: 14179 [2019-11-15 21:59:08,954 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:59:08,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14179 states. [2019-11-15 21:59:09,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14179 to 12926. [2019-11-15 21:59:09,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12926 states. [2019-11-15 21:59:09,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12926 states to 12926 states and 36258 transitions. [2019-11-15 21:59:09,126 INFO L78 Accepts]: Start accepts. Automaton has 12926 states and 36258 transitions. Word has length 66 [2019-11-15 21:59:09,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:09,126 INFO L462 AbstractCegarLoop]: Abstraction has 12926 states and 36258 transitions. [2019-11-15 21:59:09,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:59:09,126 INFO L276 IsEmpty]: Start isEmpty. Operand 12926 states and 36258 transitions. [2019-11-15 21:59:09,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:59:09,134 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:09,134 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 21:59:09,134 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:09,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:09,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1796017451, now seen corresponding path program 1 times [2019-11-15 21:59:09,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:09,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487439072] [2019-11-15 21:59:09,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:09,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:09,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:09,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:09,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487439072] [2019-11-15 21:59:09,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:09,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:59:09,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470977600] [2019-11-15 21:59:09,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:59:09,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:09,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:59:09,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:59:09,203 INFO L87 Difference]: Start difference. First operand 12926 states and 36258 transitions. Second operand 5 states. [2019-11-15 21:59:09,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:09,584 INFO L93 Difference]: Finished difference Result 16752 states and 46765 transitions. [2019-11-15 21:59:09,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:59:09,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 21:59:09,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:09,605 INFO L225 Difference]: With dead ends: 16752 [2019-11-15 21:59:09,605 INFO L226 Difference]: Without dead ends: 16752 [2019-11-15 21:59:09,606 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:59:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16752 states. [2019-11-15 21:59:09,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16752 to 15456. [2019-11-15 21:59:09,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15456 states. [2019-11-15 21:59:09,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15456 states to 15456 states and 42981 transitions. [2019-11-15 21:59:09,825 INFO L78 Accepts]: Start accepts. Automaton has 15456 states and 42981 transitions. Word has length 66 [2019-11-15 21:59:09,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:09,825 INFO L462 AbstractCegarLoop]: Abstraction has 15456 states and 42981 transitions. [2019-11-15 21:59:09,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:59:09,825 INFO L276 IsEmpty]: Start isEmpty. Operand 15456 states and 42981 transitions. [2019-11-15 21:59:09,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:59:09,836 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:09,836 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 21:59:09,836 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:09,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:09,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1285483274, now seen corresponding path program 1 times [2019-11-15 21:59:09,837 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:09,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021839424] [2019-11-15 21:59:09,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:09,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:09,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:09,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:09,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021839424] [2019-11-15 21:59:09,920 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:09,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:59:09,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467418439] [2019-11-15 21:59:09,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:59:09,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:09,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:59:09,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:59:09,922 INFO L87 Difference]: Start difference. First operand 15456 states and 42981 transitions. Second operand 5 states. [2019-11-15 21:59:09,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:09,994 INFO L93 Difference]: Finished difference Result 5880 states and 13569 transitions. [2019-11-15 21:59:09,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:59:09,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 21:59:09,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:10,001 INFO L225 Difference]: With dead ends: 5880 [2019-11-15 21:59:10,001 INFO L226 Difference]: Without dead ends: 5034 [2019-11-15 21:59:10,001 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:59:10,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5034 states. [2019-11-15 21:59:10,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5034 to 4609. [2019-11-15 21:59:10,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4609 states. [2019-11-15 21:59:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4609 states to 4609 states and 10279 transitions. [2019-11-15 21:59:10,058 INFO L78 Accepts]: Start accepts. Automaton has 4609 states and 10279 transitions. Word has length 66 [2019-11-15 21:59:10,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:10,059 INFO L462 AbstractCegarLoop]: Abstraction has 4609 states and 10279 transitions. [2019-11-15 21:59:10,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:59:10,059 INFO L276 IsEmpty]: Start isEmpty. Operand 4609 states and 10279 transitions. [2019-11-15 21:59:10,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 21:59:10,065 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:10,065 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:59:10,066 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:10,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:10,066 INFO L82 PathProgramCache]: Analyzing trace with hash -418310117, now seen corresponding path program 1 times [2019-11-15 21:59:10,066 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:10,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291667294] [2019-11-15 21:59:10,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:10,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:10,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:10,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291667294] [2019-11-15 21:59:10,130 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:10,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:59:10,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111126000] [2019-11-15 21:59:10,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:59:10,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:10,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:59:10,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:59:10,131 INFO L87 Difference]: Start difference. First operand 4609 states and 10279 transitions. Second operand 5 states. [2019-11-15 21:59:10,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:10,322 INFO L93 Difference]: Finished difference Result 5680 states and 12727 transitions. [2019-11-15 21:59:10,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:59:10,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-11-15 21:59:10,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:10,329 INFO L225 Difference]: With dead ends: 5680 [2019-11-15 21:59:10,329 INFO L226 Difference]: Without dead ends: 5680 [2019-11-15 21:59:10,330 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:59:10,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5680 states. [2019-11-15 21:59:10,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5680 to 5029. [2019-11-15 21:59:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5029 states. [2019-11-15 21:59:10,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5029 states to 5029 states and 11237 transitions. [2019-11-15 21:59:10,387 INFO L78 Accepts]: Start accepts. Automaton has 5029 states and 11237 transitions. Word has length 72 [2019-11-15 21:59:10,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:10,388 INFO L462 AbstractCegarLoop]: Abstraction has 5029 states and 11237 transitions. [2019-11-15 21:59:10,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:59:10,388 INFO L276 IsEmpty]: Start isEmpty. Operand 5029 states and 11237 transitions. [2019-11-15 21:59:10,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 21:59:10,393 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:10,393 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:59:10,394 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:10,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:10,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1324500218, now seen corresponding path program 1 times [2019-11-15 21:59:10,394 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:10,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044168674] [2019-11-15 21:59:10,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:10,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:10,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:10,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044168674] [2019-11-15 21:59:10,475 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:10,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:59:10,475 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107633639] [2019-11-15 21:59:10,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:59:10,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:10,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:59:10,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:59:10,476 INFO L87 Difference]: Start difference. First operand 5029 states and 11237 transitions. Second operand 7 states. [2019-11-15 21:59:10,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:10,897 INFO L93 Difference]: Finished difference Result 5915 states and 13088 transitions. [2019-11-15 21:59:10,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:59:10,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-11-15 21:59:10,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:10,902 INFO L225 Difference]: With dead ends: 5915 [2019-11-15 21:59:10,902 INFO L226 Difference]: Without dead ends: 5862 [2019-11-15 21:59:10,903 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:59:10,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5862 states. [2019-11-15 21:59:10,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5862 to 5116. [2019-11-15 21:59:10,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5116 states. [2019-11-15 21:59:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5116 states to 5116 states and 11326 transitions. [2019-11-15 21:59:10,957 INFO L78 Accepts]: Start accepts. Automaton has 5116 states and 11326 transitions. Word has length 72 [2019-11-15 21:59:10,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:10,957 INFO L462 AbstractCegarLoop]: Abstraction has 5116 states and 11326 transitions. [2019-11-15 21:59:10,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:59:10,957 INFO L276 IsEmpty]: Start isEmpty. Operand 5116 states and 11326 transitions. [2019-11-15 21:59:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 21:59:10,962 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:10,962 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:59:10,962 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:10,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:10,962 INFO L82 PathProgramCache]: Analyzing trace with hash -766772232, now seen corresponding path program 1 times [2019-11-15 21:59:10,963 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:10,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72166371] [2019-11-15 21:59:10,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:10,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:10,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:11,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72166371] [2019-11-15 21:59:11,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:11,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:59:11,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880159840] [2019-11-15 21:59:11,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:59:11,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:11,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:59:11,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:59:11,062 INFO L87 Difference]: Start difference. First operand 5116 states and 11326 transitions. Second operand 5 states. [2019-11-15 21:59:11,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:11,622 INFO L93 Difference]: Finished difference Result 7804 states and 17573 transitions. [2019-11-15 21:59:11,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:59:11,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-15 21:59:11,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:11,632 INFO L225 Difference]: With dead ends: 7804 [2019-11-15 21:59:11,632 INFO L226 Difference]: Without dead ends: 7804 [2019-11-15 21:59:11,633 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:59:11,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7804 states. [2019-11-15 21:59:11,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7804 to 5161. [2019-11-15 21:59:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5161 states. [2019-11-15 21:59:11,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5161 states to 5161 states and 11431 transitions. [2019-11-15 21:59:11,730 INFO L78 Accepts]: Start accepts. Automaton has 5161 states and 11431 transitions. Word has length 93 [2019-11-15 21:59:11,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:11,730 INFO L462 AbstractCegarLoop]: Abstraction has 5161 states and 11431 transitions. [2019-11-15 21:59:11,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:59:11,731 INFO L276 IsEmpty]: Start isEmpty. Operand 5161 states and 11431 transitions. [2019-11-15 21:59:11,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 21:59:11,737 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:11,738 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:59:11,738 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:11,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:11,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1731243705, now seen corresponding path program 1 times [2019-11-15 21:59:11,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:11,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395007546] [2019-11-15 21:59:11,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:11,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:11,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:11,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:11,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395007546] [2019-11-15 21:59:11,908 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:11,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:59:11,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468691181] [2019-11-15 21:59:11,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:59:11,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:11,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:59:11,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:59:11,910 INFO L87 Difference]: Start difference. First operand 5161 states and 11431 transitions. Second operand 7 states. [2019-11-15 21:59:12,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:12,428 INFO L93 Difference]: Finished difference Result 6305 states and 13957 transitions. [2019-11-15 21:59:12,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:59:12,428 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-11-15 21:59:12,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:12,434 INFO L225 Difference]: With dead ends: 6305 [2019-11-15 21:59:12,434 INFO L226 Difference]: Without dead ends: 6305 [2019-11-15 21:59:12,434 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:59:12,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6305 states. [2019-11-15 21:59:12,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6305 to 5635. [2019-11-15 21:59:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5635 states. [2019-11-15 21:59:12,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5635 states to 5635 states and 12452 transitions. [2019-11-15 21:59:12,497 INFO L78 Accepts]: Start accepts. Automaton has 5635 states and 12452 transitions. Word has length 93 [2019-11-15 21:59:12,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:12,498 INFO L462 AbstractCegarLoop]: Abstraction has 5635 states and 12452 transitions. [2019-11-15 21:59:12,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:59:12,498 INFO L276 IsEmpty]: Start isEmpty. Operand 5635 states and 12452 transitions. [2019-11-15 21:59:12,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 21:59:12,502 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:12,502 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:59:12,502 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:12,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:12,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2021133237, now seen corresponding path program 1 times [2019-11-15 21:59:12,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:12,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297853476] [2019-11-15 21:59:12,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:12,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:12,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:12,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:12,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297853476] [2019-11-15 21:59:12,657 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:12,657 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:59:12,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475021447] [2019-11-15 21:59:12,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:59:12,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:12,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:59:12,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:59:12,659 INFO L87 Difference]: Start difference. First operand 5635 states and 12452 transitions. Second operand 7 states. [2019-11-15 21:59:13,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:13,513 INFO L93 Difference]: Finished difference Result 6384 states and 14069 transitions. [2019-11-15 21:59:13,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 21:59:13,513 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-11-15 21:59:13,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:13,521 INFO L225 Difference]: With dead ends: 6384 [2019-11-15 21:59:13,521 INFO L226 Difference]: Without dead ends: 6298 [2019-11-15 21:59:13,522 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:59:13,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6298 states. [2019-11-15 21:59:13,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6298 to 5858. [2019-11-15 21:59:13,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5858 states. [2019-11-15 21:59:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5858 states to 5858 states and 12952 transitions. [2019-11-15 21:59:13,614 INFO L78 Accepts]: Start accepts. Automaton has 5858 states and 12952 transitions. Word has length 93 [2019-11-15 21:59:13,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:13,615 INFO L462 AbstractCegarLoop]: Abstraction has 5858 states and 12952 transitions. [2019-11-15 21:59:13,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:59:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand 5858 states and 12952 transitions. [2019-11-15 21:59:13,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 21:59:13,625 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:13,625 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:59:13,625 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:13,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:13,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1805384877, now seen corresponding path program 1 times [2019-11-15 21:59:13,626 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:13,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684105220] [2019-11-15 21:59:13,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:13,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:13,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:13,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684105220] [2019-11-15 21:59:13,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:13,778 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:59:13,778 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665534224] [2019-11-15 21:59:13,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:59:13,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:13,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:59:13,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:59:13,779 INFO L87 Difference]: Start difference. First operand 5858 states and 12952 transitions. Second operand 7 states. [2019-11-15 21:59:14,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:14,373 INFO L93 Difference]: Finished difference Result 7581 states and 16534 transitions. [2019-11-15 21:59:14,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:59:14,373 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-11-15 21:59:14,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:14,380 INFO L225 Difference]: With dead ends: 7581 [2019-11-15 21:59:14,380 INFO L226 Difference]: Without dead ends: 7529 [2019-11-15 21:59:14,380 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:59:14,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7529 states. [2019-11-15 21:59:14,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7529 to 6656. [2019-11-15 21:59:14,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6656 states. [2019-11-15 21:59:14,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6656 states to 6656 states and 14593 transitions. [2019-11-15 21:59:14,456 INFO L78 Accepts]: Start accepts. Automaton has 6656 states and 14593 transitions. Word has length 93 [2019-11-15 21:59:14,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:14,456 INFO L462 AbstractCegarLoop]: Abstraction has 6656 states and 14593 transitions. [2019-11-15 21:59:14,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:59:14,456 INFO L276 IsEmpty]: Start isEmpty. Operand 6656 states and 14593 transitions. [2019-11-15 21:59:14,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 21:59:14,463 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:14,463 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:59:14,463 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:14,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:14,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1855052314, now seen corresponding path program 1 times [2019-11-15 21:59:14,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:14,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516162212] [2019-11-15 21:59:14,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:14,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:14,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:14,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:14,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516162212] [2019-11-15 21:59:14,528 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:14,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:59:14,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19767474] [2019-11-15 21:59:14,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:59:14,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:14,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:59:14,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:59:14,529 INFO L87 Difference]: Start difference. First operand 6656 states and 14593 transitions. Second operand 4 states. [2019-11-15 21:59:14,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:14,652 INFO L93 Difference]: Finished difference Result 6959 states and 15169 transitions. [2019-11-15 21:59:14,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:59:14,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-15 21:59:14,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:14,661 INFO L225 Difference]: With dead ends: 6959 [2019-11-15 21:59:14,661 INFO L226 Difference]: Without dead ends: 6714 [2019-11-15 21:59:14,661 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:59:14,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6714 states. [2019-11-15 21:59:14,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6714 to 5996. [2019-11-15 21:59:14,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5996 states. [2019-11-15 21:59:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5996 states to 5996 states and 13178 transitions. [2019-11-15 21:59:14,734 INFO L78 Accepts]: Start accepts. Automaton has 5996 states and 13178 transitions. Word has length 93 [2019-11-15 21:59:14,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:14,734 INFO L462 AbstractCegarLoop]: Abstraction has 5996 states and 13178 transitions. [2019-11-15 21:59:14,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:59:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand 5996 states and 13178 transitions. [2019-11-15 21:59:14,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:59:14,739 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:14,739 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:59:14,740 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:14,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:14,740 INFO L82 PathProgramCache]: Analyzing trace with hash -440686322, now seen corresponding path program 1 times [2019-11-15 21:59:14,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:14,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354775326] [2019-11-15 21:59:14,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:14,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:14,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:14,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354775326] [2019-11-15 21:59:14,814 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:14,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:59:14,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37834113] [2019-11-15 21:59:14,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:59:14,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:14,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:59:14,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:59:14,817 INFO L87 Difference]: Start difference. First operand 5996 states and 13178 transitions. Second operand 5 states. [2019-11-15 21:59:15,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:15,178 INFO L93 Difference]: Finished difference Result 7124 states and 15589 transitions. [2019-11-15 21:59:15,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:59:15,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 21:59:15,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:15,186 INFO L225 Difference]: With dead ends: 7124 [2019-11-15 21:59:15,186 INFO L226 Difference]: Without dead ends: 7072 [2019-11-15 21:59:15,186 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:59:15,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7072 states. [2019-11-15 21:59:15,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7072 to 6515. [2019-11-15 21:59:15,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6515 states. [2019-11-15 21:59:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6515 states to 6515 states and 14315 transitions. [2019-11-15 21:59:15,261 INFO L78 Accepts]: Start accepts. Automaton has 6515 states and 14315 transitions. Word has length 95 [2019-11-15 21:59:15,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:15,262 INFO L462 AbstractCegarLoop]: Abstraction has 6515 states and 14315 transitions. [2019-11-15 21:59:15,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:59:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 6515 states and 14315 transitions. [2019-11-15 21:59:15,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:59:15,270 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:15,270 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:59:15,271 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:15,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:15,271 INFO L82 PathProgramCache]: Analyzing trace with hash -695422867, now seen corresponding path program 1 times [2019-11-15 21:59:15,271 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:15,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251216885] [2019-11-15 21:59:15,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:15,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:15,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:15,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251216885] [2019-11-15 21:59:15,337 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:15,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:59:15,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961413608] [2019-11-15 21:59:15,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:59:15,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:15,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:59:15,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:59:15,338 INFO L87 Difference]: Start difference. First operand 6515 states and 14315 transitions. Second operand 5 states. [2019-11-15 21:59:15,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:15,658 INFO L93 Difference]: Finished difference Result 7544 states and 16475 transitions. [2019-11-15 21:59:15,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:59:15,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 21:59:15,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:15,666 INFO L225 Difference]: With dead ends: 7544 [2019-11-15 21:59:15,666 INFO L226 Difference]: Without dead ends: 7482 [2019-11-15 21:59:15,667 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 21:59:15,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7482 states. [2019-11-15 21:59:15,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7482 to 6200. [2019-11-15 21:59:15,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6200 states. [2019-11-15 21:59:15,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6200 states to 6200 states and 13697 transitions. [2019-11-15 21:59:15,765 INFO L78 Accepts]: Start accepts. Automaton has 6200 states and 13697 transitions. Word has length 95 [2019-11-15 21:59:15,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:15,766 INFO L462 AbstractCegarLoop]: Abstraction has 6200 states and 13697 transitions. [2019-11-15 21:59:15,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:59:15,766 INFO L276 IsEmpty]: Start isEmpty. Operand 6200 states and 13697 transitions. [2019-11-15 21:59:15,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:59:15,774 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:15,774 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:59:15,775 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:15,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:15,775 INFO L82 PathProgramCache]: Analyzing trace with hash -924923057, now seen corresponding path program 1 times [2019-11-15 21:59:15,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:15,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543693086] [2019-11-15 21:59:15,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:15,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:15,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:15,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:15,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543693086] [2019-11-15 21:59:15,886 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:15,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:59:15,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507812766] [2019-11-15 21:59:15,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:59:15,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:15,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:59:15,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:59:15,888 INFO L87 Difference]: Start difference. First operand 6200 states and 13697 transitions. Second operand 7 states. [2019-11-15 21:59:16,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:16,523 INFO L93 Difference]: Finished difference Result 7856 states and 17164 transitions. [2019-11-15 21:59:16,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:59:16,524 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-15 21:59:16,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:16,533 INFO L225 Difference]: With dead ends: 7856 [2019-11-15 21:59:16,533 INFO L226 Difference]: Without dead ends: 7856 [2019-11-15 21:59:16,533 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:59:16,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7856 states. [2019-11-15 21:59:16,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7856 to 6478. [2019-11-15 21:59:16,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6478 states. [2019-11-15 21:59:16,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6478 states to 6478 states and 14332 transitions. [2019-11-15 21:59:16,642 INFO L78 Accepts]: Start accepts. Automaton has 6478 states and 14332 transitions. Word has length 95 [2019-11-15 21:59:16,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:16,643 INFO L462 AbstractCegarLoop]: Abstraction has 6478 states and 14332 transitions. [2019-11-15 21:59:16,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:59:16,643 INFO L276 IsEmpty]: Start isEmpty. Operand 6478 states and 14332 transitions. [2019-11-15 21:59:16,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:59:16,651 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:16,651 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:59:16,651 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:16,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:16,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1062558703, now seen corresponding path program 1 times [2019-11-15 21:59:16,652 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:16,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224405928] [2019-11-15 21:59:16,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:16,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:16,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:16,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224405928] [2019-11-15 21:59:16,819 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:16,820 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:59:16,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904621398] [2019-11-15 21:59:16,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:59:16,821 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:16,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:59:16,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:59:16,821 INFO L87 Difference]: Start difference. First operand 6478 states and 14332 transitions. Second operand 9 states. [2019-11-15 21:59:17,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:17,567 INFO L93 Difference]: Finished difference Result 7060 states and 15499 transitions. [2019-11-15 21:59:17,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:59:17,567 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-11-15 21:59:17,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:17,573 INFO L225 Difference]: With dead ends: 7060 [2019-11-15 21:59:17,574 INFO L226 Difference]: Without dead ends: 7054 [2019-11-15 21:59:17,574 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:59:17,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7054 states. [2019-11-15 21:59:17,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7054 to 6483. [2019-11-15 21:59:17,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6483 states. [2019-11-15 21:59:17,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6483 states to 6483 states and 14342 transitions. [2019-11-15 21:59:17,644 INFO L78 Accepts]: Start accepts. Automaton has 6483 states and 14342 transitions. Word has length 95 [2019-11-15 21:59:17,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:17,645 INFO L462 AbstractCegarLoop]: Abstraction has 6483 states and 14342 transitions. [2019-11-15 21:59:17,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:59:17,645 INFO L276 IsEmpty]: Start isEmpty. Operand 6483 states and 14342 transitions. [2019-11-15 21:59:17,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:59:17,653 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:59:17,654 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:17,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:17,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1273909616, now seen corresponding path program 1 times [2019-11-15 21:59:17,654 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:17,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346985309] [2019-11-15 21:59:17,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:17,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:17,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:17,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346985309] [2019-11-15 21:59:17,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:17,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:59:17,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340194307] [2019-11-15 21:59:17,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:59:17,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:17,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:59:17,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:59:17,773 INFO L87 Difference]: Start difference. First operand 6483 states and 14342 transitions. Second operand 7 states. [2019-11-15 21:59:18,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:18,239 INFO L93 Difference]: Finished difference Result 7549 states and 16619 transitions. [2019-11-15 21:59:18,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:59:18,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-15 21:59:18,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:18,246 INFO L225 Difference]: With dead ends: 7549 [2019-11-15 21:59:18,246 INFO L226 Difference]: Without dead ends: 7549 [2019-11-15 21:59:18,246 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:59:18,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7549 states. [2019-11-15 21:59:18,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7549 to 6458. [2019-11-15 21:59:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6458 states. [2019-11-15 21:59:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6458 states to 6458 states and 14311 transitions. [2019-11-15 21:59:18,322 INFO L78 Accepts]: Start accepts. Automaton has 6458 states and 14311 transitions. Word has length 95 [2019-11-15 21:59:18,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:18,322 INFO L462 AbstractCegarLoop]: Abstraction has 6458 states and 14311 transitions. [2019-11-15 21:59:18,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:59:18,322 INFO L276 IsEmpty]: Start isEmpty. Operand 6458 states and 14311 transitions. [2019-11-15 21:59:18,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:59:18,328 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:18,328 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:59:18,328 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:18,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:18,329 INFO L82 PathProgramCache]: Analyzing trace with hash -375737808, now seen corresponding path program 1 times [2019-11-15 21:59:18,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:18,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30112482] [2019-11-15 21:59:18,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:18,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:18,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:18,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:18,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30112482] [2019-11-15 21:59:18,414 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:18,415 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:59:18,415 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101188638] [2019-11-15 21:59:18,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:59:18,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:18,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:59:18,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:59:18,416 INFO L87 Difference]: Start difference. First operand 6458 states and 14311 transitions. Second operand 6 states. [2019-11-15 21:59:18,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:18,939 INFO L93 Difference]: Finished difference Result 8084 states and 17790 transitions. [2019-11-15 21:59:18,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:59:18,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-15 21:59:18,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:18,949 INFO L225 Difference]: With dead ends: 8084 [2019-11-15 21:59:18,949 INFO L226 Difference]: Without dead ends: 8084 [2019-11-15 21:59:18,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:59:18,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8084 states. [2019-11-15 21:59:19,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8084 to 6397. [2019-11-15 21:59:19,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6397 states. [2019-11-15 21:59:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6397 states to 6397 states and 14167 transitions. [2019-11-15 21:59:19,051 INFO L78 Accepts]: Start accepts. Automaton has 6397 states and 14167 transitions. Word has length 95 [2019-11-15 21:59:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:19,052 INFO L462 AbstractCegarLoop]: Abstraction has 6397 states and 14167 transitions. [2019-11-15 21:59:19,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:59:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand 6397 states and 14167 transitions. [2019-11-15 21:59:19,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:59:19,061 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:19,061 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:59:19,061 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:19,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:19,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1853336272, now seen corresponding path program 1 times [2019-11-15 21:59:19,062 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:19,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985669829] [2019-11-15 21:59:19,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:19,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:19,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:19,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985669829] [2019-11-15 21:59:19,163 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:19,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:59:19,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740419834] [2019-11-15 21:59:19,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:59:19,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:19,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:59:19,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:59:19,164 INFO L87 Difference]: Start difference. First operand 6397 states and 14167 transitions. Second operand 7 states. [2019-11-15 21:59:19,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:19,581 INFO L93 Difference]: Finished difference Result 8309 states and 18287 transitions. [2019-11-15 21:59:19,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 21:59:19,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-15 21:59:19,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:19,589 INFO L225 Difference]: With dead ends: 8309 [2019-11-15 21:59:19,589 INFO L226 Difference]: Without dead ends: 8309 [2019-11-15 21:59:19,590 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:59:19,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8309 states. [2019-11-15 21:59:19,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8309 to 7405. [2019-11-15 21:59:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7405 states. [2019-11-15 21:59:19,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7405 states to 7405 states and 16361 transitions. [2019-11-15 21:59:19,673 INFO L78 Accepts]: Start accepts. Automaton has 7405 states and 16361 transitions. Word has length 95 [2019-11-15 21:59:19,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:19,673 INFO L462 AbstractCegarLoop]: Abstraction has 7405 states and 16361 transitions. [2019-11-15 21:59:19,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:59:19,673 INFO L276 IsEmpty]: Start isEmpty. Operand 7405 states and 16361 transitions. [2019-11-15 21:59:19,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:59:19,679 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:19,680 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:59:19,680 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:19,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:19,680 INFO L82 PathProgramCache]: Analyzing trace with hash -454149264, now seen corresponding path program 1 times [2019-11-15 21:59:19,680 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:19,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059158968] [2019-11-15 21:59:19,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:19,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:19,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:19,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:19,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059158968] [2019-11-15 21:59:19,838 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:19,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 21:59:19,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065283121] [2019-11-15 21:59:19,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 21:59:19,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:19,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:59:19,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:59:19,839 INFO L87 Difference]: Start difference. First operand 7405 states and 16361 transitions. Second operand 10 states. [2019-11-15 21:59:20,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:20,809 INFO L93 Difference]: Finished difference Result 8887 states and 19424 transitions. [2019-11-15 21:59:20,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 21:59:20,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-11-15 21:59:20,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:20,817 INFO L225 Difference]: With dead ends: 8887 [2019-11-15 21:59:20,817 INFO L226 Difference]: Without dead ends: 8887 [2019-11-15 21:59:20,817 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:59:20,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8887 states. [2019-11-15 21:59:20,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 7704. [2019-11-15 21:59:20,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7704 states. [2019-11-15 21:59:20,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7704 states to 7704 states and 17001 transitions. [2019-11-15 21:59:20,903 INFO L78 Accepts]: Start accepts. Automaton has 7704 states and 17001 transitions. Word has length 95 [2019-11-15 21:59:20,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:20,903 INFO L462 AbstractCegarLoop]: Abstraction has 7704 states and 17001 transitions. [2019-11-15 21:59:20,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 21:59:20,903 INFO L276 IsEmpty]: Start isEmpty. Operand 7704 states and 17001 transitions. [2019-11-15 21:59:20,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:59:20,909 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:20,909 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:59:20,910 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:20,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:20,910 INFO L82 PathProgramCache]: Analyzing trace with hash -242798351, now seen corresponding path program 1 times [2019-11-15 21:59:20,910 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:20,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556603973] [2019-11-15 21:59:20,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:20,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:20,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:21,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556603973] [2019-11-15 21:59:21,048 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:21,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:59:21,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778666839] [2019-11-15 21:59:21,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:59:21,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:21,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:59:21,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:59:21,050 INFO L87 Difference]: Start difference. First operand 7704 states and 17001 transitions. Second operand 7 states. [2019-11-15 21:59:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:21,158 INFO L93 Difference]: Finished difference Result 12511 states and 27798 transitions. [2019-11-15 21:59:21,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:59:21,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-15 21:59:21,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:21,164 INFO L225 Difference]: With dead ends: 12511 [2019-11-15 21:59:21,164 INFO L226 Difference]: Without dead ends: 5030 [2019-11-15 21:59:21,165 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:59:21,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5030 states. [2019-11-15 21:59:21,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5030 to 5030. [2019-11-15 21:59:21,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5030 states. [2019-11-15 21:59:21,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5030 states to 5030 states and 11221 transitions. [2019-11-15 21:59:21,231 INFO L78 Accepts]: Start accepts. Automaton has 5030 states and 11221 transitions. Word has length 95 [2019-11-15 21:59:21,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:21,231 INFO L462 AbstractCegarLoop]: Abstraction has 5030 states and 11221 transitions. [2019-11-15 21:59:21,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:59:21,232 INFO L276 IsEmpty]: Start isEmpty. Operand 5030 states and 11221 transitions. [2019-11-15 21:59:21,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:59:21,238 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:21,238 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:59:21,238 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:21,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:21,239 INFO L82 PathProgramCache]: Analyzing trace with hash 452007847, now seen corresponding path program 2 times [2019-11-15 21:59:21,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:21,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999895735] [2019-11-15 21:59:21,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:21,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:21,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:59:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:59:21,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999895735] [2019-11-15 21:59:21,386 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:59:21,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 21:59:21,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492938929] [2019-11-15 21:59:21,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 21:59:21,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:59:21,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:59:21,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:59:21,388 INFO L87 Difference]: Start difference. First operand 5030 states and 11221 transitions. Second operand 10 states. [2019-11-15 21:59:21,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:59:21,700 INFO L93 Difference]: Finished difference Result 9854 states and 22244 transitions. [2019-11-15 21:59:21,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 21:59:21,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-11-15 21:59:21,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:59:21,706 INFO L225 Difference]: With dead ends: 9854 [2019-11-15 21:59:21,707 INFO L226 Difference]: Without dead ends: 6395 [2019-11-15 21:59:21,707 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:59:21,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6395 states. [2019-11-15 21:59:21,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6395 to 5011. [2019-11-15 21:59:21,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5011 states. [2019-11-15 21:59:21,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5011 states to 5011 states and 11142 transitions. [2019-11-15 21:59:21,763 INFO L78 Accepts]: Start accepts. Automaton has 5011 states and 11142 transitions. Word has length 95 [2019-11-15 21:59:21,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:59:21,763 INFO L462 AbstractCegarLoop]: Abstraction has 5011 states and 11142 transitions. [2019-11-15 21:59:21,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 21:59:21,763 INFO L276 IsEmpty]: Start isEmpty. Operand 5011 states and 11142 transitions. [2019-11-15 21:59:21,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:59:21,767 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:59:21,767 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:59:21,768 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:59:21,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:59:21,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1562696987, now seen corresponding path program 3 times [2019-11-15 21:59:21,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:59:21,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449545956] [2019-11-15 21:59:21,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:21,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:59:21,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:59:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:59:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:59:21,848 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:59:21,848 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 21:59:21,992 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 21:59:21,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:59:21 BasicIcfg [2019-11-15 21:59:21,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:59:21,995 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:59:21,995 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:59:21,995 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:59:21,996 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:58:43" (3/4) ... [2019-11-15 21:59:21,998 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 21:59:22,119 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bcf64206-c098-4dcc-a4ea-c017c49c457e/bin/uautomizer/witness.graphml [2019-11-15 21:59:22,119 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:59:22,121 INFO L168 Benchmark]: Toolchain (without parser) took 40177.15 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.9 GB). Free memory was 947.4 MB in the beginning and 1.5 GB in the end (delta: -584.2 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-11-15 21:59:22,122 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:59:22,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 664.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -201.4 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:59:22,123 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.97 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:59:22,123 INFO L168 Benchmark]: Boogie Preprocessor took 58.86 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 21:59:22,123 INFO L168 Benchmark]: RCFGBuilder took 859.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:59:22,124 INFO L168 Benchmark]: TraceAbstraction took 38396.72 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -454.6 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-11-15 21:59:22,124 INFO L168 Benchmark]: Witness Printer took 124.70 ms. Allocated memory is still 3.9 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:59:22,126 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 664.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -201.4 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.97 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.86 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 859.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38396.72 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -454.6 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 124.70 ms. Allocated memory is still 3.9 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L707] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L708] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L709] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L710] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L711] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L712] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L713] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L714] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L715] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L716] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L717] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L718] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 pthread_t t589; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] FCALL, FORK 0 pthread_create(&t589, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L798] 0 pthread_t t590; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] FCALL, FORK 0 pthread_create(&t590, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=1, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=2, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L768] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=3, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=3, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y = y$flush_delayed ? y$mem_tmp : y [L771] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L774] 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) [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 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 [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 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 [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] 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) [L806] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] 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 [L808] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L809] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 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 [L812] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 218 locations, 3 error locations. Result: UNSAFE, OverallTime: 38.2s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 19.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8953 SDtfs, 10154 SDslu, 22309 SDs, 0 SdLazy, 9503 SolverSat, 530 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 367 GetRequests, 99 SyntacticMatches, 22 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59948occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.9s AutomataMinimizationTime, 33 MinimizatonAttempts, 66412 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2551 NumberOfCodeBlocks, 2551 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2423 ConstructedInterpolants, 0 QuantifiedInterpolants, 544069 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...