./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ccbf1088-3e52-409f-bec9-3656a3700810/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ccbf1088-3e52-409f-bec9-3656a3700810/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ccbf1088-3e52-409f-bec9-3656a3700810/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ccbf1088-3e52-409f-bec9-3656a3700810/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_power.opt.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ccbf1088-3e52-409f-bec9-3656a3700810/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ccbf1088-3e52-409f-bec9-3656a3700810/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 c0653e331c6f536eb8bc95efd286c4de4313fd9b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-10-22 08:54:10,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:10,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:10,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:10,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:10,988 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:10,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:10,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:10,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:10,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:10,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:10,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:10,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:10,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:10,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:10,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:10,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:10,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:11,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:11,002 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:11,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:11,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:11,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:11,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:11,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:11,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:11,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:11,009 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:11,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:11,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:11,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:11,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:11,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:11,012 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:11,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:11,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:11,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:11,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:11,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:11,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:11,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:11,016 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ccbf1088-3e52-409f-bec9-3656a3700810/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:54:11,026 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:11,026 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:11,027 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:11,027 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:11,027 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:11,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:11,028 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:54:11,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:11,028 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:54:11,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:11,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:54:11,029 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:54:11,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:54:11,029 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:54:11,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:11,029 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:11,030 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:54:11,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:11,030 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:11,030 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:54:11,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:54:11,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:54:11,031 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:11,031 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:54:11,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:54:11,031 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:11,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:54:11,032 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:54:11,032 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/working_dir_ccbf1088-3e52-409f-bec9-3656a3700810/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 -> c0653e331c6f536eb8bc95efd286c4de4313fd9b [2019-10-22 08:54:11,057 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:11,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:11,073 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:11,075 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:11,075 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:11,076 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ccbf1088-3e52-409f-bec9-3656a3700810/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi003_power.opt.i [2019-10-22 08:54:11,128 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ccbf1088-3e52-409f-bec9-3656a3700810/bin/uautomizer/data/f0dc1550a/ae698537452c411194ea597fb364eea2/FLAGe93c147da [2019-10-22 08:54:11,613 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:11,617 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ccbf1088-3e52-409f-bec9-3656a3700810/sv-benchmarks/c/pthread-wmm/rfi003_power.opt.i [2019-10-22 08:54:11,632 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ccbf1088-3e52-409f-bec9-3656a3700810/bin/uautomizer/data/f0dc1550a/ae698537452c411194ea597fb364eea2/FLAGe93c147da [2019-10-22 08:54:11,647 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ccbf1088-3e52-409f-bec9-3656a3700810/bin/uautomizer/data/f0dc1550a/ae698537452c411194ea597fb364eea2 [2019-10-22 08:54:11,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:11,651 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:11,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:11,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:11,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:11,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:11" (1/1) ... [2019-10-22 08:54:11,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e97f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:11, skipping insertion in model container [2019-10-22 08:54:11,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:11" (1/1) ... [2019-10-22 08:54:11,670 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:11,716 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:12,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:12,154 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:12,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:12,299 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:12,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12 WrapperNode [2019-10-22 08:54:12,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:12,300 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:12,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:12,300 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:12,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,349 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:12,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:12,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:12,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:12,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:12,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:12,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:12,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:12,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccbf1088-3e52-409f-bec9-3656a3700810/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-10-22 08:54:12,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:54:12,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-10-22 08:54:12,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:54:12,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:54:12,434 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-10-22 08:54:12,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-10-22 08:54:12,434 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-10-22 08:54:12,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-10-22 08:54:12,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-10-22 08:54:12,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:12,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:12,436 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-10-22 08:54:12,961 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:12,962 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:54:12,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:12 BoogieIcfgContainer [2019-10-22 08:54:12,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:12,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:54:12,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:54:12,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:54:12,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:54:11" (1/3) ... [2019-10-22 08:54:12,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181e04d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:54:12, skipping insertion in model container [2019-10-22 08:54:12,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (2/3) ... [2019-10-22 08:54:12,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181e04d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:54:12, skipping insertion in model container [2019-10-22 08:54:12,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:12" (3/3) ... [2019-10-22 08:54:12,969 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_power.opt.i [2019-10-22 08:54:13,003 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,003 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,003 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,004 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,004 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,004 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,004 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,007 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,007 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,007 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,008 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,008 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,008 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,008 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,008 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,008 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,009 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,009 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,009 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,009 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,009 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,009 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,010 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,010 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,010 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,010 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,010 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,012 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,012 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,012 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,012 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,012 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,013 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,013 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,013 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,013 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,013 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,014 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,014 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,014 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,014 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,014 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,014 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,014 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,015 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,015 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,015 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,015 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,015 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,015 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,015 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,016 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,016 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,016 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,016 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,016 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,016 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,017 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,017 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,017 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,017 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,017 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,017 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,017 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,018 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,018 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,018 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,018 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,018 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,018 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,021 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,022 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,022 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,022 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,023 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,023 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,023 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,023 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,023 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,023 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,024 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,024 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,024 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,024 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,025 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,025 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,025 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,028 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,029 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,029 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,029 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,029 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,029 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,029 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,030 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,030 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,030 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,030 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,030 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,031 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,031 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,031 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,031 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,031 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,031 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,031 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,032 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,032 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,032 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,032 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,032 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,032 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,032 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,033 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,033 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,033 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,033 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,033 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,033 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,033 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,034 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,034 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,034 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,034 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,034 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,034 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,034 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,037 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,037 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,037 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,037 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,038 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,038 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,038 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,038 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,038 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:54:13,047 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-10-22 08:54:13,047 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:54:13,054 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 08:54:13,064 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 08:54:13,079 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:54:13,079 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:54:13,079 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:54:13,079 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:13,079 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:13,079 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:54:13,080 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:13,080 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:54:13,093 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 131 places, 163 transitions [2019-10-22 08:54:15,342 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27855 states. [2019-10-22 08:54:15,345 INFO L276 IsEmpty]: Start isEmpty. Operand 27855 states. [2019-10-22 08:54:15,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-22 08:54:15,354 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:15,354 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:15,356 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:15,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:15,362 INFO L82 PathProgramCache]: Analyzing trace with hash -361473251, now seen corresponding path program 1 times [2019-10-22 08:54:15,369 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:15,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249817698] [2019-10-22 08:54:15,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:15,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:15,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:15,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:15,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249817698] [2019-10-22 08:54:15,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:15,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:54:15,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278570241] [2019-10-22 08:54:15,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:15,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:15,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:15,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:15,638 INFO L87 Difference]: Start difference. First operand 27855 states. Second operand 4 states. [2019-10-22 08:54:16,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:16,158 INFO L93 Difference]: Finished difference Result 28523 states and 108880 transitions. [2019-10-22 08:54:16,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:16,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-10-22 08:54:16,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:16,307 INFO L225 Difference]: With dead ends: 28523 [2019-10-22 08:54:16,308 INFO L226 Difference]: Without dead ends: 21755 [2019-10-22 08:54:16,309 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-10-22 08:54:16,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21755 states. [2019-10-22 08:54:17,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21755 to 21755. [2019-10-22 08:54:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21755 states. [2019-10-22 08:54:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21755 states to 21755 states and 83440 transitions. [2019-10-22 08:54:17,404 INFO L78 Accepts]: Start accepts. Automaton has 21755 states and 83440 transitions. Word has length 38 [2019-10-22 08:54:17,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:17,404 INFO L462 AbstractCegarLoop]: Abstraction has 21755 states and 83440 transitions. [2019-10-22 08:54:17,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:17,405 INFO L276 IsEmpty]: Start isEmpty. Operand 21755 states and 83440 transitions. [2019-10-22 08:54:17,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-22 08:54:17,419 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:17,419 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-10-22 08:54:17,419 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:17,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:17,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1780861984, now seen corresponding path program 1 times [2019-10-22 08:54:17,420 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:17,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454155010] [2019-10-22 08:54:17,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:17,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:17,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:17,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454155010] [2019-10-22 08:54:17,554 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:17,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:17,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479846099] [2019-10-22 08:54:17,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:54:17,557 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:17,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:17,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:17,557 INFO L87 Difference]: Start difference. First operand 21755 states and 83440 transitions. Second operand 5 states. [2019-10-22 08:54:18,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:18,428 INFO L93 Difference]: Finished difference Result 34169 states and 124040 transitions. [2019-10-22 08:54:18,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:54:18,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-22 08:54:18,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:18,569 INFO L225 Difference]: With dead ends: 34169 [2019-10-22 08:54:18,569 INFO L226 Difference]: Without dead ends: 33601 [2019-10-22 08:54:18,570 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-10-22 08:54:18,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33601 states. [2019-10-22 08:54:19,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33601 to 31795. [2019-10-22 08:54:19,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31795 states. [2019-10-22 08:54:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31795 states to 31795 states and 116818 transitions. [2019-10-22 08:54:19,445 INFO L78 Accepts]: Start accepts. Automaton has 31795 states and 116818 transitions. Word has length 46 [2019-10-22 08:54:19,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:19,447 INFO L462 AbstractCegarLoop]: Abstraction has 31795 states and 116818 transitions. [2019-10-22 08:54:19,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:54:19,447 INFO L276 IsEmpty]: Start isEmpty. Operand 31795 states and 116818 transitions. [2019-10-22 08:54:19,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 08:54:19,452 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:19,452 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:19,453 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:19,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:19,453 INFO L82 PathProgramCache]: Analyzing trace with hash -379540766, now seen corresponding path program 1 times [2019-10-22 08:54:19,453 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:19,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079460354] [2019-10-22 08:54:19,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:19,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:19,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:19,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079460354] [2019-10-22 08:54:19,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:19,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:19,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353138616] [2019-10-22 08:54:19,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:54:19,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:19,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:19,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:19,548 INFO L87 Difference]: Start difference. First operand 31795 states and 116818 transitions. Second operand 5 states. [2019-10-22 08:54:20,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:20,287 INFO L93 Difference]: Finished difference Result 41643 states and 149742 transitions. [2019-10-22 08:54:20,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:54:20,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-22 08:54:20,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:20,397 INFO L225 Difference]: With dead ends: 41643 [2019-10-22 08:54:20,397 INFO L226 Difference]: Without dead ends: 41179 [2019-10-22 08:54:20,398 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-10-22 08:54:20,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41179 states. [2019-10-22 08:54:21,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41179 to 35363. [2019-10-22 08:54:21,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35363 states. [2019-10-22 08:54:21,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35363 states to 35363 states and 128876 transitions. [2019-10-22 08:54:21,698 INFO L78 Accepts]: Start accepts. Automaton has 35363 states and 128876 transitions. Word has length 47 [2019-10-22 08:54:21,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:21,698 INFO L462 AbstractCegarLoop]: Abstraction has 35363 states and 128876 transitions. [2019-10-22 08:54:21,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:54:21,698 INFO L276 IsEmpty]: Start isEmpty. Operand 35363 states and 128876 transitions. [2019-10-22 08:54:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-22 08:54:21,707 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:21,707 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] [2019-10-22 08:54:21,707 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:21,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:21,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1216116808, now seen corresponding path program 1 times [2019-10-22 08:54:21,708 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:21,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100182509] [2019-10-22 08:54:21,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:21,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:21,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:21,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100182509] [2019-10-22 08:54:21,765 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:21,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:21,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143725064] [2019-10-22 08:54:21,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:21,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:21,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:21,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:21,772 INFO L87 Difference]: Start difference. First operand 35363 states and 128876 transitions. Second operand 3 states. [2019-10-22 08:54:22,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:22,025 INFO L93 Difference]: Finished difference Result 45909 states and 163944 transitions. [2019-10-22 08:54:22,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:22,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-22 08:54:22,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:22,151 INFO L225 Difference]: With dead ends: 45909 [2019-10-22 08:54:22,151 INFO L226 Difference]: Without dead ends: 45909 [2019-10-22 08:54:22,151 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-10-22 08:54:22,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45909 states. [2019-10-22 08:54:22,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45909 to 40246. [2019-10-22 08:54:22,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40246 states. [2019-10-22 08:54:23,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40246 states to 40246 states and 145214 transitions. [2019-10-22 08:54:23,791 INFO L78 Accepts]: Start accepts. Automaton has 40246 states and 145214 transitions. Word has length 49 [2019-10-22 08:54:23,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:23,791 INFO L462 AbstractCegarLoop]: Abstraction has 40246 states and 145214 transitions. [2019-10-22 08:54:23,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:23,792 INFO L276 IsEmpty]: Start isEmpty. Operand 40246 states and 145214 transitions. [2019-10-22 08:54:23,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 08:54:23,807 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:23,807 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:23,807 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:23,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:23,808 INFO L82 PathProgramCache]: Analyzing trace with hash -518299885, now seen corresponding path program 1 times [2019-10-22 08:54:23,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:23,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607513920] [2019-10-22 08:54:23,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:23,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:23,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:23,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607513920] [2019-10-22 08:54:23,916 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:23,916 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:54:23,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484014370] [2019-10-22 08:54:23,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:54:23,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:23,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:23,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:23,917 INFO L87 Difference]: Start difference. First operand 40246 states and 145214 transitions. Second operand 6 states. [2019-10-22 08:54:24,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:24,500 INFO L93 Difference]: Finished difference Result 52465 states and 185476 transitions. [2019-10-22 08:54:24,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 08:54:24,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-10-22 08:54:24,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:24,608 INFO L225 Difference]: With dead ends: 52465 [2019-10-22 08:54:24,608 INFO L226 Difference]: Without dead ends: 51929 [2019-10-22 08:54:24,608 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:54:24,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51929 states. [2019-10-22 08:54:25,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51929 to 40897. [2019-10-22 08:54:25,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40897 states. [2019-10-22 08:54:25,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40897 states to 40897 states and 147667 transitions. [2019-10-22 08:54:25,395 INFO L78 Accepts]: Start accepts. Automaton has 40897 states and 147667 transitions. Word has length 53 [2019-10-22 08:54:25,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:25,396 INFO L462 AbstractCegarLoop]: Abstraction has 40897 states and 147667 transitions. [2019-10-22 08:54:25,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:54:25,396 INFO L276 IsEmpty]: Start isEmpty. Operand 40897 states and 147667 transitions. [2019-10-22 08:54:25,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 08:54:25,407 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:25,408 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:25,408 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:25,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:25,408 INFO L82 PathProgramCache]: Analyzing trace with hash -173831608, now seen corresponding path program 1 times [2019-10-22 08:54:25,408 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:25,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288447519] [2019-10-22 08:54:25,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:25,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:25,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:26,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288447519] [2019-10-22 08:54:26,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:26,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:54:26,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060398594] [2019-10-22 08:54:26,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:54:26,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:26,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:26,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:26,069 INFO L87 Difference]: Start difference. First operand 40897 states and 147667 transitions. Second operand 6 states. [2019-10-22 08:54:26,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:26,674 INFO L93 Difference]: Finished difference Result 56598 states and 201647 transitions. [2019-10-22 08:54:26,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:54:26,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-10-22 08:54:26,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:26,796 INFO L225 Difference]: With dead ends: 56598 [2019-10-22 08:54:26,796 INFO L226 Difference]: Without dead ends: 55459 [2019-10-22 08:54:26,796 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:54:27,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55459 states. [2019-10-22 08:54:27,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55459 to 51954. [2019-10-22 08:54:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51954 states. [2019-10-22 08:54:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51954 states to 51954 states and 186006 transitions. [2019-10-22 08:54:27,709 INFO L78 Accepts]: Start accepts. Automaton has 51954 states and 186006 transitions. Word has length 53 [2019-10-22 08:54:27,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:27,709 INFO L462 AbstractCegarLoop]: Abstraction has 51954 states and 186006 transitions. [2019-10-22 08:54:27,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:54:27,709 INFO L276 IsEmpty]: Start isEmpty. Operand 51954 states and 186006 transitions. [2019-10-22 08:54:27,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 08:54:27,724 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:27,724 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:27,724 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:27,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:27,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1970782967, now seen corresponding path program 1 times [2019-10-22 08:54:27,725 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:27,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814320041] [2019-10-22 08:54:27,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:27,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:27,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:27,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814320041] [2019-10-22 08:54:27,807 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:27,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:54:27,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590246789] [2019-10-22 08:54:27,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:54:27,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:27,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:54:27,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:54:27,808 INFO L87 Difference]: Start difference. First operand 51954 states and 186006 transitions. Second operand 7 states. [2019-10-22 08:54:31,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:31,102 INFO L93 Difference]: Finished difference Result 75637 states and 260103 transitions. [2019-10-22 08:54:31,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 08:54:31,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-10-22 08:54:31,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:31,245 INFO L225 Difference]: With dead ends: 75637 [2019-10-22 08:54:31,246 INFO L226 Difference]: Without dead ends: 75637 [2019-10-22 08:54:31,246 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:54:31,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75637 states. [2019-10-22 08:54:32,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75637 to 61472. [2019-10-22 08:54:32,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61472 states. [2019-10-22 08:54:32,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61472 states to 61472 states and 215183 transitions. [2019-10-22 08:54:32,388 INFO L78 Accepts]: Start accepts. Automaton has 61472 states and 215183 transitions. Word has length 53 [2019-10-22 08:54:32,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:32,388 INFO L462 AbstractCegarLoop]: Abstraction has 61472 states and 215183 transitions. [2019-10-22 08:54:32,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:54:32,388 INFO L276 IsEmpty]: Start isEmpty. Operand 61472 states and 215183 transitions. [2019-10-22 08:54:32,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 08:54:32,399 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:32,399 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:32,399 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:32,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:32,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1083279286, now seen corresponding path program 1 times [2019-10-22 08:54:32,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:32,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533198882] [2019-10-22 08:54:32,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:32,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:32,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:32,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:32,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533198882] [2019-10-22 08:54:32,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:32,479 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:54:32,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997656592] [2019-10-22 08:54:32,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:32,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:32,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:32,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:32,480 INFO L87 Difference]: Start difference. First operand 61472 states and 215183 transitions. Second operand 4 states. [2019-10-22 08:54:32,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:32,557 INFO L93 Difference]: Finished difference Result 13777 states and 43273 transitions. [2019-10-22 08:54:32,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:54:32,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-10-22 08:54:32,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:32,581 INFO L225 Difference]: With dead ends: 13777 [2019-10-22 08:54:32,581 INFO L226 Difference]: Without dead ends: 12160 [2019-10-22 08:54:32,581 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-10-22 08:54:32,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12160 states. [2019-10-22 08:54:32,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12160 to 12112. [2019-10-22 08:54:32,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12112 states. [2019-10-22 08:54:32,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12112 states to 12112 states and 37957 transitions. [2019-10-22 08:54:32,725 INFO L78 Accepts]: Start accepts. Automaton has 12112 states and 37957 transitions. Word has length 53 [2019-10-22 08:54:32,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:32,725 INFO L462 AbstractCegarLoop]: Abstraction has 12112 states and 37957 transitions. [2019-10-22 08:54:32,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 12112 states and 37957 transitions. [2019-10-22 08:54:32,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 08:54:32,729 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:32,729 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:32,729 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:32,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:32,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1785283345, now seen corresponding path program 1 times [2019-10-22 08:54:32,729 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:32,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844160704] [2019-10-22 08:54:32,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:32,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:32,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:32,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:32,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844160704] [2019-10-22 08:54:32,779 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:32,779 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:54:32,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872176617] [2019-10-22 08:54:32,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:32,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:32,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:32,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:32,780 INFO L87 Difference]: Start difference. First operand 12112 states and 37957 transitions. Second operand 4 states. [2019-10-22 08:54:32,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:32,932 INFO L93 Difference]: Finished difference Result 14275 states and 44580 transitions. [2019-10-22 08:54:32,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:54:32,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-22 08:54:32,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:32,959 INFO L225 Difference]: With dead ends: 14275 [2019-10-22 08:54:32,959 INFO L226 Difference]: Without dead ends: 14275 [2019-10-22 08:54:32,959 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-10-22 08:54:32,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14275 states. [2019-10-22 08:54:33,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14275 to 12843. [2019-10-22 08:54:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12843 states. [2019-10-22 08:54:33,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12843 states to 12843 states and 40182 transitions. [2019-10-22 08:54:33,134 INFO L78 Accepts]: Start accepts. Automaton has 12843 states and 40182 transitions. Word has length 63 [2019-10-22 08:54:33,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:33,134 INFO L462 AbstractCegarLoop]: Abstraction has 12843 states and 40182 transitions. [2019-10-22 08:54:33,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:33,135 INFO L276 IsEmpty]: Start isEmpty. Operand 12843 states and 40182 transitions. [2019-10-22 08:54:33,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 08:54:33,140 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:33,141 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] [2019-10-22 08:54:33,141 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:33,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:33,141 INFO L82 PathProgramCache]: Analyzing trace with hash -766873616, now seen corresponding path program 1 times [2019-10-22 08:54:33,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:33,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444015259] [2019-10-22 08:54:33,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:33,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444015259] [2019-10-22 08:54:33,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:33,378 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:54:33,378 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007195163] [2019-10-22 08:54:33,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:54:33,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:33,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:33,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:33,379 INFO L87 Difference]: Start difference. First operand 12843 states and 40182 transitions. Second operand 6 states. [2019-10-22 08:54:33,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:33,804 INFO L93 Difference]: Finished difference Result 16769 states and 51611 transitions. [2019-10-22 08:54:33,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 08:54:33,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-10-22 08:54:33,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:33,828 INFO L225 Difference]: With dead ends: 16769 [2019-10-22 08:54:33,828 INFO L226 Difference]: Without dead ends: 16705 [2019-10-22 08:54:33,828 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:54:33,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16705 states. [2019-10-22 08:54:34,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16705 to 13812. [2019-10-22 08:54:34,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13812 states. [2019-10-22 08:54:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13812 states to 13812 states and 42966 transitions. [2019-10-22 08:54:34,050 INFO L78 Accepts]: Start accepts. Automaton has 13812 states and 42966 transitions. Word has length 63 [2019-10-22 08:54:34,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:34,050 INFO L462 AbstractCegarLoop]: Abstraction has 13812 states and 42966 transitions. [2019-10-22 08:54:34,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:54:34,050 INFO L276 IsEmpty]: Start isEmpty. Operand 13812 states and 42966 transitions. [2019-10-22 08:54:34,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 08:54:34,057 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:34,057 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] [2019-10-22 08:54:34,057 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:34,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:34,057 INFO L82 PathProgramCache]: Analyzing trace with hash -830371060, now seen corresponding path program 1 times [2019-10-22 08:54:34,057 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:34,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570207513] [2019-10-22 08:54:34,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:34,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:34,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:34,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:34,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570207513] [2019-10-22 08:54:34,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:34,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:54:34,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187869906] [2019-10-22 08:54:34,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:34,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:34,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:34,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:34,106 INFO L87 Difference]: Start difference. First operand 13812 states and 42966 transitions. Second operand 4 states. [2019-10-22 08:54:34,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:34,328 INFO L93 Difference]: Finished difference Result 17359 states and 53255 transitions. [2019-10-22 08:54:34,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:34,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-10-22 08:54:34,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:34,352 INFO L225 Difference]: With dead ends: 17359 [2019-10-22 08:54:34,352 INFO L226 Difference]: Without dead ends: 17359 [2019-10-22 08:54:34,353 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-10-22 08:54:34,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17359 states. [2019-10-22 08:54:34,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17359 to 15783. [2019-10-22 08:54:34,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15783 states. [2019-10-22 08:54:34,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15783 states to 15783 states and 48578 transitions. [2019-10-22 08:54:34,555 INFO L78 Accepts]: Start accepts. Automaton has 15783 states and 48578 transitions. Word has length 65 [2019-10-22 08:54:34,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:34,555 INFO L462 AbstractCegarLoop]: Abstraction has 15783 states and 48578 transitions. [2019-10-22 08:54:34,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:34,556 INFO L276 IsEmpty]: Start isEmpty. Operand 15783 states and 48578 transitions. [2019-10-22 08:54:34,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 08:54:34,564 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:34,564 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] [2019-10-22 08:54:34,564 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:34,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:34,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1387386893, now seen corresponding path program 1 times [2019-10-22 08:54:34,564 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:34,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961173551] [2019-10-22 08:54:34,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:34,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:34,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:34,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:34,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961173551] [2019-10-22 08:54:34,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:34,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:34,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918650223] [2019-10-22 08:54:34,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:34,603 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:34,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:34,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:34,604 INFO L87 Difference]: Start difference. First operand 15783 states and 48578 transitions. Second operand 3 states. [2019-10-22 08:54:34,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:34,796 INFO L93 Difference]: Finished difference Result 16413 states and 50318 transitions. [2019-10-22 08:54:34,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:34,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-10-22 08:54:34,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:34,828 INFO L225 Difference]: With dead ends: 16413 [2019-10-22 08:54:34,829 INFO L226 Difference]: Without dead ends: 16413 [2019-10-22 08:54:34,829 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-10-22 08:54:34,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16413 states. [2019-10-22 08:54:35,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16413 to 16125. [2019-10-22 08:54:35,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16125 states. [2019-10-22 08:54:35,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 49516 transitions. [2019-10-22 08:54:35,029 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 49516 transitions. Word has length 65 [2019-10-22 08:54:35,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:35,030 INFO L462 AbstractCegarLoop]: Abstraction has 16125 states and 49516 transitions. [2019-10-22 08:54:35,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:35,030 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 49516 transitions. [2019-10-22 08:54:35,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 08:54:35,040 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:35,041 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:35,041 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:35,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:35,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1580877020, now seen corresponding path program 1 times [2019-10-22 08:54:35,041 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:35,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551719660] [2019-10-22 08:54:35,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:35,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:35,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:35,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551719660] [2019-10-22 08:54:35,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:35,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:54:35,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589993265] [2019-10-22 08:54:35,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:54:35,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:35,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:35,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:35,139 INFO L87 Difference]: Start difference. First operand 16125 states and 49516 transitions. Second operand 6 states. [2019-10-22 08:54:35,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:35,527 INFO L93 Difference]: Finished difference Result 17577 states and 53335 transitions. [2019-10-22 08:54:35,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:54:35,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-10-22 08:54:35,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:35,551 INFO L225 Difference]: With dead ends: 17577 [2019-10-22 08:54:35,551 INFO L226 Difference]: Without dead ends: 17577 [2019-10-22 08:54:35,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:54:35,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17577 states. [2019-10-22 08:54:35,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17577 to 17008. [2019-10-22 08:54:35,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17008 states. [2019-10-22 08:54:35,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17008 states to 17008 states and 51782 transitions. [2019-10-22 08:54:35,757 INFO L78 Accepts]: Start accepts. Automaton has 17008 states and 51782 transitions. Word has length 67 [2019-10-22 08:54:35,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:35,757 INFO L462 AbstractCegarLoop]: Abstraction has 17008 states and 51782 transitions. [2019-10-22 08:54:35,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:54:35,757 INFO L276 IsEmpty]: Start isEmpty. Operand 17008 states and 51782 transitions. [2019-10-22 08:54:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 08:54:35,769 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:35,769 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:35,770 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:35,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:35,770 INFO L82 PathProgramCache]: Analyzing trace with hash -496332323, now seen corresponding path program 1 times [2019-10-22 08:54:35,770 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:35,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494708458] [2019-10-22 08:54:35,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:35,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:35,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:35,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:35,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494708458] [2019-10-22 08:54:35,859 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:35,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:54:35,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418897047] [2019-10-22 08:54:35,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:54:35,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:35,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:35,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:35,860 INFO L87 Difference]: Start difference. First operand 17008 states and 51782 transitions. Second operand 6 states. [2019-10-22 08:54:36,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:36,241 INFO L93 Difference]: Finished difference Result 19873 states and 58892 transitions. [2019-10-22 08:54:36,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:54:36,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-10-22 08:54:36,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:36,268 INFO L225 Difference]: With dead ends: 19873 [2019-10-22 08:54:36,268 INFO L226 Difference]: Without dead ends: 19873 [2019-10-22 08:54:36,269 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-10-22 08:54:36,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19873 states. [2019-10-22 08:54:36,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19873 to 17684. [2019-10-22 08:54:36,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17684 states. [2019-10-22 08:54:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17684 states to 17684 states and 52848 transitions. [2019-10-22 08:54:36,494 INFO L78 Accepts]: Start accepts. Automaton has 17684 states and 52848 transitions. Word has length 67 [2019-10-22 08:54:36,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:36,494 INFO L462 AbstractCegarLoop]: Abstraction has 17684 states and 52848 transitions. [2019-10-22 08:54:36,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:54:36,494 INFO L276 IsEmpty]: Start isEmpty. Operand 17684 states and 52848 transitions. [2019-10-22 08:54:36,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 08:54:36,505 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:36,505 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:36,505 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:36,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:36,506 INFO L82 PathProgramCache]: Analyzing trace with hash -284981410, now seen corresponding path program 1 times [2019-10-22 08:54:36,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:36,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753617905] [2019-10-22 08:54:36,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:36,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:36,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:36,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:36,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753617905] [2019-10-22 08:54:36,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:36,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:36,561 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683192190] [2019-10-22 08:54:36,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:54:36,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:36,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:36,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:36,562 INFO L87 Difference]: Start difference. First operand 17684 states and 52848 transitions. Second operand 5 states. [2019-10-22 08:54:36,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:36,866 INFO L93 Difference]: Finished difference Result 22458 states and 66796 transitions. [2019-10-22 08:54:36,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:54:36,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-10-22 08:54:36,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:36,909 INFO L225 Difference]: With dead ends: 22458 [2019-10-22 08:54:36,909 INFO L226 Difference]: Without dead ends: 22458 [2019-10-22 08:54:36,909 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-10-22 08:54:36,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22458 states. [2019-10-22 08:54:37,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22458 to 18978. [2019-10-22 08:54:37,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18978 states. [2019-10-22 08:54:37,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18978 states to 18978 states and 56244 transitions. [2019-10-22 08:54:37,315 INFO L78 Accepts]: Start accepts. Automaton has 18978 states and 56244 transitions. Word has length 67 [2019-10-22 08:54:37,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:37,315 INFO L462 AbstractCegarLoop]: Abstraction has 18978 states and 56244 transitions. [2019-10-22 08:54:37,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:54:37,315 INFO L276 IsEmpty]: Start isEmpty. Operand 18978 states and 56244 transitions. [2019-10-22 08:54:37,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 08:54:37,327 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:37,327 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:37,327 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:37,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:37,327 INFO L82 PathProgramCache]: Analyzing trace with hash -795515587, now seen corresponding path program 1 times [2019-10-22 08:54:37,327 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:37,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320797234] [2019-10-22 08:54:37,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:37,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:37,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:37,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:37,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320797234] [2019-10-22 08:54:37,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:37,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:37,388 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275962583] [2019-10-22 08:54:37,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:54:37,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:37,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:37,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:37,389 INFO L87 Difference]: Start difference. First operand 18978 states and 56244 transitions. Second operand 5 states. [2019-10-22 08:54:37,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:37,926 INFO L93 Difference]: Finished difference Result 25572 states and 75564 transitions. [2019-10-22 08:54:37,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:54:37,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-10-22 08:54:37,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:37,982 INFO L225 Difference]: With dead ends: 25572 [2019-10-22 08:54:37,982 INFO L226 Difference]: Without dead ends: 25572 [2019-10-22 08:54:37,982 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-10-22 08:54:38,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25572 states. [2019-10-22 08:54:38,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25572 to 20144. [2019-10-22 08:54:38,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20144 states. [2019-10-22 08:54:38,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20144 states to 20144 states and 59688 transitions. [2019-10-22 08:54:38,369 INFO L78 Accepts]: Start accepts. Automaton has 20144 states and 59688 transitions. Word has length 67 [2019-10-22 08:54:38,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:38,369 INFO L462 AbstractCegarLoop]: Abstraction has 20144 states and 59688 transitions. [2019-10-22 08:54:38,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:54:38,369 INFO L276 IsEmpty]: Start isEmpty. Operand 20144 states and 59688 transitions. [2019-10-22 08:54:38,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 08:54:38,385 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:38,385 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:38,385 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:38,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:38,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1691997246, now seen corresponding path program 1 times [2019-10-22 08:54:38,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:38,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069623066] [2019-10-22 08:54:38,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:38,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:38,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:38,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:38,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069623066] [2019-10-22 08:54:38,452 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:38,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:38,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717485007] [2019-10-22 08:54:38,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:54:38,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:38,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:38,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:38,453 INFO L87 Difference]: Start difference. First operand 20144 states and 59688 transitions. Second operand 5 states. [2019-10-22 08:54:38,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:38,506 INFO L93 Difference]: Finished difference Result 6664 states and 15930 transitions. [2019-10-22 08:54:38,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:54:38,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-10-22 08:54:38,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:38,513 INFO L225 Difference]: With dead ends: 6664 [2019-10-22 08:54:38,513 INFO L226 Difference]: Without dead ends: 5220 [2019-10-22 08:54:38,514 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-10-22 08:54:38,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5220 states. [2019-10-22 08:54:38,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5220 to 4550. [2019-10-22 08:54:38,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4550 states. [2019-10-22 08:54:38,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4550 states to 4550 states and 10626 transitions. [2019-10-22 08:54:38,575 INFO L78 Accepts]: Start accepts. Automaton has 4550 states and 10626 transitions. Word has length 67 [2019-10-22 08:54:38,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:38,576 INFO L462 AbstractCegarLoop]: Abstraction has 4550 states and 10626 transitions. [2019-10-22 08:54:38,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:54:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 4550 states and 10626 transitions. [2019-10-22 08:54:38,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 08:54:38,581 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:38,581 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:38,581 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:38,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:38,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1561168359, now seen corresponding path program 1 times [2019-10-22 08:54:38,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:38,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260675773] [2019-10-22 08:54:38,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:38,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:38,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:38,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:38,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260675773] [2019-10-22 08:54:38,642 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:38,642 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:38,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337583187] [2019-10-22 08:54:38,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:54:38,643 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:38,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:38,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:38,643 INFO L87 Difference]: Start difference. First operand 4550 states and 10626 transitions. Second operand 5 states. [2019-10-22 08:54:38,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:38,835 INFO L93 Difference]: Finished difference Result 5311 states and 12252 transitions. [2019-10-22 08:54:38,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:54:38,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-10-22 08:54:38,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:38,839 INFO L225 Difference]: With dead ends: 5311 [2019-10-22 08:54:38,839 INFO L226 Difference]: Without dead ends: 5277 [2019-10-22 08:54:38,840 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-10-22 08:54:38,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5277 states. [2019-10-22 08:54:38,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5277 to 4703. [2019-10-22 08:54:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4703 states. [2019-10-22 08:54:38,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4703 states to 4703 states and 10927 transitions. [2019-10-22 08:54:38,882 INFO L78 Accepts]: Start accepts. Automaton has 4703 states and 10927 transitions. Word has length 82 [2019-10-22 08:54:38,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:38,882 INFO L462 AbstractCegarLoop]: Abstraction has 4703 states and 10927 transitions. [2019-10-22 08:54:38,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:54:38,882 INFO L276 IsEmpty]: Start isEmpty. Operand 4703 states and 10927 transitions. [2019-10-22 08:54:38,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 08:54:38,886 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:38,887 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:38,887 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:38,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:38,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1723385949, now seen corresponding path program 2 times [2019-10-22 08:54:38,887 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:38,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159984339] [2019-10-22 08:54:38,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:38,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:38,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:39,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:39,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159984339] [2019-10-22 08:54:39,027 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:39,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:54:39,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423532225] [2019-10-22 08:54:39,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:54:39,028 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:39,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:39,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:39,028 INFO L87 Difference]: Start difference. First operand 4703 states and 10927 transitions. Second operand 6 states. [2019-10-22 08:54:39,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:39,251 INFO L93 Difference]: Finished difference Result 6239 states and 14549 transitions. [2019-10-22 08:54:39,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:54:39,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-22 08:54:39,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:39,258 INFO L225 Difference]: With dead ends: 6239 [2019-10-22 08:54:39,258 INFO L226 Difference]: Without dead ends: 6207 [2019-10-22 08:54:39,259 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:54:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6207 states. [2019-10-22 08:54:39,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6207 to 5729. [2019-10-22 08:54:39,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5729 states. [2019-10-22 08:54:39,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5729 states to 5729 states and 13383 transitions. [2019-10-22 08:54:39,312 INFO L78 Accepts]: Start accepts. Automaton has 5729 states and 13383 transitions. Word has length 82 [2019-10-22 08:54:39,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:39,312 INFO L462 AbstractCegarLoop]: Abstraction has 5729 states and 13383 transitions. [2019-10-22 08:54:39,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:54:39,312 INFO L276 IsEmpty]: Start isEmpty. Operand 5729 states and 13383 transitions. [2019-10-22 08:54:39,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 08:54:39,317 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:39,317 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:39,317 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:39,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:39,318 INFO L82 PathProgramCache]: Analyzing trace with hash 774629988, now seen corresponding path program 1 times [2019-10-22 08:54:39,318 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:39,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596884094] [2019-10-22 08:54:39,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:39,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:39,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:39,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:39,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596884094] [2019-10-22 08:54:39,390 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:39,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:54:39,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120830755] [2019-10-22 08:54:39,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:54:39,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:39,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:54:39,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:54:39,391 INFO L87 Difference]: Start difference. First operand 5729 states and 13383 transitions. Second operand 7 states. [2019-10-22 08:54:39,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:39,748 INFO L93 Difference]: Finished difference Result 9219 states and 22127 transitions. [2019-10-22 08:54:39,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:54:39,748 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-10-22 08:54:39,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:39,756 INFO L225 Difference]: With dead ends: 9219 [2019-10-22 08:54:39,756 INFO L226 Difference]: Without dead ends: 9219 [2019-10-22 08:54:39,756 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:54:39,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9219 states. [2019-10-22 08:54:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9219 to 6534. [2019-10-22 08:54:39,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6534 states. [2019-10-22 08:54:39,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6534 states to 6534 states and 15443 transitions. [2019-10-22 08:54:39,832 INFO L78 Accepts]: Start accepts. Automaton has 6534 states and 15443 transitions. Word has length 82 [2019-10-22 08:54:39,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:39,833 INFO L462 AbstractCegarLoop]: Abstraction has 6534 states and 15443 transitions. [2019-10-22 08:54:39,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:54:39,833 INFO L276 IsEmpty]: Start isEmpty. Operand 6534 states and 15443 transitions. [2019-10-22 08:54:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 08:54:39,841 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:39,841 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:39,841 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:39,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:39,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1662133669, now seen corresponding path program 1 times [2019-10-22 08:54:39,841 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:39,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994298759] [2019-10-22 08:54:39,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:39,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:39,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:39,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:39,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994298759] [2019-10-22 08:54:39,924 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:39,924 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:54:39,924 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272564714] [2019-10-22 08:54:39,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:54:39,925 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:39,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:39,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:39,925 INFO L87 Difference]: Start difference. First operand 6534 states and 15443 transitions. Second operand 6 states. [2019-10-22 08:54:39,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:39,993 INFO L93 Difference]: Finished difference Result 7654 states and 18110 transitions. [2019-10-22 08:54:39,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:54:39,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-22 08:54:39,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:40,002 INFO L225 Difference]: With dead ends: 7654 [2019-10-22 08:54:40,002 INFO L226 Difference]: Without dead ends: 7654 [2019-10-22 08:54:40,003 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:40,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7654 states. [2019-10-22 08:54:40,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7654 to 5853. [2019-10-22 08:54:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5853 states. [2019-10-22 08:54:40,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5853 states to 5853 states and 13679 transitions. [2019-10-22 08:54:40,064 INFO L78 Accepts]: Start accepts. Automaton has 5853 states and 13679 transitions. Word has length 82 [2019-10-22 08:54:40,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:40,064 INFO L462 AbstractCegarLoop]: Abstraction has 5853 states and 13679 transitions. [2019-10-22 08:54:40,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:54:40,064 INFO L276 IsEmpty]: Start isEmpty. Operand 5853 states and 13679 transitions. [2019-10-22 08:54:40,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 08:54:40,069 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:40,069 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:40,069 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:40,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:40,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1302579355, now seen corresponding path program 1 times [2019-10-22 08:54:40,070 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:40,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325704083] [2019-10-22 08:54:40,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:40,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:40,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:40,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:40,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325704083] [2019-10-22 08:54:40,153 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:40,153 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:54:40,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826461640] [2019-10-22 08:54:40,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:54:40,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:40,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:40,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:40,154 INFO L87 Difference]: Start difference. First operand 5853 states and 13679 transitions. Second operand 6 states. [2019-10-22 08:54:40,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:40,290 INFO L93 Difference]: Finished difference Result 5629 states and 12895 transitions. [2019-10-22 08:54:40,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:54:40,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-22 08:54:40,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:40,296 INFO L225 Difference]: With dead ends: 5629 [2019-10-22 08:54:40,297 INFO L226 Difference]: Without dead ends: 5629 [2019-10-22 08:54:40,297 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:54:40,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5629 states. [2019-10-22 08:54:40,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5629 to 3166. [2019-10-22 08:54:40,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3166 states. [2019-10-22 08:54:40,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3166 states to 3166 states and 7283 transitions. [2019-10-22 08:54:40,336 INFO L78 Accepts]: Start accepts. Automaton has 3166 states and 7283 transitions. Word has length 82 [2019-10-22 08:54:40,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:40,336 INFO L462 AbstractCegarLoop]: Abstraction has 3166 states and 7283 transitions. [2019-10-22 08:54:40,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:54:40,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3166 states and 7283 transitions. [2019-10-22 08:54:40,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:54:40,339 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:40,339 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] [2019-10-22 08:54:40,339 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:40,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:40,340 INFO L82 PathProgramCache]: Analyzing trace with hash -45679541, now seen corresponding path program 1 times [2019-10-22 08:54:40,340 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:40,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428247659] [2019-10-22 08:54:40,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:40,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:40,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:40,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-10-22 08:54:40,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428247659] [2019-10-22 08:54:40,405 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:40,405 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:54:40,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230963462] [2019-10-22 08:54:40,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:54:40,405 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:40,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:40,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:40,406 INFO L87 Difference]: Start difference. First operand 3166 states and 7283 transitions. Second operand 6 states. [2019-10-22 08:54:40,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:40,606 INFO L93 Difference]: Finished difference Result 3303 states and 7557 transitions. [2019-10-22 08:54:40,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:54:40,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-10-22 08:54:40,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:40,611 INFO L225 Difference]: With dead ends: 3303 [2019-10-22 08:54:40,611 INFO L226 Difference]: Without dead ends: 3303 [2019-10-22 08:54:40,612 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:54:40,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3303 states. [2019-10-22 08:54:40,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3303 to 3107. [2019-10-22 08:54:40,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3107 states. [2019-10-22 08:54:40,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3107 states to 3107 states and 7140 transitions. [2019-10-22 08:54:40,656 INFO L78 Accepts]: Start accepts. Automaton has 3107 states and 7140 transitions. Word has length 84 [2019-10-22 08:54:40,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:40,657 INFO L462 AbstractCegarLoop]: Abstraction has 3107 states and 7140 transitions. [2019-10-22 08:54:40,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:54:40,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3107 states and 7140 transitions. [2019-10-22 08:54:40,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:54:40,660 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:40,661 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] [2019-10-22 08:54:40,661 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:40,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:40,662 INFO L82 PathProgramCache]: Analyzing trace with hash -968363124, now seen corresponding path program 1 times [2019-10-22 08:54:40,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:40,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196737817] [2019-10-22 08:54:40,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:40,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:40,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:40,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:40,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196737817] [2019-10-22 08:54:40,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:40,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:40,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434732293] [2019-10-22 08:54:40,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:54:40,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:40,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:40,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:40,746 INFO L87 Difference]: Start difference. First operand 3107 states and 7140 transitions. Second operand 5 states. [2019-10-22 08:54:40,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:40,777 INFO L93 Difference]: Finished difference Result 3107 states and 7124 transitions. [2019-10-22 08:54:40,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:54:40,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-10-22 08:54:40,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:40,782 INFO L225 Difference]: With dead ends: 3107 [2019-10-22 08:54:40,782 INFO L226 Difference]: Without dead ends: 3107 [2019-10-22 08:54:40,782 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:40,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2019-10-22 08:54:40,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 3107. [2019-10-22 08:54:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3107 states. [2019-10-22 08:54:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3107 states to 3107 states and 7124 transitions. [2019-10-22 08:54:40,823 INFO L78 Accepts]: Start accepts. Automaton has 3107 states and 7124 transitions. Word has length 84 [2019-10-22 08:54:40,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:40,823 INFO L462 AbstractCegarLoop]: Abstraction has 3107 states and 7124 transitions. [2019-10-22 08:54:40,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:54:40,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3107 states and 7124 transitions. [2019-10-22 08:54:40,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:54:40,827 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:40,827 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] [2019-10-22 08:54:40,828 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:40,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:40,828 INFO L82 PathProgramCache]: Analyzing trace with hash -80859443, now seen corresponding path program 1 times [2019-10-22 08:54:40,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:40,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564287477] [2019-10-22 08:54:40,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:40,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:40,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:40,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:40,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564287477] [2019-10-22 08:54:40,959 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:40,959 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 08:54:40,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960829410] [2019-10-22 08:54:40,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 08:54:40,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:40,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:54:40,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:54:40,960 INFO L87 Difference]: Start difference. First operand 3107 states and 7124 transitions. Second operand 9 states. [2019-10-22 08:54:41,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:41,472 INFO L93 Difference]: Finished difference Result 11347 states and 26362 transitions. [2019-10-22 08:54:41,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-22 08:54:41,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-10-22 08:54:41,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:41,481 INFO L225 Difference]: With dead ends: 11347 [2019-10-22 08:54:41,481 INFO L226 Difference]: Without dead ends: 7278 [2019-10-22 08:54:41,482 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-10-22 08:54:41,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7278 states. [2019-10-22 08:54:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7278 to 3251. [2019-10-22 08:54:41,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3251 states. [2019-10-22 08:54:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 3251 states and 7425 transitions. [2019-10-22 08:54:41,529 INFO L78 Accepts]: Start accepts. Automaton has 3251 states and 7425 transitions. Word has length 84 [2019-10-22 08:54:41,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:41,530 INFO L462 AbstractCegarLoop]: Abstraction has 3251 states and 7425 transitions. [2019-10-22 08:54:41,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 08:54:41,530 INFO L276 IsEmpty]: Start isEmpty. Operand 3251 states and 7425 transitions. [2019-10-22 08:54:41,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:54:41,532 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:41,532 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] [2019-10-22 08:54:41,533 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:41,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:41,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1751283177, now seen corresponding path program 2 times [2019-10-22 08:54:41,533 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:41,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901578277] [2019-10-22 08:54:41,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:41,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:41,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:41,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:41,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901578277] [2019-10-22 08:54:41,633 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:41,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:54:41,634 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114471283] [2019-10-22 08:54:41,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:54:41,634 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:41,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:54:41,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:54:41,635 INFO L87 Difference]: Start difference. First operand 3251 states and 7425 transitions. Second operand 7 states. [2019-10-22 08:54:41,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:41,694 INFO L93 Difference]: Finished difference Result 5539 states and 12710 transitions. [2019-10-22 08:54:41,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:54:41,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-10-22 08:54:41,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:41,696 INFO L225 Difference]: With dead ends: 5539 [2019-10-22 08:54:41,696 INFO L226 Difference]: Without dead ends: 2392 [2019-10-22 08:54:41,697 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:54:41,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-10-22 08:54:41,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 2392. [2019-10-22 08:54:41,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2392 states. [2019-10-22 08:54:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 5471 transitions. [2019-10-22 08:54:41,718 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 5471 transitions. Word has length 84 [2019-10-22 08:54:41,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:41,718 INFO L462 AbstractCegarLoop]: Abstraction has 2392 states and 5471 transitions. [2019-10-22 08:54:41,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:54:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 5471 transitions. [2019-10-22 08:54:41,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:54:41,720 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:41,720 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] [2019-10-22 08:54:41,720 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:41,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:41,721 INFO L82 PathProgramCache]: Analyzing trace with hash 216408745, now seen corresponding path program 3 times [2019-10-22 08:54:41,721 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:41,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426750959] [2019-10-22 08:54:41,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:41,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:41,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:41,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426750959] [2019-10-22 08:54:41,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:41,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 08:54:41,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643382835] [2019-10-22 08:54:41,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 08:54:41,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:41,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:54:41,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:54:41,854 INFO L87 Difference]: Start difference. First operand 2392 states and 5471 transitions. Second operand 10 states. [2019-10-22 08:54:42,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:42,145 INFO L93 Difference]: Finished difference Result 3957 states and 9110 transitions. [2019-10-22 08:54:42,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-22 08:54:42,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2019-10-22 08:54:42,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:42,148 INFO L225 Difference]: With dead ends: 3957 [2019-10-22 08:54:42,148 INFO L226 Difference]: Without dead ends: 2566 [2019-10-22 08:54:42,148 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-10-22 08:54:42,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2019-10-22 08:54:42,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2372. [2019-10-22 08:54:42,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2372 states. [2019-10-22 08:54:42,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 5429 transitions. [2019-10-22 08:54:42,177 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 5429 transitions. Word has length 84 [2019-10-22 08:54:42,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:42,177 INFO L462 AbstractCegarLoop]: Abstraction has 2372 states and 5429 transitions. [2019-10-22 08:54:42,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 08:54:42,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 5429 transitions. [2019-10-22 08:54:42,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:54:42,180 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:42,180 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] [2019-10-22 08:54:42,180 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:42,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:42,181 INFO L82 PathProgramCache]: Analyzing trace with hash -2108825047, now seen corresponding path program 4 times [2019-10-22 08:54:42,181 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:42,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444023060] [2019-10-22 08:54:42,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:42,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:42,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:42,246 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:42,246 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 08:54:42,376 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-10-22 08:54:42,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:54:42 BasicIcfg [2019-10-22 08:54:42,383 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:54:42,383 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:42,383 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:42,384 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:42,384 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:12" (3/4) ... [2019-10-22 08:54:42,386 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 08:54:42,492 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ccbf1088-3e52-409f-bec9-3656a3700810/bin/uautomizer/witness.graphml [2019-10-22 08:54:42,496 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:42,498 INFO L168 Benchmark]: Toolchain (without parser) took 30846.76 ms. Allocated memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: 2.8 GB). Free memory was 944.5 MB in the beginning and 1.7 GB in the end (delta: -767.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-10-22 08:54:42,499 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:42,499 INFO L168 Benchmark]: CACSL2BoogieTranslator took 647.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:42,499 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:42,499 INFO L168 Benchmark]: Boogie Preprocessor took 35.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:42,500 INFO L168 Benchmark]: RCFGBuilder took 578.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:42,500 INFO L168 Benchmark]: TraceAbstraction took 29419.22 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.6 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -667.4 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-10-22 08:54:42,500 INFO L168 Benchmark]: Witness Printer took 113.21 ms. Allocated memory is still 3.8 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:42,502 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 647.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 578.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29419.22 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.6 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -667.4 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 113.21 ms. Allocated memory is still 3.8 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L707] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L708] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L709] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L710] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L711] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L712] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L713] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L714] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L715] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L716] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L717] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L718] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L719] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L723] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L799] 0 pthread_t t1635; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L800] FCALL, FORK 0 pthread_create(&t1635, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] 0 pthread_t t1636; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] FCALL, FORK 0 pthread_create(&t1636, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L780] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L742] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = x$flush_delayed ? x$mem_tmp : x [L745] 1 x$flush_delayed = (_Bool)0 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 199 locations, 3 error locations. Result: UNSAFE, OverallTime: 29.2s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7371 SDtfs, 8361 SDslu, 18473 SDs, 0 SdLazy, 5177 SolverSat, 365 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 71 SyntacticMatches, 13 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61472occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 72978 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1897 NumberOfCodeBlocks, 1897 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1786 ConstructedInterpolants, 0 QuantifiedInterpolants, 364582 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...