./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe022_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_413d8e31-7acd-4e55-a915-978b5ed04b58/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_413d8e31-7acd-4e55-a915-978b5ed04b58/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_413d8e31-7acd-4e55-a915-978b5ed04b58/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_413d8e31-7acd-4e55-a915-978b5ed04b58/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe022_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_413d8e31-7acd-4e55-a915-978b5ed04b58/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_413d8e31-7acd-4e55-a915-978b5ed04b58/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 2fa71a90f4c91b6cfeb7876c22d2062c916ad64c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:25:30,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:25:30,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:25:30,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:25:30,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:25:30,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:25:30,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:25:30,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:25:30,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:25:30,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:25:30,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:25:30,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:25:30,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:25:30,051 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:25:30,052 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:25:30,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:25:30,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:25:30,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:25:30,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:25:30,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:25:30,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:25:30,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:25:30,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:25:30,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:25:30,064 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:25:30,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:25:30,065 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:25:30,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:25:30,066 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:25:30,067 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:25:30,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:25:30,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:25:30,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:25:30,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:25:30,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:25:30,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:25:30,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:25:30,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:25:30,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:25:30,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:25:30,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:25:30,074 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_413d8e31-7acd-4e55-a915-978b5ed04b58/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:25:30,087 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:25:30,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:25:30,088 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:25:30,089 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:25:30,089 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:25:30,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:25:30,089 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:25:30,090 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:25:30,090 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:25:30,090 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:25:30,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:25:30,091 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:25:30,091 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:25:30,091 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:25:30,091 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:25:30,092 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:25:30,092 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:25:30,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:25:30,092 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:25:30,093 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:25:30,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:25:30,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:25:30,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:25:30,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:25:30,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:25:30,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:25:30,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:25:30,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:25:30,095 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_413d8e31-7acd-4e55-a915-978b5ed04b58/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 -> 2fa71a90f4c91b6cfeb7876c22d2062c916ad64c [2019-11-15 21:25:30,120 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:25:30,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:25:30,137 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:25:30,138 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:25:30,139 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:25:30,139 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_413d8e31-7acd-4e55-a915-978b5ed04b58/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe022_pso.opt.i [2019-11-15 21:25:30,190 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_413d8e31-7acd-4e55-a915-978b5ed04b58/bin/uautomizer/data/691a5a470/4b3463257e76499eb6ec942065e97665/FLAGfa5b7e499 [2019-11-15 21:25:30,659 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:25:30,660 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_413d8e31-7acd-4e55-a915-978b5ed04b58/sv-benchmarks/c/pthread-wmm/safe022_pso.opt.i [2019-11-15 21:25:30,700 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_413d8e31-7acd-4e55-a915-978b5ed04b58/bin/uautomizer/data/691a5a470/4b3463257e76499eb6ec942065e97665/FLAGfa5b7e499 [2019-11-15 21:25:31,207 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_413d8e31-7acd-4e55-a915-978b5ed04b58/bin/uautomizer/data/691a5a470/4b3463257e76499eb6ec942065e97665 [2019-11-15 21:25:31,210 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:25:31,211 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:25:31,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:25:31,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:25:31,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:25:31,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:25:31" (1/1) ... [2019-11-15 21:25:31,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b5c9813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:25:31, skipping insertion in model container [2019-11-15 21:25:31,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:25:31" (1/1) ... [2019-11-15 21:25:31,227 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:25:31,275 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:25:31,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:25:31,753 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:25:31,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:25:31,893 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:25:31,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:25:31 WrapperNode [2019-11-15 21:25:31,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:25:31,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:25:31,895 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:25:31,895 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:25:31,901 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:25:31" (1/1) ... [2019-11-15 21:25:31,916 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:25:31" (1/1) ... [2019-11-15 21:25:31,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:25:31,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:25:31,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:25:31,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:25:31,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:25:31" (1/1) ... [2019-11-15 21:25:31,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:25:31" (1/1) ... [2019-11-15 21:25:31,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:25:31" (1/1) ... [2019-11-15 21:25:31,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:25:31" (1/1) ... [2019-11-15 21:25:31,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:25:31" (1/1) ... [2019-11-15 21:25:31,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:25:31" (1/1) ... [2019-11-15 21:25:31,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:25:31" (1/1) ... [2019-11-15 21:25:31,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:25:31,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:25:31,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:25:31,980 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:25:31,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:25:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_413d8e31-7acd-4e55-a915-978b5ed04b58/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:25:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:25:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 21:25:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:25:32,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:25:32,061 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 21:25:32,061 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 21:25:32,061 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 21:25:32,061 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 21:25:32,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 21:25:32,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:25:32,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:25:32,063 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:25:32,697 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:25:32,697 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 21:25:32,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:25:32 BoogieIcfgContainer [2019-11-15 21:25:32,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:25:32,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:25:32,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:25:32,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:25:32,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:25:31" (1/3) ... [2019-11-15 21:25:32,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13bb621e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:25:32, skipping insertion in model container [2019-11-15 21:25:32,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:25:31" (2/3) ... [2019-11-15 21:25:32,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13bb621e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:25:32, skipping insertion in model container [2019-11-15 21:25:32,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:25:32" (3/3) ... [2019-11-15 21:25:32,705 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_pso.opt.i [2019-11-15 21:25:32,766 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,767 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,767 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,767 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,767 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,767 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:25:32,768 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,768 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,768 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,768 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,768 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,768 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,768 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,769 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,769 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,769 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,769 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,769 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,769 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,769 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,769 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,770 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,770 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,770 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,770 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,770 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,770 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,771 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,771 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,771 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,771 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,771 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,772 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,772 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,773 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,773 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,773 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,773 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,773 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,773 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,774 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,774 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,774 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,774 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,774 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,775 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,775 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,775 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,775 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,775 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,776 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,776 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,776 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,776 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,776 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,776 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,777 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,777 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,777 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,777 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,777 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,778 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,778 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,778 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,778 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,778 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,778 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,779 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,779 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,779 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,779 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,779 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,780 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,780 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,780 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,780 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,780 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,780 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,781 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,781 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,781 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,781 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,781 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,782 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,782 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,782 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,782 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,782 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,782 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,783 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,783 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,783 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,783 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,783 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,784 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,784 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,784 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,784 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,784 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,785 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,785 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,785 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,785 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,785 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,786 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,786 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,786 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,786 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,786 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,787 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,787 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,787 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,787 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,787 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,787 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,788 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,788 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,788 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,788 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,788 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,789 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,789 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,789 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,789 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,789 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,789 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,790 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,790 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,790 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,790 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,790 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,791 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,791 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,791 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,791 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,791 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,792 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,792 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,792 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,792 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,792 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,793 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,793 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,793 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,793 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,793 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,793 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,794 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,794 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,794 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,794 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,794 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:25:32,800 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 21:25:32,800 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:25:32,807 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 21:25:32,816 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 21:25:32,834 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:25:32,834 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:25:32,834 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:25:32,835 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:25:32,835 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:25:32,835 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:25:32,835 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:25:32,835 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:25:32,847 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 178 transitions [2019-11-15 21:25:35,479 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32590 states. [2019-11-15 21:25:35,480 INFO L276 IsEmpty]: Start isEmpty. Operand 32590 states. [2019-11-15 21:25:35,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 21:25:35,488 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:25:35,489 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:25:35,491 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:25:35,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:25:35,496 INFO L82 PathProgramCache]: Analyzing trace with hash -254800073, now seen corresponding path program 1 times [2019-11-15 21:25:35,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:25:35,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979260813] [2019-11-15 21:25:35,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:35,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:35,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:25:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:25:35,763 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:25:35,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979260813] [2019-11-15 21:25:35,771 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:25:35,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:25:35,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870955269] [2019-11-15 21:25:35,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:25:35,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:25:35,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:25:35,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:25:35,794 INFO L87 Difference]: Start difference. First operand 32590 states. Second operand 4 states. [2019-11-15 21:25:36,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:25:36,696 INFO L93 Difference]: Finished difference Result 33590 states and 129567 transitions. [2019-11-15 21:25:36,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:25:36,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-15 21:25:36,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:25:36,966 INFO L225 Difference]: With dead ends: 33590 [2019-11-15 21:25:36,966 INFO L226 Difference]: Without dead ends: 25702 [2019-11-15 21:25:36,968 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:25:37,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2019-11-15 21:25:38,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 25702. [2019-11-15 21:25:38,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25702 states. [2019-11-15 21:25:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25702 states to 25702 states and 99583 transitions. [2019-11-15 21:25:38,662 INFO L78 Accepts]: Start accepts. Automaton has 25702 states and 99583 transitions. Word has length 33 [2019-11-15 21:25:38,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:25:38,665 INFO L462 AbstractCegarLoop]: Abstraction has 25702 states and 99583 transitions. [2019-11-15 21:25:38,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:25:38,665 INFO L276 IsEmpty]: Start isEmpty. Operand 25702 states and 99583 transitions. [2019-11-15 21:25:38,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 21:25:38,680 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:25:38,681 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:25:38,681 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:25:38,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:25:38,682 INFO L82 PathProgramCache]: Analyzing trace with hash -250081261, now seen corresponding path program 1 times [2019-11-15 21:25:38,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:25:38,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844159481] [2019-11-15 21:25:38,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:38,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:38,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:25:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:25:38,865 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:25:38,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844159481] [2019-11-15 21:25:38,866 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:25:38,866 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:25:38,866 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417686368] [2019-11-15 21:25:38,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:25:38,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:25:38,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:25:38,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:25:38,869 INFO L87 Difference]: Start difference. First operand 25702 states and 99583 transitions. Second operand 5 states. [2019-11-15 21:25:40,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:25:40,067 INFO L93 Difference]: Finished difference Result 41080 states and 150430 transitions. [2019-11-15 21:25:40,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:25:40,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-15 21:25:40,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:25:40,244 INFO L225 Difference]: With dead ends: 41080 [2019-11-15 21:25:40,245 INFO L226 Difference]: Without dead ends: 40544 [2019-11-15 21:25:40,246 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:25:40,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40544 states. [2019-11-15 21:25:41,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40544 to 38924. [2019-11-15 21:25:41,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38924 states. [2019-11-15 21:25:41,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38924 states to 38924 states and 143580 transitions. [2019-11-15 21:25:41,789 INFO L78 Accepts]: Start accepts. Automaton has 38924 states and 143580 transitions. Word has length 45 [2019-11-15 21:25:41,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:25:41,799 INFO L462 AbstractCegarLoop]: Abstraction has 38924 states and 143580 transitions. [2019-11-15 21:25:41,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:25:41,800 INFO L276 IsEmpty]: Start isEmpty. Operand 38924 states and 143580 transitions. [2019-11-15 21:25:41,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 21:25:41,809 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:25:41,809 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:25:41,810 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:25:41,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:25:41,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1037182150, now seen corresponding path program 1 times [2019-11-15 21:25:41,810 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:25:41,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042581217] [2019-11-15 21:25:41,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:41,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:41,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:25:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:25:41,941 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:25:41,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042581217] [2019-11-15 21:25:41,941 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:25:41,941 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:25:41,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747185771] [2019-11-15 21:25:41,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:25:41,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:25:41,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:25:41,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:25:41,943 INFO L87 Difference]: Start difference. First operand 38924 states and 143580 transitions. Second operand 5 states. [2019-11-15 21:25:42,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:25:42,566 INFO L93 Difference]: Finished difference Result 49777 states and 180632 transitions. [2019-11-15 21:25:42,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:25:42,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-15 21:25:42,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:25:42,878 INFO L225 Difference]: With dead ends: 49777 [2019-11-15 21:25:42,878 INFO L226 Difference]: Without dead ends: 49273 [2019-11-15 21:25:42,879 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:25:43,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49273 states. [2019-11-15 21:25:44,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49273 to 42676. [2019-11-15 21:25:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42676 states. [2019-11-15 21:25:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42676 states to 42676 states and 156591 transitions. [2019-11-15 21:25:44,708 INFO L78 Accepts]: Start accepts. Automaton has 42676 states and 156591 transitions. Word has length 46 [2019-11-15 21:25:44,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:25:44,708 INFO L462 AbstractCegarLoop]: Abstraction has 42676 states and 156591 transitions. [2019-11-15 21:25:44,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:25:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 42676 states and 156591 transitions. [2019-11-15 21:25:44,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 21:25:44,716 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:25:44,717 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:25:44,717 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:25:44,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:25:44,718 INFO L82 PathProgramCache]: Analyzing trace with hash 671596896, now seen corresponding path program 1 times [2019-11-15 21:25:44,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:25:44,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515558206] [2019-11-15 21:25:44,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:44,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:44,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:25:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:25:44,758 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:25:44,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515558206] [2019-11-15 21:25:44,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:25:44,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:25:44,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127458742] [2019-11-15 21:25:44,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:25:44,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:25:44,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:25:44,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:25:44,760 INFO L87 Difference]: Start difference. First operand 42676 states and 156591 transitions. Second operand 3 states. [2019-11-15 21:25:45,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:25:45,010 INFO L93 Difference]: Finished difference Result 61086 states and 221429 transitions. [2019-11-15 21:25:45,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:25:45,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-15 21:25:45,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:25:45,164 INFO L225 Difference]: With dead ends: 61086 [2019-11-15 21:25:45,164 INFO L226 Difference]: Without dead ends: 61086 [2019-11-15 21:25:45,164 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:25:45,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61086 states. [2019-11-15 21:25:46,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61086 to 48015. [2019-11-15 21:25:46,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48015 states. [2019-11-15 21:25:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48015 states to 48015 states and 174178 transitions. [2019-11-15 21:25:46,870 INFO L78 Accepts]: Start accepts. Automaton has 48015 states and 174178 transitions. Word has length 48 [2019-11-15 21:25:46,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:25:46,871 INFO L462 AbstractCegarLoop]: Abstraction has 48015 states and 174178 transitions. [2019-11-15 21:25:46,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:25:46,871 INFO L276 IsEmpty]: Start isEmpty. Operand 48015 states and 174178 transitions. [2019-11-15 21:25:46,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 21:25:46,885 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:25:46,886 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:25:46,886 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:25:46,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:25:46,886 INFO L82 PathProgramCache]: Analyzing trace with hash -934557998, now seen corresponding path program 1 times [2019-11-15 21:25:46,887 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:25:46,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785207010] [2019-11-15 21:25:46,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:46,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:46,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:25:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:25:47,040 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:25:47,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785207010] [2019-11-15 21:25:47,041 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:25:47,041 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:25:47,041 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528300306] [2019-11-15 21:25:47,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:25:47,042 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:25:47,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:25:47,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:25:47,043 INFO L87 Difference]: Start difference. First operand 48015 states and 174178 transitions. Second operand 6 states. [2019-11-15 21:25:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:25:47,951 INFO L93 Difference]: Finished difference Result 63755 states and 229378 transitions. [2019-11-15 21:25:47,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:25:47,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 21:25:47,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:25:48,081 INFO L225 Difference]: With dead ends: 63755 [2019-11-15 21:25:48,081 INFO L226 Difference]: Without dead ends: 63755 [2019-11-15 21:25:48,081 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:25:48,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63755 states. [2019-11-15 21:25:52,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63755 to 59948. [2019-11-15 21:25:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59948 states. [2019-11-15 21:25:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59948 states to 59948 states and 215671 transitions. [2019-11-15 21:25:53,042 INFO L78 Accepts]: Start accepts. Automaton has 59948 states and 215671 transitions. Word has length 52 [2019-11-15 21:25:53,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:25:53,042 INFO L462 AbstractCegarLoop]: Abstraction has 59948 states and 215671 transitions. [2019-11-15 21:25:53,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:25:53,042 INFO L276 IsEmpty]: Start isEmpty. Operand 59948 states and 215671 transitions. [2019-11-15 21:25:53,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 21:25:53,060 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:25:53,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] [2019-11-15 21:25:53,061 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:25:53,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:25:53,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1563457939, now seen corresponding path program 1 times [2019-11-15 21:25:53,062 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:25:53,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055450945] [2019-11-15 21:25:53,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:53,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:53,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:25:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:25:53,167 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:25:53,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055450945] [2019-11-15 21:25:53,168 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:25:53,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:25:53,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966164252] [2019-11-15 21:25:53,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:25:53,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:25:53,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:25:53,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:25:53,169 INFO L87 Difference]: Start difference. First operand 59948 states and 215671 transitions. Second operand 7 states. [2019-11-15 21:25:54,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:25:54,324 INFO L93 Difference]: Finished difference Result 83684 states and 290096 transitions. [2019-11-15 21:25:54,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:25:54,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-15 21:25:54,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:25:54,474 INFO L225 Difference]: With dead ends: 83684 [2019-11-15 21:25:54,475 INFO L226 Difference]: Without dead ends: 83684 [2019-11-15 21:25:54,475 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:25:54,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83684 states. [2019-11-15 21:25:56,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83684 to 71011. [2019-11-15 21:25:56,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71011 states. [2019-11-15 21:25:56,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71011 states to 71011 states and 249885 transitions. [2019-11-15 21:25:56,375 INFO L78 Accepts]: Start accepts. Automaton has 71011 states and 249885 transitions. Word has length 52 [2019-11-15 21:25:56,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:25:56,375 INFO L462 AbstractCegarLoop]: Abstraction has 71011 states and 249885 transitions. [2019-11-15 21:25:56,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:25:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 71011 states and 249885 transitions. [2019-11-15 21:25:56,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 21:25:56,390 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:25:56,391 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:25:56,391 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:25:56,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:25:56,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1844005676, now seen corresponding path program 1 times [2019-11-15 21:25:56,391 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:25:56,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570466988] [2019-11-15 21:25:56,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:56,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:56,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:25:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:25:56,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:25:56,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570466988] [2019-11-15 21:25:56,456 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:25:56,456 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:25:56,456 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208174001] [2019-11-15 21:25:56,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:25:56,457 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:25:56,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:25:56,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:25:56,457 INFO L87 Difference]: Start difference. First operand 71011 states and 249885 transitions. Second operand 4 states. [2019-11-15 21:25:56,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:25:56,526 INFO L93 Difference]: Finished difference Result 12158 states and 37828 transitions. [2019-11-15 21:25:56,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:25:56,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-15 21:25:56,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:25:56,545 INFO L225 Difference]: With dead ends: 12158 [2019-11-15 21:25:56,546 INFO L226 Difference]: Without dead ends: 10673 [2019-11-15 21:25:56,546 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:25:56,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10673 states. [2019-11-15 21:25:56,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10673 to 10624. [2019-11-15 21:25:56,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10624 states. [2019-11-15 21:25:56,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10624 states to 10624 states and 32590 transitions. [2019-11-15 21:25:56,695 INFO L78 Accepts]: Start accepts. Automaton has 10624 states and 32590 transitions. Word has length 52 [2019-11-15 21:25:56,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:25:56,695 INFO L462 AbstractCegarLoop]: Abstraction has 10624 states and 32590 transitions. [2019-11-15 21:25:56,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:25:56,696 INFO L276 IsEmpty]: Start isEmpty. Operand 10624 states and 32590 transitions. [2019-11-15 21:25:56,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 21:25:56,697 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:25:56,697 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:25:56,697 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:25:56,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:25:56,698 INFO L82 PathProgramCache]: Analyzing trace with hash -456832597, now seen corresponding path program 1 times [2019-11-15 21:25:56,698 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:25:56,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212397502] [2019-11-15 21:25:56,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:56,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:56,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:25:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:25:56,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:25:56,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212397502] [2019-11-15 21:25:56,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:25:56,778 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:25:56,778 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676108965] [2019-11-15 21:25:56,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:25:56,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:25:56,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:25:56,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:25:56,779 INFO L87 Difference]: Start difference. First operand 10624 states and 32590 transitions. Second operand 6 states. [2019-11-15 21:25:57,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:25:57,136 INFO L93 Difference]: Finished difference Result 13181 states and 39871 transitions. [2019-11-15 21:25:57,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:25:57,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 21:25:57,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:25:57,152 INFO L225 Difference]: With dead ends: 13181 [2019-11-15 21:25:57,152 INFO L226 Difference]: Without dead ends: 13118 [2019-11-15 21:25:57,153 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:25:57,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13118 states. [2019-11-15 21:25:57,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13118 to 11047. [2019-11-15 21:25:57,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11047 states. [2019-11-15 21:25:57,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11047 states to 11047 states and 33784 transitions. [2019-11-15 21:25:57,297 INFO L78 Accepts]: Start accepts. Automaton has 11047 states and 33784 transitions. Word has length 52 [2019-11-15 21:25:57,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:25:57,297 INFO L462 AbstractCegarLoop]: Abstraction has 11047 states and 33784 transitions. [2019-11-15 21:25:57,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:25:57,297 INFO L276 IsEmpty]: Start isEmpty. Operand 11047 states and 33784 transitions. [2019-11-15 21:25:57,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 21:25:57,300 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:25:57,300 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:25:57,300 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:25:57,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:25:57,301 INFO L82 PathProgramCache]: Analyzing trace with hash -257891193, now seen corresponding path program 1 times [2019-11-15 21:25:57,301 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:25:57,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293856556] [2019-11-15 21:25:57,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:57,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:57,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:25:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:25:57,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:25:57,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293856556] [2019-11-15 21:25:57,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:25:57,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:25:57,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358931058] [2019-11-15 21:25:57,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:25:57,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:25:57,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:25:57,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:25:57,354 INFO L87 Difference]: Start difference. First operand 11047 states and 33784 transitions. Second operand 4 states. [2019-11-15 21:25:57,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:25:57,502 INFO L93 Difference]: Finished difference Result 12861 states and 39390 transitions. [2019-11-15 21:25:57,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:25:57,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 21:25:57,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:25:57,525 INFO L225 Difference]: With dead ends: 12861 [2019-11-15 21:25:57,526 INFO L226 Difference]: Without dead ends: 12861 [2019-11-15 21:25:57,526 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:25:57,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-11-15 21:25:57,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 11692. [2019-11-15 21:25:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11692 states. [2019-11-15 21:25:57,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11692 states to 11692 states and 35761 transitions. [2019-11-15 21:25:57,778 INFO L78 Accepts]: Start accepts. Automaton has 11692 states and 35761 transitions. Word has length 60 [2019-11-15 21:25:57,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:25:57,779 INFO L462 AbstractCegarLoop]: Abstraction has 11692 states and 35761 transitions. [2019-11-15 21:25:57,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:25:57,779 INFO L276 IsEmpty]: Start isEmpty. Operand 11692 states and 35761 transitions. [2019-11-15 21:25:57,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 21:25:57,784 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:25:57,784 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:25:57,784 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:25:57,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:25:57,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1484919142, now seen corresponding path program 1 times [2019-11-15 21:25:57,785 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:25:57,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612155571] [2019-11-15 21:25:57,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:57,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:57,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:25:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:25:57,845 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:25:57,845 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612155571] [2019-11-15 21:25:57,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:25:57,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:25:57,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962494399] [2019-11-15 21:25:57,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:25:57,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:25:57,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:25:57,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:25:57,847 INFO L87 Difference]: Start difference. First operand 11692 states and 35761 transitions. Second operand 6 states. [2019-11-15 21:25:58,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:25:58,236 INFO L93 Difference]: Finished difference Result 14218 states and 42859 transitions. [2019-11-15 21:25:58,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:25:58,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-15 21:25:58,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:25:58,254 INFO L225 Difference]: With dead ends: 14218 [2019-11-15 21:25:58,255 INFO L226 Difference]: Without dead ends: 14157 [2019-11-15 21:25:58,255 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:25:58,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14157 states. [2019-11-15 21:25:58,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14157 to 13460. [2019-11-15 21:25:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13460 states. [2019-11-15 21:25:58,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13460 states to 13460 states and 40778 transitions. [2019-11-15 21:25:58,422 INFO L78 Accepts]: Start accepts. Automaton has 13460 states and 40778 transitions. Word has length 60 [2019-11-15 21:25:58,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:25:58,423 INFO L462 AbstractCegarLoop]: Abstraction has 13460 states and 40778 transitions. [2019-11-15 21:25:58,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:25:58,423 INFO L276 IsEmpty]: Start isEmpty. Operand 13460 states and 40778 transitions. [2019-11-15 21:25:58,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 21:25:58,427 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:25:58,428 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:25:58,428 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:25:58,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:25:58,428 INFO L82 PathProgramCache]: Analyzing trace with hash -266986464, now seen corresponding path program 1 times [2019-11-15 21:25:58,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:25:58,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682217175] [2019-11-15 21:25:58,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:58,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:58,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:25:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:25:58,484 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:25:58,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682217175] [2019-11-15 21:25:58,485 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:25:58,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:25:58,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723680553] [2019-11-15 21:25:58,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:25:58,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:25:58,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:25:58,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:25:58,486 INFO L87 Difference]: Start difference. First operand 13460 states and 40778 transitions. Second operand 4 states. [2019-11-15 21:25:58,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:25:58,792 INFO L93 Difference]: Finished difference Result 16502 states and 49370 transitions. [2019-11-15 21:25:58,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:25:58,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-15 21:25:58,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:25:58,814 INFO L225 Difference]: With dead ends: 16502 [2019-11-15 21:25:58,814 INFO L226 Difference]: Without dead ends: 16502 [2019-11-15 21:25:58,815 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:25:58,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16502 states. [2019-11-15 21:25:58,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16502 to 14981. [2019-11-15 21:25:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14981 states. [2019-11-15 21:25:59,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14981 states to 14981 states and 44959 transitions. [2019-11-15 21:25:59,016 INFO L78 Accepts]: Start accepts. Automaton has 14981 states and 44959 transitions. Word has length 64 [2019-11-15 21:25:59,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:25:59,016 INFO L462 AbstractCegarLoop]: Abstraction has 14981 states and 44959 transitions. [2019-11-15 21:25:59,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:25:59,016 INFO L276 IsEmpty]: Start isEmpty. Operand 14981 states and 44959 transitions. [2019-11-15 21:25:59,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 21:25:59,023 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:25:59,023 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:25:59,023 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:25:59,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:25:59,024 INFO L82 PathProgramCache]: Analyzing trace with hash 694627553, now seen corresponding path program 1 times [2019-11-15 21:25:59,024 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:25:59,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054722608] [2019-11-15 21:25:59,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:59,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:59,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:25:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:25:59,071 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:25:59,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054722608] [2019-11-15 21:25:59,071 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:25:59,071 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:25:59,072 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398976219] [2019-11-15 21:25:59,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:25:59,072 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:25:59,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:25:59,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:25:59,073 INFO L87 Difference]: Start difference. First operand 14981 states and 44959 transitions. Second operand 3 states. [2019-11-15 21:25:59,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:25:59,340 INFO L93 Difference]: Finished difference Result 15529 states and 46402 transitions. [2019-11-15 21:25:59,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:25:59,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-15 21:25:59,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:25:59,367 INFO L225 Difference]: With dead ends: 15529 [2019-11-15 21:25:59,367 INFO L226 Difference]: Without dead ends: 15529 [2019-11-15 21:25:59,367 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:25:59,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15529 states. [2019-11-15 21:25:59,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15529 to 15275. [2019-11-15 21:25:59,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15275 states. [2019-11-15 21:25:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15275 states to 15275 states and 45727 transitions. [2019-11-15 21:25:59,560 INFO L78 Accepts]: Start accepts. Automaton has 15275 states and 45727 transitions. Word has length 64 [2019-11-15 21:25:59,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:25:59,560 INFO L462 AbstractCegarLoop]: Abstraction has 15275 states and 45727 transitions. [2019-11-15 21:25:59,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:25:59,560 INFO L276 IsEmpty]: Start isEmpty. Operand 15275 states and 45727 transitions. [2019-11-15 21:25:59,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:25:59,568 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:25:59,568 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:25:59,568 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:25:59,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:25:59,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1438396840, now seen corresponding path program 1 times [2019-11-15 21:25:59,569 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:25:59,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796463575] [2019-11-15 21:25:59,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:59,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:25:59,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:25:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:25:59,699 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:25:59,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796463575] [2019-11-15 21:25:59,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:25:59,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:25:59,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853010382] [2019-11-15 21:25:59,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:25:59,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:25:59,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:25:59,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:25:59,701 INFO L87 Difference]: Start difference. First operand 15275 states and 45727 transitions. Second operand 6 states. [2019-11-15 21:26:00,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:00,202 INFO L93 Difference]: Finished difference Result 16272 states and 48102 transitions. [2019-11-15 21:26:00,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:26:00,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 21:26:00,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:00,224 INFO L225 Difference]: With dead ends: 16272 [2019-11-15 21:26:00,224 INFO L226 Difference]: Without dead ends: 16272 [2019-11-15 21:26:00,225 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:26:00,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16272 states. [2019-11-15 21:26:00,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16272 to 15848. [2019-11-15 21:26:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15848 states. [2019-11-15 21:26:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15848 states to 15848 states and 47024 transitions. [2019-11-15 21:26:00,433 INFO L78 Accepts]: Start accepts. Automaton has 15848 states and 47024 transitions. Word has length 66 [2019-11-15 21:26:00,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:00,433 INFO L462 AbstractCegarLoop]: Abstraction has 15848 states and 47024 transitions. [2019-11-15 21:26:00,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:26:00,434 INFO L276 IsEmpty]: Start isEmpty. Operand 15848 states and 47024 transitions. [2019-11-15 21:26:00,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:26:00,444 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:00,444 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:26:00,444 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:00,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:00,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1894956439, now seen corresponding path program 1 times [2019-11-15 21:26:00,445 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:00,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170131092] [2019-11-15 21:26:00,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:00,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:00,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:00,535 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:26:00,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170131092] [2019-11-15 21:26:00,535 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:00,535 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:26:00,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800260646] [2019-11-15 21:26:00,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:26:00,536 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:00,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:26:00,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:26:00,537 INFO L87 Difference]: Start difference. First operand 15848 states and 47024 transitions. Second operand 6 states. [2019-11-15 21:26:01,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:01,077 INFO L93 Difference]: Finished difference Result 18159 states and 52352 transitions. [2019-11-15 21:26:01,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:26:01,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 21:26:01,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:01,408 INFO L225 Difference]: With dead ends: 18159 [2019-11-15 21:26:01,409 INFO L226 Difference]: Without dead ends: 18159 [2019-11-15 21:26:01,412 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:26:01,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18159 states. [2019-11-15 21:26:01,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18159 to 16540. [2019-11-15 21:26:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16540 states. [2019-11-15 21:26:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16540 states to 16540 states and 48244 transitions. [2019-11-15 21:26:01,700 INFO L78 Accepts]: Start accepts. Automaton has 16540 states and 48244 transitions. Word has length 66 [2019-11-15 21:26:01,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:01,701 INFO L462 AbstractCegarLoop]: Abstraction has 16540 states and 48244 transitions. [2019-11-15 21:26:01,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:26:01,701 INFO L276 IsEmpty]: Start isEmpty. Operand 16540 states and 48244 transitions. [2019-11-15 21:26:01,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:26:01,715 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:01,716 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:26:01,716 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:01,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:01,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1683605526, now seen corresponding path program 1 times [2019-11-15 21:26:01,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:01,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40145771] [2019-11-15 21:26:01,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:01,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:01,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:01,816 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:26:01,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40145771] [2019-11-15 21:26:01,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:01,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:26:01,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48790967] [2019-11-15 21:26:01,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:26:01,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:01,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:26:01,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:26:01,819 INFO L87 Difference]: Start difference. First operand 16540 states and 48244 transitions. Second operand 5 states. [2019-11-15 21:26:02,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:02,310 INFO L93 Difference]: Finished difference Result 21454 states and 62484 transitions. [2019-11-15 21:26:02,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:26:02,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 21:26:02,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:02,338 INFO L225 Difference]: With dead ends: 21454 [2019-11-15 21:26:02,339 INFO L226 Difference]: Without dead ends: 21454 [2019-11-15 21:26:02,339 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:26:02,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21454 states. [2019-11-15 21:26:02,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21454 to 19519. [2019-11-15 21:26:02,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19519 states. [2019-11-15 21:26:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19519 states to 19519 states and 56653 transitions. [2019-11-15 21:26:02,607 INFO L78 Accepts]: Start accepts. Automaton has 19519 states and 56653 transitions. Word has length 66 [2019-11-15 21:26:02,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:02,607 INFO L462 AbstractCegarLoop]: Abstraction has 19519 states and 56653 transitions. [2019-11-15 21:26:02,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:26:02,607 INFO L276 IsEmpty]: Start isEmpty. Operand 19519 states and 56653 transitions. [2019-11-15 21:26:02,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:26:02,618 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:02,619 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:26:02,619 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:02,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:02,619 INFO L82 PathProgramCache]: Analyzing trace with hash 2100827593, now seen corresponding path program 1 times [2019-11-15 21:26:02,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:02,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120034956] [2019-11-15 21:26:02,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:02,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:02,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:02,670 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:26:02,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120034956] [2019-11-15 21:26:02,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:02,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:26:02,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865076322] [2019-11-15 21:26:02,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:26:02,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:02,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:26:02,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:26:02,672 INFO L87 Difference]: Start difference. First operand 19519 states and 56653 transitions. Second operand 4 states. [2019-11-15 21:26:03,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:03,194 INFO L93 Difference]: Finished difference Result 25534 states and 74547 transitions. [2019-11-15 21:26:03,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:26:03,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 21:26:03,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:03,230 INFO L225 Difference]: With dead ends: 25534 [2019-11-15 21:26:03,230 INFO L226 Difference]: Without dead ends: 25399 [2019-11-15 21:26:03,231 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:26:03,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25399 states. [2019-11-15 21:26:03,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25399 to 23515. [2019-11-15 21:26:03,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23515 states. [2019-11-15 21:26:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23515 states to 23515 states and 68665 transitions. [2019-11-15 21:26:03,548 INFO L78 Accepts]: Start accepts. Automaton has 23515 states and 68665 transitions. Word has length 66 [2019-11-15 21:26:03,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:03,548 INFO L462 AbstractCegarLoop]: Abstraction has 23515 states and 68665 transitions. [2019-11-15 21:26:03,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:26:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 23515 states and 68665 transitions. [2019-11-15 21:26:03,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:26:03,558 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:03,558 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:26:03,558 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:03,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:03,559 INFO L82 PathProgramCache]: Analyzing trace with hash -386685240, now seen corresponding path program 1 times [2019-11-15 21:26:03,559 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:03,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892536118] [2019-11-15 21:26:03,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:03,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:03,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:03,617 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:26:03,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892536118] [2019-11-15 21:26:03,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:03,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:26:03,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994925259] [2019-11-15 21:26:03,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:26:03,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:03,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:26:03,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:26:03,618 INFO L87 Difference]: Start difference. First operand 23515 states and 68665 transitions. Second operand 5 states. [2019-11-15 21:26:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:04,089 INFO L93 Difference]: Finished difference Result 31866 states and 92305 transitions. [2019-11-15 21:26:04,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:26:04,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 21:26:04,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:04,136 INFO L225 Difference]: With dead ends: 31866 [2019-11-15 21:26:04,136 INFO L226 Difference]: Without dead ends: 31746 [2019-11-15 21:26:04,136 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:26:04,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31746 states. [2019-11-15 21:26:04,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31746 to 25844. [2019-11-15 21:26:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25844 states. [2019-11-15 21:26:04,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25844 states to 25844 states and 75187 transitions. [2019-11-15 21:26:04,491 INFO L78 Accepts]: Start accepts. Automaton has 25844 states and 75187 transitions. Word has length 66 [2019-11-15 21:26:04,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:04,492 INFO L462 AbstractCegarLoop]: Abstraction has 25844 states and 75187 transitions. [2019-11-15 21:26:04,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:26:04,492 INFO L276 IsEmpty]: Start isEmpty. Operand 25844 states and 75187 transitions. [2019-11-15 21:26:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:26:04,499 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:04,499 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:26:04,499 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:04,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:04,499 INFO L82 PathProgramCache]: Analyzing trace with hash 303876234, now seen corresponding path program 1 times [2019-11-15 21:26:04,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:04,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427494720] [2019-11-15 21:26:04,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:04,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:04,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:04,621 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:26:04,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427494720] [2019-11-15 21:26:04,621 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:04,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:26:04,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119050061] [2019-11-15 21:26:04,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:26:04,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:04,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:26:04,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:26:04,622 INFO L87 Difference]: Start difference. First operand 25844 states and 75187 transitions. Second operand 7 states. [2019-11-15 21:26:05,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:05,072 INFO L93 Difference]: Finished difference Result 23112 states and 64209 transitions. [2019-11-15 21:26:05,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:26:05,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-11-15 21:26:05,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:05,098 INFO L225 Difference]: With dead ends: 23112 [2019-11-15 21:26:05,098 INFO L226 Difference]: Without dead ends: 23112 [2019-11-15 21:26:05,098 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:26:05,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23112 states. [2019-11-15 21:26:05,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23112 to 18808. [2019-11-15 21:26:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18808 states. [2019-11-15 21:26:05,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18808 states to 18808 states and 52244 transitions. [2019-11-15 21:26:05,324 INFO L78 Accepts]: Start accepts. Automaton has 18808 states and 52244 transitions. Word has length 66 [2019-11-15 21:26:05,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:05,325 INFO L462 AbstractCegarLoop]: Abstraction has 18808 states and 52244 transitions. [2019-11-15 21:26:05,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:26:05,325 INFO L276 IsEmpty]: Start isEmpty. Operand 18808 states and 52244 transitions. [2019-11-15 21:26:05,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:26:05,331 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:05,331 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:26:05,332 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:05,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:05,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1191379915, now seen corresponding path program 1 times [2019-11-15 21:26:05,332 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:05,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566333807] [2019-11-15 21:26:05,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:05,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:05,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:05,404 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:26:05,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566333807] [2019-11-15 21:26:05,404 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:05,404 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:26:05,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525252531] [2019-11-15 21:26:05,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:26:05,405 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:05,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:26:05,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:26:05,405 INFO L87 Difference]: Start difference. First operand 18808 states and 52244 transitions. Second operand 5 states. [2019-11-15 21:26:05,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:05,451 INFO L93 Difference]: Finished difference Result 6130 states and 14461 transitions. [2019-11-15 21:26:05,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:26:05,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 21:26:05,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:05,456 INFO L225 Difference]: With dead ends: 6130 [2019-11-15 21:26:05,456 INFO L226 Difference]: Without dead ends: 5260 [2019-11-15 21:26:05,456 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:26:05,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5260 states. [2019-11-15 21:26:05,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5260 to 4725. [2019-11-15 21:26:05,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-11-15 21:26:05,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 10820 transitions. [2019-11-15 21:26:05,500 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 10820 transitions. Word has length 66 [2019-11-15 21:26:05,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:05,500 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 10820 transitions. [2019-11-15 21:26:05,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:26:05,501 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 10820 transitions. [2019-11-15 21:26:05,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 21:26:05,504 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:05,504 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:26:05,504 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:05,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:05,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1738873321, now seen corresponding path program 1 times [2019-11-15 21:26:05,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:05,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229126888] [2019-11-15 21:26:05,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:05,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:05,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:05,549 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:26:05,549 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229126888] [2019-11-15 21:26:05,549 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:05,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:26:05,549 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182313786] [2019-11-15 21:26:05,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:26:05,550 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:05,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:26:05,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:26:05,551 INFO L87 Difference]: Start difference. First operand 4725 states and 10820 transitions. Second operand 3 states. [2019-11-15 21:26:05,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:05,595 INFO L93 Difference]: Finished difference Result 5855 states and 13186 transitions. [2019-11-15 21:26:05,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:26:05,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-15 21:26:05,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:05,601 INFO L225 Difference]: With dead ends: 5855 [2019-11-15 21:26:05,601 INFO L226 Difference]: Without dead ends: 5855 [2019-11-15 21:26:05,602 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:26:05,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5855 states. [2019-11-15 21:26:05,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5855 to 4660. [2019-11-15 21:26:05,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-11-15 21:26:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 10382 transitions. [2019-11-15 21:26:05,649 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 10382 transitions. Word has length 66 [2019-11-15 21:26:05,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:05,649 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 10382 transitions. [2019-11-15 21:26:05,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:26:05,649 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 10382 transitions. [2019-11-15 21:26:05,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 21:26:05,652 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:05,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] [2019-11-15 21:26:05,653 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:05,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:05,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1014352042, now seen corresponding path program 1 times [2019-11-15 21:26:05,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:05,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582814596] [2019-11-15 21:26:05,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:05,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:05,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:05,714 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:26:05,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582814596] [2019-11-15 21:26:05,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:05,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:26:05,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228239813] [2019-11-15 21:26:05,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:26:05,716 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:05,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:26:05,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:26:05,719 INFO L87 Difference]: Start difference. First operand 4660 states and 10382 transitions. Second operand 5 states. [2019-11-15 21:26:05,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:05,875 INFO L93 Difference]: Finished difference Result 5721 states and 12811 transitions. [2019-11-15 21:26:05,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:26:05,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-11-15 21:26:05,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:05,880 INFO L225 Difference]: With dead ends: 5721 [2019-11-15 21:26:05,880 INFO L226 Difference]: Without dead ends: 5721 [2019-11-15 21:26:05,880 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:26:05,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5721 states. [2019-11-15 21:26:05,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5721 to 5080. [2019-11-15 21:26:05,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5080 states. [2019-11-15 21:26:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5080 states to 5080 states and 11340 transitions. [2019-11-15 21:26:05,927 INFO L78 Accepts]: Start accepts. Automaton has 5080 states and 11340 transitions. Word has length 72 [2019-11-15 21:26:05,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:05,927 INFO L462 AbstractCegarLoop]: Abstraction has 5080 states and 11340 transitions. [2019-11-15 21:26:05,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:26:05,928 INFO L276 IsEmpty]: Start isEmpty. Operand 5080 states and 11340 transitions. [2019-11-15 21:26:05,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 21:26:05,931 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:05,931 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:26:05,932 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:05,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:05,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1537804919, now seen corresponding path program 1 times [2019-11-15 21:26:05,932 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:05,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412463185] [2019-11-15 21:26:05,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:05,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:05,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:06,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412463185] [2019-11-15 21:26:06,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:06,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:26:06,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891977631] [2019-11-15 21:26:06,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:26:06,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:06,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:26:06,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:26:06,043 INFO L87 Difference]: Start difference. First operand 5080 states and 11340 transitions. Second operand 7 states. [2019-11-15 21:26:06,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:06,414 INFO L93 Difference]: Finished difference Result 5820 states and 12863 transitions. [2019-11-15 21:26:06,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:26:06,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-11-15 21:26:06,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:06,419 INFO L225 Difference]: With dead ends: 5820 [2019-11-15 21:26:06,419 INFO L226 Difference]: Without dead ends: 5767 [2019-11-15 21:26:06,419 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:26:06,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5767 states. [2019-11-15 21:26:06,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5767 to 5167. [2019-11-15 21:26:06,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5167 states. [2019-11-15 21:26:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5167 states to 5167 states and 11429 transitions. [2019-11-15 21:26:06,467 INFO L78 Accepts]: Start accepts. Automaton has 5167 states and 11429 transitions. Word has length 72 [2019-11-15 21:26:06,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:06,467 INFO L462 AbstractCegarLoop]: Abstraction has 5167 states and 11429 transitions. [2019-11-15 21:26:06,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:26:06,467 INFO L276 IsEmpty]: Start isEmpty. Operand 5167 states and 11429 transitions. [2019-11-15 21:26:06,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 21:26:06,471 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:06,471 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:26:06,471 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:06,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:06,471 INFO L82 PathProgramCache]: Analyzing trace with hash 313645306, now seen corresponding path program 1 times [2019-11-15 21:26:06,471 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:06,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929775583] [2019-11-15 21:26:06,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:06,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:06,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:06,531 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:26:06,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929775583] [2019-11-15 21:26:06,531 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:06,531 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:26:06,532 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960731419] [2019-11-15 21:26:06,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:26:06,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:06,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:26:06,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:26:06,533 INFO L87 Difference]: Start difference. First operand 5167 states and 11429 transitions. Second operand 5 states. [2019-11-15 21:26:06,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:06,776 INFO L93 Difference]: Finished difference Result 6009 states and 13221 transitions. [2019-11-15 21:26:06,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:26:06,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-15 21:26:06,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:06,781 INFO L225 Difference]: With dead ends: 6009 [2019-11-15 21:26:06,781 INFO L226 Difference]: Without dead ends: 6009 [2019-11-15 21:26:06,781 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:26:06,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6009 states. [2019-11-15 21:26:06,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6009 to 5312. [2019-11-15 21:26:06,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5312 states. [2019-11-15 21:26:06,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5312 states to 5312 states and 11744 transitions. [2019-11-15 21:26:06,829 INFO L78 Accepts]: Start accepts. Automaton has 5312 states and 11744 transitions. Word has length 93 [2019-11-15 21:26:06,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:06,829 INFO L462 AbstractCegarLoop]: Abstraction has 5312 states and 11744 transitions. [2019-11-15 21:26:06,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:26:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 5312 states and 11744 transitions. [2019-11-15 21:26:06,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 21:26:06,834 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:06,834 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:26:06,835 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:06,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:06,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1223592850, now seen corresponding path program 1 times [2019-11-15 21:26:06,835 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:06,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170140155] [2019-11-15 21:26:06,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:06,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:06,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:06,900 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:26:06,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170140155] [2019-11-15 21:26:06,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:06,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:26:06,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677734122] [2019-11-15 21:26:06,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:26:06,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:06,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:26:06,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:26:06,901 INFO L87 Difference]: Start difference. First operand 5312 states and 11744 transitions. Second operand 4 states. [2019-11-15 21:26:06,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:06,984 INFO L93 Difference]: Finished difference Result 6275 states and 13793 transitions. [2019-11-15 21:26:06,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:26:06,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-15 21:26:06,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:06,991 INFO L225 Difference]: With dead ends: 6275 [2019-11-15 21:26:06,991 INFO L226 Difference]: Without dead ends: 6275 [2019-11-15 21:26:06,991 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:26:06,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6275 states. [2019-11-15 21:26:07,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6275 to 5506. [2019-11-15 21:26:07,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5506 states. [2019-11-15 21:26:07,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5506 states to 5506 states and 12150 transitions. [2019-11-15 21:26:07,043 INFO L78 Accepts]: Start accepts. Automaton has 5506 states and 12150 transitions. Word has length 93 [2019-11-15 21:26:07,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:07,043 INFO L462 AbstractCegarLoop]: Abstraction has 5506 states and 12150 transitions. [2019-11-15 21:26:07,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:26:07,044 INFO L276 IsEmpty]: Start isEmpty. Operand 5506 states and 12150 transitions. [2019-11-15 21:26:07,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:26:07,048 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:07,048 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:26:07,048 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:07,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:07,049 INFO L82 PathProgramCache]: Analyzing trace with hash -45263679, now seen corresponding path program 1 times [2019-11-15 21:26:07,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:07,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401192356] [2019-11-15 21:26:07,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:07,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:07,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:07,171 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:26:07,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401192356] [2019-11-15 21:26:07,172 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:07,172 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:26:07,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971555131] [2019-11-15 21:26:07,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:26:07,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:07,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:26:07,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:26:07,174 INFO L87 Difference]: Start difference. First operand 5506 states and 12150 transitions. Second operand 8 states. [2019-11-15 21:26:07,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:07,943 INFO L93 Difference]: Finished difference Result 7002 states and 15221 transitions. [2019-11-15 21:26:07,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 21:26:07,943 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-11-15 21:26:07,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:07,948 INFO L225 Difference]: With dead ends: 7002 [2019-11-15 21:26:07,948 INFO L226 Difference]: Without dead ends: 6949 [2019-11-15 21:26:07,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:26:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6949 states. [2019-11-15 21:26:07,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6949 to 5919. [2019-11-15 21:26:07,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5919 states. [2019-11-15 21:26:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5919 states to 5919 states and 12985 transitions. [2019-11-15 21:26:08,004 INFO L78 Accepts]: Start accepts. Automaton has 5919 states and 12985 transitions. Word has length 95 [2019-11-15 21:26:08,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:08,004 INFO L462 AbstractCegarLoop]: Abstraction has 5919 states and 12985 transitions. [2019-11-15 21:26:08,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:26:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 5919 states and 12985 transitions. [2019-11-15 21:26:08,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:26:08,011 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:08,012 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:26:08,012 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:08,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:08,012 INFO L82 PathProgramCache]: Analyzing trace with hash -24926304, now seen corresponding path program 1 times [2019-11-15 21:26:08,012 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:08,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697817543] [2019-11-15 21:26:08,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:08,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:08,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:08,075 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:26:08,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697817543] [2019-11-15 21:26:08,076 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:08,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:26:08,076 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873757169] [2019-11-15 21:26:08,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:26:08,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:08,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:26:08,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:26:08,077 INFO L87 Difference]: Start difference. First operand 5919 states and 12985 transitions. Second operand 4 states. [2019-11-15 21:26:08,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:08,298 INFO L93 Difference]: Finished difference Result 6877 states and 15030 transitions. [2019-11-15 21:26:08,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:26:08,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 21:26:08,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:08,303 INFO L225 Difference]: With dead ends: 6877 [2019-11-15 21:26:08,304 INFO L226 Difference]: Without dead ends: 6809 [2019-11-15 21:26:08,304 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:26:08,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6809 states. [2019-11-15 21:26:08,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6809 to 6299. [2019-11-15 21:26:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6299 states. [2019-11-15 21:26:08,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6299 states to 6299 states and 13863 transitions. [2019-11-15 21:26:08,361 INFO L78 Accepts]: Start accepts. Automaton has 6299 states and 13863 transitions. Word has length 95 [2019-11-15 21:26:08,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:08,361 INFO L462 AbstractCegarLoop]: Abstraction has 6299 states and 13863 transitions. [2019-11-15 21:26:08,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:26:08,361 INFO L276 IsEmpty]: Start isEmpty. Operand 6299 states and 13863 transitions. [2019-11-15 21:26:08,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:26:08,365 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:08,366 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:26:08,366 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:08,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:08,366 INFO L82 PathProgramCache]: Analyzing trace with hash -2102135647, now seen corresponding path program 1 times [2019-11-15 21:26:08,366 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:08,366 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894776794] [2019-11-15 21:26:08,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:08,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:08,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:08,558 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:26:08,559 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894776794] [2019-11-15 21:26:08,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:08,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:26:08,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281618758] [2019-11-15 21:26:08,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:26:08,560 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:08,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:26:08,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:26:08,560 INFO L87 Difference]: Start difference. First operand 6299 states and 13863 transitions. Second operand 9 states. [2019-11-15 21:26:09,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:09,467 INFO L93 Difference]: Finished difference Result 8182 states and 17900 transitions. [2019-11-15 21:26:09,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 21:26:09,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-11-15 21:26:09,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:09,475 INFO L225 Difference]: With dead ends: 8182 [2019-11-15 21:26:09,476 INFO L226 Difference]: Without dead ends: 8142 [2019-11-15 21:26:09,476 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:26:09,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8142 states. [2019-11-15 21:26:09,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8142 to 6554. [2019-11-15 21:26:09,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6554 states. [2019-11-15 21:26:09,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6554 states to 6554 states and 14405 transitions. [2019-11-15 21:26:09,567 INFO L78 Accepts]: Start accepts. Automaton has 6554 states and 14405 transitions. Word has length 95 [2019-11-15 21:26:09,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:09,567 INFO L462 AbstractCegarLoop]: Abstraction has 6554 states and 14405 transitions. [2019-11-15 21:26:09,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:26:09,567 INFO L276 IsEmpty]: Start isEmpty. Operand 6554 states and 14405 transitions. [2019-11-15 21:26:09,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:26:09,574 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:09,574 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:26:09,575 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:09,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:09,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1214631966, now seen corresponding path program 1 times [2019-11-15 21:26:09,576 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:09,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397953503] [2019-11-15 21:26:09,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:09,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:09,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:09,744 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:26:09,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397953503] [2019-11-15 21:26:09,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:09,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:26:09,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004693561] [2019-11-15 21:26:09,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:26:09,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:09,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:26:09,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:26:09,746 INFO L87 Difference]: Start difference. First operand 6554 states and 14405 transitions. Second operand 9 states. [2019-11-15 21:26:10,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:10,505 INFO L93 Difference]: Finished difference Result 7723 states and 16891 transitions. [2019-11-15 21:26:10,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 21:26:10,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-11-15 21:26:10,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:10,514 INFO L225 Difference]: With dead ends: 7723 [2019-11-15 21:26:10,514 INFO L226 Difference]: Without dead ends: 7723 [2019-11-15 21:26:10,515 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-11-15 21:26:10,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7723 states. [2019-11-15 21:26:10,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7723 to 6201. [2019-11-15 21:26:10,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6201 states. [2019-11-15 21:26:10,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6201 states to 6201 states and 13646 transitions. [2019-11-15 21:26:10,598 INFO L78 Accepts]: Start accepts. Automaton has 6201 states and 13646 transitions. Word has length 95 [2019-11-15 21:26:10,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:10,598 INFO L462 AbstractCegarLoop]: Abstraction has 6201 states and 13646 transitions. [2019-11-15 21:26:10,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:26:10,598 INFO L276 IsEmpty]: Start isEmpty. Operand 6201 states and 13646 transitions. [2019-11-15 21:26:10,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:26:10,605 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:10,605 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:26:10,605 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:10,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:10,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1890784734, now seen corresponding path program 1 times [2019-11-15 21:26:10,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:10,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865327797] [2019-11-15 21:26:10,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:10,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:10,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:10,776 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:26:10,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865327797] [2019-11-15 21:26:10,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:10,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:26:10,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238066295] [2019-11-15 21:26:10,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:26:10,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:10,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:26:10,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:26:10,778 INFO L87 Difference]: Start difference. First operand 6201 states and 13646 transitions. Second operand 9 states. [2019-11-15 21:26:11,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:11,326 INFO L93 Difference]: Finished difference Result 6559 states and 14382 transitions. [2019-11-15 21:26:11,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 21:26:11,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-11-15 21:26:11,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:11,333 INFO L225 Difference]: With dead ends: 6559 [2019-11-15 21:26:11,333 INFO L226 Difference]: Without dead ends: 6559 [2019-11-15 21:26:11,335 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-11-15 21:26:11,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6559 states. [2019-11-15 21:26:11,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6559 to 6082. [2019-11-15 21:26:11,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6082 states. [2019-11-15 21:26:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6082 states to 6082 states and 13396 transitions. [2019-11-15 21:26:11,410 INFO L78 Accepts]: Start accepts. Automaton has 6082 states and 13396 transitions. Word has length 95 [2019-11-15 21:26:11,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:11,411 INFO L462 AbstractCegarLoop]: Abstraction has 6082 states and 13396 transitions. [2019-11-15 21:26:11,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:26:11,411 INFO L276 IsEmpty]: Start isEmpty. Operand 6082 states and 13396 transitions. [2019-11-15 21:26:11,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:26:11,417 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:11,417 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:26:11,417 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:11,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:11,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1003281053, now seen corresponding path program 1 times [2019-11-15 21:26:11,418 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:11,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104727591] [2019-11-15 21:26:11,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:11,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:11,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:11,576 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:26:11,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104727591] [2019-11-15 21:26:11,576 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:11,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 21:26:11,576 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691218616] [2019-11-15 21:26:11,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 21:26:11,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:11,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:26:11,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:26:11,577 INFO L87 Difference]: Start difference. First operand 6082 states and 13396 transitions. Second operand 10 states. [2019-11-15 21:26:11,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:11,968 INFO L93 Difference]: Finished difference Result 18898 states and 42296 transitions. [2019-11-15 21:26:11,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 21:26:11,968 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-11-15 21:26:11,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:11,978 INFO L225 Difference]: With dead ends: 18898 [2019-11-15 21:26:11,978 INFO L226 Difference]: Without dead ends: 12522 [2019-11-15 21:26:11,978 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-11-15 21:26:11,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12522 states. [2019-11-15 21:26:12,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12522 to 5987. [2019-11-15 21:26:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5987 states. [2019-11-15 21:26:12,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5987 states to 5987 states and 13116 transitions. [2019-11-15 21:26:12,054 INFO L78 Accepts]: Start accepts. Automaton has 5987 states and 13116 transitions. Word has length 95 [2019-11-15 21:26:12,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:12,054 INFO L462 AbstractCegarLoop]: Abstraction has 5987 states and 13116 transitions. [2019-11-15 21:26:12,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 21:26:12,055 INFO L276 IsEmpty]: Start isEmpty. Operand 5987 states and 13116 transitions. [2019-11-15 21:26:12,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:26:12,059 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:12,059 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:26:12,059 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:12,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:12,060 INFO L82 PathProgramCache]: Analyzing trace with hash 873793154, now seen corresponding path program 1 times [2019-11-15 21:26:12,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:12,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371885628] [2019-11-15 21:26:12,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:12,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:12,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:12,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:12,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371885628] [2019-11-15 21:26:12,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:12,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:26:12,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123208469] [2019-11-15 21:26:12,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:26:12,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:12,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:26:12,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:26:12,172 INFO L87 Difference]: Start difference. First operand 5987 states and 13116 transitions. Second operand 6 states. [2019-11-15 21:26:12,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:12,388 INFO L93 Difference]: Finished difference Result 6745 states and 14647 transitions. [2019-11-15 21:26:12,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:26:12,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-15 21:26:12,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:12,396 INFO L225 Difference]: With dead ends: 6745 [2019-11-15 21:26:12,396 INFO L226 Difference]: Without dead ends: 6686 [2019-11-15 21:26:12,396 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:26:12,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6686 states. [2019-11-15 21:26:12,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6686 to 6007. [2019-11-15 21:26:12,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6007 states. [2019-11-15 21:26:12,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6007 states to 6007 states and 13085 transitions. [2019-11-15 21:26:12,470 INFO L78 Accepts]: Start accepts. Automaton has 6007 states and 13085 transitions. Word has length 95 [2019-11-15 21:26:12,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:12,470 INFO L462 AbstractCegarLoop]: Abstraction has 6007 states and 13085 transitions. [2019-11-15 21:26:12,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:26:12,471 INFO L276 IsEmpty]: Start isEmpty. Operand 6007 states and 13085 transitions. [2019-11-15 21:26:12,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:26:12,476 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:12,477 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:26:12,477 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:12,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:12,477 INFO L82 PathProgramCache]: Analyzing trace with hash -490679198, now seen corresponding path program 2 times [2019-11-15 21:26:12,477 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:12,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554762331] [2019-11-15 21:26:12,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:12,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:12,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:12,589 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:26:12,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554762331] [2019-11-15 21:26:12,593 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:12,593 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:26:12,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862671631] [2019-11-15 21:26:12,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:26:12,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:12,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:26:12,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:26:12,595 INFO L87 Difference]: Start difference. First operand 6007 states and 13085 transitions. Second operand 7 states. [2019-11-15 21:26:12,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:12,926 INFO L93 Difference]: Finished difference Result 6072 states and 13151 transitions. [2019-11-15 21:26:12,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 21:26:12,926 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-15 21:26:12,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:12,932 INFO L225 Difference]: With dead ends: 6072 [2019-11-15 21:26:12,932 INFO L226 Difference]: Without dead ends: 6072 [2019-11-15 21:26:12,934 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:26:12,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2019-11-15 21:26:12,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 5827. [2019-11-15 21:26:12,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5827 states. [2019-11-15 21:26:13,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5827 states to 5827 states and 12649 transitions. [2019-11-15 21:26:13,003 INFO L78 Accepts]: Start accepts. Automaton has 5827 states and 12649 transitions. Word has length 95 [2019-11-15 21:26:13,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:13,003 INFO L462 AbstractCegarLoop]: Abstraction has 5827 states and 12649 transitions. [2019-11-15 21:26:13,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:26:13,003 INFO L276 IsEmpty]: Start isEmpty. Operand 5827 states and 12649 transitions. [2019-11-15 21:26:13,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:26:13,009 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:13,009 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:26:13,010 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:13,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:13,010 INFO L82 PathProgramCache]: Analyzing trace with hash 425096515, now seen corresponding path program 2 times [2019-11-15 21:26:13,010 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:13,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994763133] [2019-11-15 21:26:13,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:13,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:13,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:26:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:26:13,108 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:26:13,108 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 21:26:13,276 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 21:26:13,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:26:13 BasicIcfg [2019-11-15 21:26:13,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:26:13,280 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:26:13,280 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:26:13,280 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:26:13,281 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:25:32" (3/4) ... [2019-11-15 21:26:13,290 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 21:26:13,440 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_413d8e31-7acd-4e55-a915-978b5ed04b58/bin/uautomizer/witness.graphml [2019-11-15 21:26:13,441 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:26:13,442 INFO L168 Benchmark]: Toolchain (without parser) took 42230.67 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.8 GB). Free memory was 938.0 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-11-15 21:26:13,443 INFO L168 Benchmark]: CDTParser took 0.27 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:26:13,443 INFO L168 Benchmark]: CACSL2BoogieTranslator took 681.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -134.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:26:13,444 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:26:13,444 INFO L168 Benchmark]: Boogie Preprocessor took 36.88 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:26:13,444 INFO L168 Benchmark]: RCFGBuilder took 718.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:26:13,445 INFO L168 Benchmark]: TraceAbstraction took 40580.38 ms. Allocated memory was 1.1 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-11-15 21:26:13,446 INFO L168 Benchmark]: Witness Printer took 160.70 ms. Allocated memory is still 4.8 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 71.3 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:26:13,448 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.27 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 681.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -134.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.88 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 718.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 40580.38 ms. Allocated memory was 1.1 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 160.70 ms. Allocated memory is still 4.8 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 71.3 MB). Peak memory consumption was 71.3 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] [L793] 0 pthread_t t2311; 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] [L794] FCALL, FORK 0 pthread_create(&t2311, ((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] [L795] 0 pthread_t t2312; 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] [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, 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, 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, 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] [L796] FCALL, FORK 0 pthread_create(&t2312, ((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=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 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L759] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L759] 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 [L760] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_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=1, y=0, y$flush_delayed=1, 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] [L760] 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)) [L761] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_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=1, y=0, y$flush_delayed=1, 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] [L761] 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)) [L762] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_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=1, y=0, y$flush_delayed=1, 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] [L762] 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)) [L763] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_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=1, y=0, y$flush_delayed=1, 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_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] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_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=1, y=0, y$flush_delayed=1, 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$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)) [L765] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_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=1, y=0, y$flush_delayed=1, 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$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)) [L766] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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 = y$flush_delayed ? y$mem_tmp : y [L768] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L771] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L771] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L771] 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) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L773] 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 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L775] 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 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L802] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L802] 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) [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L804] 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 [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L806] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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$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 [L809] 0 main$tmp_guard1 = !(__unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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: 40.4s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9299 SDtfs, 10363 SDslu, 22540 SDs, 0 SdLazy, 9137 SolverSat, 532 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 365 GetRequests, 95 SyntacticMatches, 27 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71011occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.2s AutomataMinimizationTime, 32 MinimizatonAttempts, 76620 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2341 NumberOfCodeBlocks, 2341 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2214 ConstructedInterpolants, 0 QuantifiedInterpolants, 461926 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...