./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.02.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_47cca3e4-93f9-4744-9f63-03187655fdfb/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_47cca3e4-93f9-4744-9f63-03187655fdfb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_47cca3e4-93f9-4744-9f63-03187655fdfb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_47cca3e4-93f9-4744-9f63-03187655fdfb/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.02.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_47cca3e4-93f9-4744-9f63-03187655fdfb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_47cca3e4-93f9-4744-9f63-03187655fdfb/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5c6676c90977e408adf03f66d7ae0804453cb34e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.2.0-a4ecdab [2020-11-28 03:01:06,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:01:06,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:01:07,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:01:07,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:01:07,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:01:07,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:01:07,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:01:07,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:01:07,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:01:07,081 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:01:07,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:01:07,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:01:07,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:01:07,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:01:07,098 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:01:07,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:01:07,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:01:07,113 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:01:07,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:01:07,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:01:07,135 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:01:07,137 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:01:07,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:01:07,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:01:07,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:01:07,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:01:07,145 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:01:07,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:01:07,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:01:07,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:01:07,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:01:07,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:01:07,156 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:01:07,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:01:07,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:01:07,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:01:07,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:01:07,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:01:07,162 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:01:07,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:01:07,168 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_47cca3e4-93f9-4744-9f63-03187655fdfb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 03:01:07,222 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:01:07,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:01:07,225 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:01:07,225 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:01:07,226 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:01:07,226 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:01:07,226 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:01:07,226 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:01:07,227 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:01:07,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:01:07,228 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 03:01:07,229 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 03:01:07,229 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 03:01:07,229 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:01:07,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:01:07,230 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:01:07,230 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 03:01:07,230 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:01:07,231 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:01:07,231 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 03:01:07,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 03:01:07,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:01:07,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:01:07,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 03:01:07,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 03:01:07,233 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:01:07,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 03:01:07,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 03:01:07,233 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:01:07,234 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_47cca3e4-93f9-4744-9f63-03187655fdfb/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_47cca3e4-93f9-4744-9f63-03187655fdfb/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(reach_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 -> 5c6676c90977e408adf03f66d7ae0804453cb34e [2020-11-28 03:01:07,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:01:07,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:01:07,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:01:07,577 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:01:07,579 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:01:07,580 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_47cca3e4-93f9-4744-9f63-03187655fdfb/bin/uautomizer/../../sv-benchmarks/c/systemc/transmitter.02.cil.c [2020-11-28 03:01:07,674 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_47cca3e4-93f9-4744-9f63-03187655fdfb/bin/uautomizer/data/e0c2c8efc/2f15e87f7734444e873e26ffb193997b/FLAG9376ecc4b [2020-11-28 03:01:08,267 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:01:08,268 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_47cca3e4-93f9-4744-9f63-03187655fdfb/sv-benchmarks/c/systemc/transmitter.02.cil.c [2020-11-28 03:01:08,288 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_47cca3e4-93f9-4744-9f63-03187655fdfb/bin/uautomizer/data/e0c2c8efc/2f15e87f7734444e873e26ffb193997b/FLAG9376ecc4b [2020-11-28 03:01:08,607 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_47cca3e4-93f9-4744-9f63-03187655fdfb/bin/uautomizer/data/e0c2c8efc/2f15e87f7734444e873e26ffb193997b [2020-11-28 03:01:08,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:01:08,619 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:01:08,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:01:08,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:01:08,626 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:01:08,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:01:08" (1/1) ... [2020-11-28 03:01:08,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5961736b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:08, skipping insertion in model container [2020-11-28 03:01:08,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:01:08" (1/1) ... [2020-11-28 03:01:08,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:01:08,691 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:01:09,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:01:09,071 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:01:09,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:01:09,197 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:01:09,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:09 WrapperNode [2020-11-28 03:01:09,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:01:09,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:01:09,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:01:09,199 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:01:09,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:09" (1/1) ... [2020-11-28 03:01:09,219 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:09" (1/1) ... [2020-11-28 03:01:09,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:01:09,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:01:09,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:01:09,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:01:09,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:09" (1/1) ... [2020-11-28 03:01:09,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:09" (1/1) ... [2020-11-28 03:01:09,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:09" (1/1) ... [2020-11-28 03:01:09,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:09" (1/1) ... [2020-11-28 03:01:09,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:09" (1/1) ... [2020-11-28 03:01:09,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:09" (1/1) ... [2020-11-28 03:01:09,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:09" (1/1) ... [2020-11-28 03:01:09,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:01:09,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:01:09,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:01:09,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:01:09,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_47cca3e4-93f9-4744-9f63-03187655fdfb/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 [2020-11-28 03:01:09,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:01:09,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:01:09,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:01:09,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:01:10,612 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:01:10,612 INFO L298 CfgBuilder]: Removed 96 assume(true) statements. [2020-11-28 03:01:10,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:01:10 BoogieIcfgContainer [2020-11-28 03:01:10,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:01:10,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 03:01:10,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 03:01:10,620 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 03:01:10,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:01:08" (1/3) ... [2020-11-28 03:01:10,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c2502af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:01:10, skipping insertion in model container [2020-11-28 03:01:10,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:09" (2/3) ... [2020-11-28 03:01:10,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c2502af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:01:10, skipping insertion in model container [2020-11-28 03:01:10,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:01:10" (3/3) ... [2020-11-28 03:01:10,623 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2020-11-28 03:01:10,634 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 03:01:10,638 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-28 03:01:10,650 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-28 03:01:10,686 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 03:01:10,686 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 03:01:10,686 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 03:01:10,687 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:01:10,687 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:01:10,687 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 03:01:10,687 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:01:10,687 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 03:01:10,715 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states. [2020-11-28 03:01:10,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-28 03:01:10,722 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:10,723 INFO L422 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] [2020-11-28 03:01:10,723 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:10,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:10,727 INFO L82 PathProgramCache]: Analyzing trace with hash 550865253, now seen corresponding path program 1 times [2020-11-28 03:01:10,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:10,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99094036] [2020-11-28 03:01:10,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:10,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:10,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99094036] [2020-11-28 03:01:10,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:10,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:01:10,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909506899] [2020-11-28 03:01:10,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:10,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:10,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:10,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:10,975 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 3 states. [2020-11-28 03:01:11,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:11,076 INFO L93 Difference]: Finished difference Result 380 states and 596 transitions. [2020-11-28 03:01:11,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:11,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-11-28 03:01:11,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:11,111 INFO L225 Difference]: With dead ends: 380 [2020-11-28 03:01:11,113 INFO L226 Difference]: Without dead ends: 188 [2020-11-28 03:01:11,118 INFO L677 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 [2020-11-28 03:01:11,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-11-28 03:01:11,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2020-11-28 03:01:11,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-11-28 03:01:11,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 283 transitions. [2020-11-28 03:01:11,220 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 283 transitions. Word has length 49 [2020-11-28 03:01:11,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:11,220 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 283 transitions. [2020-11-28 03:01:11,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:11,222 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 283 transitions. [2020-11-28 03:01:11,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-28 03:01:11,224 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:11,225 INFO L422 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] [2020-11-28 03:01:11,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 03:01:11,225 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:11,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:11,229 INFO L82 PathProgramCache]: Analyzing trace with hash -342621085, now seen corresponding path program 1 times [2020-11-28 03:01:11,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:11,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449962552] [2020-11-28 03:01:11,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:11,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:11,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449962552] [2020-11-28 03:01:11,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:11,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:01:11,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681083911] [2020-11-28 03:01:11,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:11,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:11,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:11,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:11,354 INFO L87 Difference]: Start difference. First operand 188 states and 283 transitions. Second operand 3 states. [2020-11-28 03:01:11,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:11,524 INFO L93 Difference]: Finished difference Result 498 states and 749 transitions. [2020-11-28 03:01:11,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:11,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-11-28 03:01:11,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:11,527 INFO L225 Difference]: With dead ends: 498 [2020-11-28 03:01:11,528 INFO L226 Difference]: Without dead ends: 317 [2020-11-28 03:01:11,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:11,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-11-28 03:01:11,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 315. [2020-11-28 03:01:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-11-28 03:01:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 467 transitions. [2020-11-28 03:01:11,576 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 467 transitions. Word has length 49 [2020-11-28 03:01:11,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:11,577 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 467 transitions. [2020-11-28 03:01:11,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:11,577 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 467 transitions. [2020-11-28 03:01:11,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-28 03:01:11,582 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:11,583 INFO L422 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] [2020-11-28 03:01:11,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 03:01:11,584 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:11,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:11,585 INFO L82 PathProgramCache]: Analyzing trace with hash -2057662813, now seen corresponding path program 1 times [2020-11-28 03:01:11,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:11,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898526635] [2020-11-28 03:01:11,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:11,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:11,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898526635] [2020-11-28 03:01:11,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:11,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:01:11,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333965634] [2020-11-28 03:01:11,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:11,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:11,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:11,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:11,728 INFO L87 Difference]: Start difference. First operand 315 states and 467 transitions. Second operand 3 states. [2020-11-28 03:01:11,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:11,778 INFO L93 Difference]: Finished difference Result 622 states and 923 transitions. [2020-11-28 03:01:11,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:11,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-11-28 03:01:11,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:11,781 INFO L225 Difference]: With dead ends: 622 [2020-11-28 03:01:11,782 INFO L226 Difference]: Without dead ends: 315 [2020-11-28 03:01:11,784 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:11,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-11-28 03:01:11,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2020-11-28 03:01:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-11-28 03:01:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 459 transitions. [2020-11-28 03:01:11,804 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 459 transitions. Word has length 49 [2020-11-28 03:01:11,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:11,805 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 459 transitions. [2020-11-28 03:01:11,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:11,805 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 459 transitions. [2020-11-28 03:01:11,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-28 03:01:11,806 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:11,807 INFO L422 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] [2020-11-28 03:01:11,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 03:01:11,807 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:11,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:11,808 INFO L82 PathProgramCache]: Analyzing trace with hash 796507235, now seen corresponding path program 1 times [2020-11-28 03:01:11,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:11,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443243020] [2020-11-28 03:01:11,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:11,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:11,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443243020] [2020-11-28 03:01:11,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:11,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:01:11,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522620783] [2020-11-28 03:01:11,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:11,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:11,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:11,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:11,854 INFO L87 Difference]: Start difference. First operand 315 states and 459 transitions. Second operand 3 states. [2020-11-28 03:01:11,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:11,897 INFO L93 Difference]: Finished difference Result 621 states and 906 transitions. [2020-11-28 03:01:11,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:11,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-11-28 03:01:11,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:11,900 INFO L225 Difference]: With dead ends: 621 [2020-11-28 03:01:11,900 INFO L226 Difference]: Without dead ends: 315 [2020-11-28 03:01:11,901 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:11,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-11-28 03:01:11,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2020-11-28 03:01:11,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-11-28 03:01:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 451 transitions. [2020-11-28 03:01:11,917 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 451 transitions. Word has length 49 [2020-11-28 03:01:11,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:11,918 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 451 transitions. [2020-11-28 03:01:11,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:11,918 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 451 transitions. [2020-11-28 03:01:11,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-28 03:01:11,919 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:11,919 INFO L422 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] [2020-11-28 03:01:11,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 03:01:11,919 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:11,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:11,920 INFO L82 PathProgramCache]: Analyzing trace with hash -773990749, now seen corresponding path program 1 times [2020-11-28 03:01:11,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:11,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070738457] [2020-11-28 03:01:11,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:11,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070738457] [2020-11-28 03:01:11,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:11,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:01:11,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810071292] [2020-11-28 03:01:11,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:11,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:11,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:11,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:11,994 INFO L87 Difference]: Start difference. First operand 315 states and 451 transitions. Second operand 3 states. [2020-11-28 03:01:12,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:12,065 INFO L93 Difference]: Finished difference Result 620 states and 889 transitions. [2020-11-28 03:01:12,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:12,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-11-28 03:01:12,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:12,069 INFO L225 Difference]: With dead ends: 620 [2020-11-28 03:01:12,069 INFO L226 Difference]: Without dead ends: 315 [2020-11-28 03:01:12,070 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:12,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-11-28 03:01:12,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2020-11-28 03:01:12,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-11-28 03:01:12,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 437 transitions. [2020-11-28 03:01:12,088 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 437 transitions. Word has length 49 [2020-11-28 03:01:12,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:12,088 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 437 transitions. [2020-11-28 03:01:12,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:12,088 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 437 transitions. [2020-11-28 03:01:12,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-28 03:01:12,089 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:12,089 INFO L422 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] [2020-11-28 03:01:12,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 03:01:12,090 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:12,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:12,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1210649628, now seen corresponding path program 1 times [2020-11-28 03:01:12,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:12,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919489824] [2020-11-28 03:01:12,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:12,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:12,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919489824] [2020-11-28 03:01:12,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:12,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:01:12,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431638431] [2020-11-28 03:01:12,140 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:12,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:12,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:12,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:12,141 INFO L87 Difference]: Start difference. First operand 315 states and 437 transitions. Second operand 3 states. [2020-11-28 03:01:12,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:12,191 INFO L93 Difference]: Finished difference Result 619 states and 860 transitions. [2020-11-28 03:01:12,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:12,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-11-28 03:01:12,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:12,194 INFO L225 Difference]: With dead ends: 619 [2020-11-28 03:01:12,194 INFO L226 Difference]: Without dead ends: 315 [2020-11-28 03:01:12,195 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:12,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-11-28 03:01:12,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2020-11-28 03:01:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-11-28 03:01:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 423 transitions. [2020-11-28 03:01:12,211 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 423 transitions. Word has length 49 [2020-11-28 03:01:12,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:12,212 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 423 transitions. [2020-11-28 03:01:12,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:12,212 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 423 transitions. [2020-11-28 03:01:12,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-28 03:01:12,212 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:12,213 INFO L422 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] [2020-11-28 03:01:12,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 03:01:12,213 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:12,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:12,213 INFO L82 PathProgramCache]: Analyzing trace with hash 217882148, now seen corresponding path program 1 times [2020-11-28 03:01:12,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:12,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775933787] [2020-11-28 03:01:12,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:12,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775933787] [2020-11-28 03:01:12,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:12,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:01:12,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588204713] [2020-11-28 03:01:12,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:01:12,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:12,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:01:12,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:01:12,271 INFO L87 Difference]: Start difference. First operand 315 states and 423 transitions. Second operand 5 states. [2020-11-28 03:01:12,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:12,454 INFO L93 Difference]: Finished difference Result 1006 states and 1358 transitions. [2020-11-28 03:01:12,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:01:12,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2020-11-28 03:01:12,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:12,460 INFO L225 Difference]: With dead ends: 1006 [2020-11-28 03:01:12,460 INFO L226 Difference]: Without dead ends: 709 [2020-11-28 03:01:12,461 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:01:12,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2020-11-28 03:01:12,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 327. [2020-11-28 03:01:12,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2020-11-28 03:01:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 431 transitions. [2020-11-28 03:01:12,489 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 431 transitions. Word has length 49 [2020-11-28 03:01:12,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:12,489 INFO L481 AbstractCegarLoop]: Abstraction has 327 states and 431 transitions. [2020-11-28 03:01:12,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:01:12,490 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 431 transitions. [2020-11-28 03:01:12,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-28 03:01:12,490 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:12,491 INFO L422 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] [2020-11-28 03:01:12,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 03:01:12,491 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:12,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:12,492 INFO L82 PathProgramCache]: Analyzing trace with hash 145495590, now seen corresponding path program 1 times [2020-11-28 03:01:12,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:12,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094261164] [2020-11-28 03:01:12,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:12,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094261164] [2020-11-28 03:01:12,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:12,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:01:12,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106626424] [2020-11-28 03:01:12,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:01:12,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:12,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:01:12,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:01:12,557 INFO L87 Difference]: Start difference. First operand 327 states and 431 transitions. Second operand 5 states. [2020-11-28 03:01:12,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:12,716 INFO L93 Difference]: Finished difference Result 870 states and 1159 transitions. [2020-11-28 03:01:12,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:01:12,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2020-11-28 03:01:12,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:12,720 INFO L225 Difference]: With dead ends: 870 [2020-11-28 03:01:12,721 INFO L226 Difference]: Without dead ends: 568 [2020-11-28 03:01:12,721 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:01:12,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-11-28 03:01:12,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 333. [2020-11-28 03:01:12,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-11-28 03:01:12,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 431 transitions. [2020-11-28 03:01:12,757 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 431 transitions. Word has length 49 [2020-11-28 03:01:12,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:12,758 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 431 transitions. [2020-11-28 03:01:12,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:01:12,759 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 431 transitions. [2020-11-28 03:01:12,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-28 03:01:12,759 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:12,759 INFO L422 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] [2020-11-28 03:01:12,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 03:01:12,760 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:12,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:12,760 INFO L82 PathProgramCache]: Analyzing trace with hash 2068723624, now seen corresponding path program 1 times [2020-11-28 03:01:12,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:12,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842587879] [2020-11-28 03:01:12,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:12,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842587879] [2020-11-28 03:01:12,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:12,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:01:12,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606501745] [2020-11-28 03:01:12,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:01:12,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:12,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:01:12,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:01:12,838 INFO L87 Difference]: Start difference. First operand 333 states and 431 transitions. Second operand 5 states. [2020-11-28 03:01:12,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:13,000 INFO L93 Difference]: Finished difference Result 895 states and 1173 transitions. [2020-11-28 03:01:13,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:01:13,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2020-11-28 03:01:13,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:13,006 INFO L225 Difference]: With dead ends: 895 [2020-11-28 03:01:13,006 INFO L226 Difference]: Without dead ends: 594 [2020-11-28 03:01:13,008 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:01:13,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-11-28 03:01:13,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 339. [2020-11-28 03:01:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2020-11-28 03:01:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 431 transitions. [2020-11-28 03:01:13,038 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 431 transitions. Word has length 49 [2020-11-28 03:01:13,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:13,038 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 431 transitions. [2020-11-28 03:01:13,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:01:13,038 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 431 transitions. [2020-11-28 03:01:13,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-28 03:01:13,039 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:13,039 INFO L422 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] [2020-11-28 03:01:13,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 03:01:13,039 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:13,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:13,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1803541846, now seen corresponding path program 1 times [2020-11-28 03:01:13,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:13,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18138523] [2020-11-28 03:01:13,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:13,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:13,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18138523] [2020-11-28 03:01:13,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:13,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:01:13,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576231361] [2020-11-28 03:01:13,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:13,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:13,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:13,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:13,109 INFO L87 Difference]: Start difference. First operand 339 states and 431 transitions. Second operand 3 states. [2020-11-28 03:01:13,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:13,237 INFO L93 Difference]: Finished difference Result 919 states and 1163 transitions. [2020-11-28 03:01:13,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:13,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-11-28 03:01:13,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:13,247 INFO L225 Difference]: With dead ends: 919 [2020-11-28 03:01:13,247 INFO L226 Difference]: Without dead ends: 617 [2020-11-28 03:01:13,248 INFO L677 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 [2020-11-28 03:01:13,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-11-28 03:01:13,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 595. [2020-11-28 03:01:13,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2020-11-28 03:01:13,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 741 transitions. [2020-11-28 03:01:13,314 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 741 transitions. Word has length 49 [2020-11-28 03:01:13,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:13,316 INFO L481 AbstractCegarLoop]: Abstraction has 595 states and 741 transitions. [2020-11-28 03:01:13,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:13,316 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 741 transitions. [2020-11-28 03:01:13,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-28 03:01:13,317 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:13,317 INFO L422 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] [2020-11-28 03:01:13,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 03:01:13,317 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:13,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:13,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1362638081, now seen corresponding path program 1 times [2020-11-28 03:01:13,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:13,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21952991] [2020-11-28 03:01:13,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:13,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:13,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21952991] [2020-11-28 03:01:13,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:13,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:01:13,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585157487] [2020-11-28 03:01:13,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:13,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:13,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:13,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:13,389 INFO L87 Difference]: Start difference. First operand 595 states and 741 transitions. Second operand 3 states. [2020-11-28 03:01:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:13,520 INFO L93 Difference]: Finished difference Result 1513 states and 1891 transitions. [2020-11-28 03:01:13,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:13,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-11-28 03:01:13,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:13,528 INFO L225 Difference]: With dead ends: 1513 [2020-11-28 03:01:13,528 INFO L226 Difference]: Without dead ends: 988 [2020-11-28 03:01:13,529 INFO L677 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 [2020-11-28 03:01:13,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2020-11-28 03:01:13,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 986. [2020-11-28 03:01:13,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2020-11-28 03:01:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1218 transitions. [2020-11-28 03:01:13,641 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1218 transitions. Word has length 50 [2020-11-28 03:01:13,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:13,641 INFO L481 AbstractCegarLoop]: Abstraction has 986 states and 1218 transitions. [2020-11-28 03:01:13,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:13,642 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1218 transitions. [2020-11-28 03:01:13,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-28 03:01:13,642 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:13,642 INFO L422 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] [2020-11-28 03:01:13,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 03:01:13,643 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:13,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:13,643 INFO L82 PathProgramCache]: Analyzing trace with hash -497328611, now seen corresponding path program 1 times [2020-11-28 03:01:13,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:13,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675138898] [2020-11-28 03:01:13,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:13,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675138898] [2020-11-28 03:01:13,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:13,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:01:13,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896607080] [2020-11-28 03:01:13,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:13,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:13,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:13,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:13,698 INFO L87 Difference]: Start difference. First operand 986 states and 1218 transitions. Second operand 3 states. [2020-11-28 03:01:13,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:13,954 INFO L93 Difference]: Finished difference Result 2794 states and 3457 transitions. [2020-11-28 03:01:13,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:13,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-11-28 03:01:13,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:13,968 INFO L225 Difference]: With dead ends: 2794 [2020-11-28 03:01:13,968 INFO L226 Difference]: Without dead ends: 1858 [2020-11-28 03:01:13,970 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:13,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2020-11-28 03:01:14,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1842. [2020-11-28 03:01:14,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2020-11-28 03:01:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2252 transitions. [2020-11-28 03:01:14,163 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2252 transitions. Word has length 51 [2020-11-28 03:01:14,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:14,164 INFO L481 AbstractCegarLoop]: Abstraction has 1842 states and 2252 transitions. [2020-11-28 03:01:14,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:14,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2252 transitions. [2020-11-28 03:01:14,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-28 03:01:14,166 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:14,166 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:14,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 03:01:14,167 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:14,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:14,167 INFO L82 PathProgramCache]: Analyzing trace with hash -798137423, now seen corresponding path program 1 times [2020-11-28 03:01:14,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:14,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87920770] [2020-11-28 03:01:14,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:14,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87920770] [2020-11-28 03:01:14,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:14,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:01:14,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337336252] [2020-11-28 03:01:14,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:01:14,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:14,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:01:14,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:01:14,256 INFO L87 Difference]: Start difference. First operand 1842 states and 2252 transitions. Second operand 4 states. [2020-11-28 03:01:14,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:14,675 INFO L93 Difference]: Finished difference Result 5392 states and 6581 transitions. [2020-11-28 03:01:14,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:01:14,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-11-28 03:01:14,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:14,690 INFO L225 Difference]: With dead ends: 5392 [2020-11-28 03:01:14,690 INFO L226 Difference]: Without dead ends: 2716 [2020-11-28 03:01:14,696 INFO L677 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 [2020-11-28 03:01:14,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2020-11-28 03:01:14,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2716. [2020-11-28 03:01:14,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2020-11-28 03:01:14,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 3296 transitions. [2020-11-28 03:01:14,934 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 3296 transitions. Word has length 66 [2020-11-28 03:01:14,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:14,935 INFO L481 AbstractCegarLoop]: Abstraction has 2716 states and 3296 transitions. [2020-11-28 03:01:14,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:01:14,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 3296 transitions. [2020-11-28 03:01:14,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-28 03:01:14,944 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:14,944 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:14,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 03:01:14,945 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:14,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:14,945 INFO L82 PathProgramCache]: Analyzing trace with hash 280255658, now seen corresponding path program 1 times [2020-11-28 03:01:14,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:14,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595562831] [2020-11-28 03:01:14,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:15,010 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-28 03:01:15,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595562831] [2020-11-28 03:01:15,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:15,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:01:15,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190965815] [2020-11-28 03:01:15,012 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:15,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:15,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:15,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:15,013 INFO L87 Difference]: Start difference. First operand 2716 states and 3296 transitions. Second operand 3 states. [2020-11-28 03:01:15,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:15,312 INFO L93 Difference]: Finished difference Result 6156 states and 7455 transitions. [2020-11-28 03:01:15,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:15,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2020-11-28 03:01:15,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:15,331 INFO L225 Difference]: With dead ends: 6156 [2020-11-28 03:01:15,332 INFO L226 Difference]: Without dead ends: 3476 [2020-11-28 03:01:15,336 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:15,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2020-11-28 03:01:15,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 3452. [2020-11-28 03:01:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3452 states. [2020-11-28 03:01:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 4150 transitions. [2020-11-28 03:01:15,671 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 4150 transitions. Word has length 89 [2020-11-28 03:01:15,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:15,672 INFO L481 AbstractCegarLoop]: Abstraction has 3452 states and 4150 transitions. [2020-11-28 03:01:15,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:15,672 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 4150 transitions. [2020-11-28 03:01:15,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-11-28 03:01:15,675 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:15,675 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:15,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-28 03:01:15,675 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:15,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:15,676 INFO L82 PathProgramCache]: Analyzing trace with hash 724986355, now seen corresponding path program 1 times [2020-11-28 03:01:15,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:15,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430627949] [2020-11-28 03:01:15,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:15,745 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:15,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430627949] [2020-11-28 03:01:15,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:15,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:01:15,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923974871] [2020-11-28 03:01:15,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:01:15,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:15,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:01:15,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:01:15,747 INFO L87 Difference]: Start difference. First operand 3452 states and 4150 transitions. Second operand 4 states. [2020-11-28 03:01:16,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:16,124 INFO L93 Difference]: Finished difference Result 6102 states and 7374 transitions. [2020-11-28 03:01:16,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:01:16,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2020-11-28 03:01:16,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:16,142 INFO L225 Difference]: With dead ends: 6102 [2020-11-28 03:01:16,143 INFO L226 Difference]: Without dead ends: 3454 [2020-11-28 03:01:16,146 INFO L677 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 [2020-11-28 03:01:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3454 states. [2020-11-28 03:01:16,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3454 to 3452. [2020-11-28 03:01:16,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3452 states. [2020-11-28 03:01:16,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 4120 transitions. [2020-11-28 03:01:16,425 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 4120 transitions. Word has length 92 [2020-11-28 03:01:16,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:16,425 INFO L481 AbstractCegarLoop]: Abstraction has 3452 states and 4120 transitions. [2020-11-28 03:01:16,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:01:16,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 4120 transitions. [2020-11-28 03:01:16,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-11-28 03:01:16,429 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:16,429 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:16,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-28 03:01:16,430 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:16,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:16,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1737719815, now seen corresponding path program 1 times [2020-11-28 03:01:16,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:16,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724161986] [2020-11-28 03:01:16,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:16,474 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:16,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724161986] [2020-11-28 03:01:16,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:16,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:01:16,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803804300] [2020-11-28 03:01:16,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:16,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:16,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:16,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:16,476 INFO L87 Difference]: Start difference. First operand 3452 states and 4120 transitions. Second operand 3 states. [2020-11-28 03:01:16,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:16,759 INFO L93 Difference]: Finished difference Result 5607 states and 6726 transitions. [2020-11-28 03:01:16,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:16,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2020-11-28 03:01:16,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:16,779 INFO L225 Difference]: With dead ends: 5607 [2020-11-28 03:01:16,780 INFO L226 Difference]: Without dead ends: 3452 [2020-11-28 03:01:16,783 INFO L677 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 [2020-11-28 03:01:16,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3452 states. [2020-11-28 03:01:17,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3452 to 3438. [2020-11-28 03:01:17,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3438 states. [2020-11-28 03:01:17,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 4042 transitions. [2020-11-28 03:01:17,084 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 4042 transitions. Word has length 115 [2020-11-28 03:01:17,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:17,084 INFO L481 AbstractCegarLoop]: Abstraction has 3438 states and 4042 transitions. [2020-11-28 03:01:17,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:17,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 4042 transitions. [2020-11-28 03:01:17,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-11-28 03:01:17,088 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:17,089 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:17,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-28 03:01:17,089 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:17,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:17,090 INFO L82 PathProgramCache]: Analyzing trace with hash 2141342848, now seen corresponding path program 1 times [2020-11-28 03:01:17,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:17,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796398458] [2020-11-28 03:01:17,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-28 03:01:17,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796398458] [2020-11-28 03:01:17,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:17,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:01:17,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684947804] [2020-11-28 03:01:17,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:17,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:17,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:17,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:17,148 INFO L87 Difference]: Start difference. First operand 3438 states and 4042 transitions. Second operand 3 states. [2020-11-28 03:01:17,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:17,507 INFO L93 Difference]: Finished difference Result 7668 states and 8933 transitions. [2020-11-28 03:01:17,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:17,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-11-28 03:01:17,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:17,521 INFO L225 Difference]: With dead ends: 7668 [2020-11-28 03:01:17,521 INFO L226 Difference]: Without dead ends: 2540 [2020-11-28 03:01:17,527 INFO L677 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 [2020-11-28 03:01:17,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2020-11-28 03:01:17,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 2462. [2020-11-28 03:01:17,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2462 states. [2020-11-28 03:01:17,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 2756 transitions. [2020-11-28 03:01:17,685 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 2756 transitions. Word has length 116 [2020-11-28 03:01:17,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:17,685 INFO L481 AbstractCegarLoop]: Abstraction has 2462 states and 2756 transitions. [2020-11-28 03:01:17,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:17,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 2756 transitions. [2020-11-28 03:01:17,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-11-28 03:01:17,688 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:17,689 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:17,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-28 03:01:17,689 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:17,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:17,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1717534558, now seen corresponding path program 1 times [2020-11-28 03:01:17,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:17,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846858777] [2020-11-28 03:01:17,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:17,745 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:17,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846858777] [2020-11-28 03:01:17,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:17,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:01:17,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775415718] [2020-11-28 03:01:17,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:17,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:17,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:17,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:17,753 INFO L87 Difference]: Start difference. First operand 2462 states and 2756 transitions. Second operand 3 states. [2020-11-28 03:01:17,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:17,943 INFO L93 Difference]: Finished difference Result 4250 states and 4773 transitions. [2020-11-28 03:01:17,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:17,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2020-11-28 03:01:17,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:17,956 INFO L225 Difference]: With dead ends: 4250 [2020-11-28 03:01:17,956 INFO L226 Difference]: Without dead ends: 2462 [2020-11-28 03:01:17,959 INFO L677 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 [2020-11-28 03:01:17,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2020-11-28 03:01:18,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2462. [2020-11-28 03:01:18,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2462 states. [2020-11-28 03:01:18,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 2722 transitions. [2020-11-28 03:01:18,121 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 2722 transitions. Word has length 117 [2020-11-28 03:01:18,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:18,121 INFO L481 AbstractCegarLoop]: Abstraction has 2462 states and 2722 transitions. [2020-11-28 03:01:18,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:18,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 2722 transitions. [2020-11-28 03:01:18,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-11-28 03:01:18,125 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:18,125 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:18,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-28 03:01:18,126 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:18,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:18,127 INFO L82 PathProgramCache]: Analyzing trace with hash -692010475, now seen corresponding path program 1 times [2020-11-28 03:01:18,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:18,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708320587] [2020-11-28 03:01:18,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:01:18,160 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:01:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:01:18,182 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:01:18,245 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:01:18,246 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 03:01:18,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-28 03:01:18,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:01:18 BoogieIcfgContainer [2020-11-28 03:01:18,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 03:01:18,450 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:01:18,450 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:01:18,450 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:01:18,451 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:01:10" (3/4) ... [2020-11-28 03:01:18,452 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 03:01:18,601 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_47cca3e4-93f9-4744-9f63-03187655fdfb/bin/uautomizer/witness.graphml [2020-11-28 03:01:18,601 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:01:18,603 INFO L168 Benchmark]: Toolchain (without parser) took 9983.61 ms. Allocated memory was 83.9 MB in the beginning and 442.5 MB in the end (delta: 358.6 MB). Free memory was 52.7 MB in the beginning and 210.3 MB in the end (delta: -157.6 MB). Peak memory consumption was 200.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:01:18,606 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 83.9 MB. Free memory was 43.5 MB in the beginning and 43.5 MB in the end (delta: 56.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:01:18,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 577.21 ms. Allocated memory is still 83.9 MB. Free memory was 52.5 MB in the beginning and 58.7 MB in the end (delta: -6.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:01:18,607 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.37 ms. Allocated memory is still 83.9 MB. Free memory was 58.7 MB in the beginning and 55.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-28 03:01:18,607 INFO L168 Benchmark]: Boogie Preprocessor took 61.79 ms. Allocated memory is still 83.9 MB. Free memory was 55.9 MB in the beginning and 53.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:01:18,608 INFO L168 Benchmark]: RCFGBuilder took 1287.62 ms. Allocated memory was 83.9 MB in the beginning and 100.7 MB in the end (delta: 16.8 MB). Free memory was 53.4 MB in the beginning and 52.7 MB in the end (delta: 689.4 kB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. [2020-11-28 03:01:18,608 INFO L168 Benchmark]: TraceAbstraction took 7833.72 ms. Allocated memory was 100.7 MB in the beginning and 442.5 MB in the end (delta: 341.8 MB). Free memory was 52.7 MB in the beginning and 227.1 MB in the end (delta: -174.4 MB). Peak memory consumption was 168.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:01:18,609 INFO L168 Benchmark]: Witness Printer took 151.20 ms. Allocated memory is still 442.5 MB. Free memory was 227.1 MB in the beginning and 210.3 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-28 03:01:18,611 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 83.9 MB. Free memory was 43.5 MB in the beginning and 43.5 MB in the end (delta: 56.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 577.21 ms. Allocated memory is still 83.9 MB. Free memory was 52.5 MB in the beginning and 58.7 MB in the end (delta: -6.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 64.37 ms. Allocated memory is still 83.9 MB. Free memory was 58.7 MB in the beginning and 55.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 61.79 ms. Allocated memory is still 83.9 MB. Free memory was 55.9 MB in the beginning and 53.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1287.62 ms. Allocated memory was 83.9 MB in the beginning and 100.7 MB in the end (delta: 16.8 MB). Free memory was 53.4 MB in the beginning and 52.7 MB in the end (delta: 689.4 kB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7833.72 ms. Allocated memory was 100.7 MB in the beginning and 442.5 MB in the end (delta: 341.8 MB). Free memory was 52.7 MB in the beginning and 227.1 MB in the end (delta: -174.4 MB). Peak memory consumption was 168.5 MB. Max. memory is 16.1 GB. * Witness Printer took 151.20 ms. Allocated memory is still 442.5 MB. Free memory was 227.1 MB in the beginning and 210.3 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int m_pc = 0; [L18] int t1_pc = 0; [L19] int t2_pc = 0; [L20] int m_st ; [L21] int t1_st ; [L22] int t2_st ; [L23] int m_i ; [L24] int t1_i ; [L25] int t2_i ; [L26] int M_E = 2; [L27] int T1_E = 2; [L28] int T2_E = 2; [L29] int E_1 = 2; [L30] int E_2 = 2; VAL [E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L565] int __retres1 ; [L479] m_i = 1 [L480] t1_i = 1 [L481] t2_i = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L506] int kernel_st ; [L507] int tmp ; [L508] int tmp___0 ; [L512] kernel_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L213] COND TRUE m_i == 1 [L214] m_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L218] COND TRUE t1_i == 1 [L219] t1_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L223] COND TRUE t2_i == 1 [L224] t2_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L326] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L331] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L336] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L341] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L346] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; [L145] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L148] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L158] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L160] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L164] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L167] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L177] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L179] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L403] tmp___0 = is_transmit1_triggered() [L405] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L183] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L186] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L196] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L198] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L411] tmp___1 = is_transmit2_triggered() [L413] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L359] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L364] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L369] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L374] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L379] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L520] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L523] kernel_st = 1 [L259] int tmp ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L263] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L233] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L236] COND TRUE m_st == 0 [L237] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L254] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L266] tmp = exists_runnable_thread() [L268] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L273] COND TRUE m_st == 0 [L274] int tmp_ndt_1; [L275] tmp_ndt_1 = __VERIFIER_nondet_int() [L276] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L287] COND TRUE t1_st == 0 [L288] int tmp_ndt_2; [L289] tmp_ndt_2 = __VERIFIER_nondet_int() [L290] COND TRUE \read(tmp_ndt_2) [L292] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L80] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L91] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L93] t1_pc = 1 [L94] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L301] COND TRUE t2_st == 0 [L302] int tmp_ndt_3; [L303] tmp_ndt_3 = __VERIFIER_nondet_int() [L304] COND TRUE \read(tmp_ndt_3) [L306] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L115] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L126] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L128] t2_pc = 1 [L129] t2_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L263] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L233] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L236] COND TRUE m_st == 0 [L237] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L254] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L266] tmp = exists_runnable_thread() [L268] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L273] COND TRUE m_st == 0 [L274] int tmp_ndt_1; [L275] tmp_ndt_1 = __VERIFIER_nondet_int() [L276] COND TRUE \read(tmp_ndt_1) [L278] m_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L39] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L50] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L53] E_1 = 1 [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; [L145] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L148] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L160] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L164] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L167] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] COND TRUE E_1 == 1 [L169] __retres1 = 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L179] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] tmp___0 = is_transmit1_triggered() [L405] COND TRUE \read(tmp___0) [L406] t1_st = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L183] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L186] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L196] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L198] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] tmp___1 = is_transmit2_triggered() [L413] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L55] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L60] m_pc = 1 [L61] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L287] COND TRUE t1_st == 0 [L288] int tmp_ndt_2; [L289] tmp_ndt_2 = __VERIFIER_nondet_int() [L290] COND TRUE \read(tmp_ndt_2) [L292] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L80] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L83] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L99] E_2 = 1 [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; [L145] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L148] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L149] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L160] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L164] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L167] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L177] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L179] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] tmp___0 = is_transmit1_triggered() [L405] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L183] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L186] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] COND TRUE E_2 == 1 [L188] __retres1 = 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L198] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] tmp___1 = is_transmit2_triggered() [L413] COND TRUE \read(tmp___1) [L414] t2_st = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L101] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L91] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L93] t1_pc = 1 [L94] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L301] COND TRUE t2_st == 0 [L302] int tmp_ndt_3; [L303] tmp_ndt_3 = __VERIFIER_nondet_int() [L304] COND TRUE \read(tmp_ndt_3) [L306] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L115] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L118] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L3] __assert_fail("0", "transmitter.02.cil.c", 3, "reach_error") VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 193 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.5s, OverallIterations: 19, TraceHistogramMax: 2, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5214 SDtfs, 5299 SDslu, 4169 SDs, 0 SdLazy, 369 SolverSat, 156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3452occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 1032 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1304 NumberOfCodeBlocks, 1304 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1168 ConstructedInterpolants, 0 QuantifiedInterpolants, 143287 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 90/90 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...