./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.03.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_80106f7e-9666-4bc9-af4f-8719fcf5af35/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_80106f7e-9666-4bc9-af4f-8719fcf5af35/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_80106f7e-9666-4bc9-af4f-8719fcf5af35/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_80106f7e-9666-4bc9-af4f-8719fcf5af35/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.03.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_80106f7e-9666-4bc9-af4f-8719fcf5af35/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_80106f7e-9666-4bc9-af4f-8719fcf5af35/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6768ec4cb10c0d030986cdc2e459713dbcdaadd ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-30 02:23:35,458 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 02:23:35,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 02:23:35,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 02:23:35,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 02:23:35,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 02:23:35,546 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 02:23:35,549 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 02:23:35,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 02:23:35,553 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 02:23:35,554 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 02:23:35,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 02:23:35,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 02:23:35,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 02:23:35,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 02:23:35,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 02:23:35,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 02:23:35,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 02:23:35,565 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 02:23:35,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 02:23:35,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 02:23:35,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 02:23:35,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 02:23:35,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 02:23:35,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 02:23:35,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 02:23:35,580 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 02:23:35,581 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 02:23:35,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 02:23:35,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 02:23:35,583 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 02:23:35,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 02:23:35,592 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 02:23:35,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 02:23:35,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 02:23:35,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 02:23:35,596 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 02:23:35,596 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 02:23:35,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 02:23:35,598 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 02:23:35,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 02:23:35,601 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_80106f7e-9666-4bc9-af4f-8719fcf5af35/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-30 02:23:35,661 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 02:23:35,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 02:23:35,662 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 02:23:35,662 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 02:23:35,663 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 02:23:35,664 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 02:23:35,664 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-30 02:23:35,665 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 02:23:35,665 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 02:23:35,665 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-30 02:23:35,666 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-30 02:23:35,667 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 02:23:35,667 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-30 02:23:35,667 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-30 02:23:35,667 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-30 02:23:35,668 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 02:23:35,668 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 02:23:35,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 02:23:35,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 02:23:35,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 02:23:35,669 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 02:23:35,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 02:23:35,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 02:23:35,670 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 02:23:35,670 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 02:23:35,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 02:23:35,671 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 02:23:35,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 02:23:35,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 02:23:35,672 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 02:23:35,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 02:23:35,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 02:23:35,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 02:23:35,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 02:23:35,673 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 02:23:35,674 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-30 02:23:35,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 02:23:35,674 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 02:23:35,674 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 02:23:35,675 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 02:23:35,675 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_80106f7e-9666-4bc9-af4f-8719fcf5af35/bin/utaipan/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_80106f7e-9666-4bc9-af4f-8719fcf5af35/bin/utaipan 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 -> Taipan 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 -> f6768ec4cb10c0d030986cdc2e459713dbcdaadd [2020-11-30 02:23:35,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 02:23:36,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 02:23:36,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 02:23:36,017 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 02:23:36,017 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 02:23:36,018 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_80106f7e-9666-4bc9-af4f-8719fcf5af35/bin/utaipan/../../sv-benchmarks/c/systemc/transmitter.03.cil.c [2020-11-30 02:23:36,113 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_80106f7e-9666-4bc9-af4f-8719fcf5af35/bin/utaipan/data/ef6591beb/dbeb26ab4fa5481ca2d229e8eeba2018/FLAG1830c2f3e [2020-11-30 02:23:36,693 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 02:23:36,694 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_80106f7e-9666-4bc9-af4f-8719fcf5af35/sv-benchmarks/c/systemc/transmitter.03.cil.c [2020-11-30 02:23:36,705 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_80106f7e-9666-4bc9-af4f-8719fcf5af35/bin/utaipan/data/ef6591beb/dbeb26ab4fa5481ca2d229e8eeba2018/FLAG1830c2f3e [2020-11-30 02:23:37,021 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_80106f7e-9666-4bc9-af4f-8719fcf5af35/bin/utaipan/data/ef6591beb/dbeb26ab4fa5481ca2d229e8eeba2018 [2020-11-30 02:23:37,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 02:23:37,025 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 02:23:37,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 02:23:37,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 02:23:37,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 02:23:37,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:23:37" (1/1) ... [2020-11-30 02:23:37,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52a4a47a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:37, skipping insertion in model container [2020-11-30 02:23:37,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:23:37" (1/1) ... [2020-11-30 02:23:37,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 02:23:37,088 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 02:23:37,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:23:37,337 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 02:23:37,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 02:23:37,417 INFO L208 MainTranslator]: Completed translation [2020-11-30 02:23:37,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:37 WrapperNode [2020-11-30 02:23:37,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 02:23:37,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 02:23:37,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 02:23:37,420 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 02:23:37,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:37" (1/1) ... [2020-11-30 02:23:37,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:37" (1/1) ... [2020-11-30 02:23:37,479 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 02:23:37,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 02:23:37,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 02:23:37,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 02:23:37,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:37" (1/1) ... [2020-11-30 02:23:37,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:37" (1/1) ... [2020-11-30 02:23:37,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:37" (1/1) ... [2020-11-30 02:23:37,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:37" (1/1) ... [2020-11-30 02:23:37,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:37" (1/1) ... [2020-11-30 02:23:37,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:37" (1/1) ... [2020-11-30 02:23:37,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:37" (1/1) ... [2020-11-30 02:23:37,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 02:23:37,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 02:23:37,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 02:23:37,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 02:23:37,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80106f7e-9666-4bc9-af4f-8719fcf5af35/bin/utaipan/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-30 02:23:37,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 02:23:37,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 02:23:37,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 02:23:37,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 02:23:40,295 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 02:23:40,295 INFO L298 CfgBuilder]: Removed 121 assume(true) statements. [2020-11-30 02:23:40,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:23:40 BoogieIcfgContainer [2020-11-30 02:23:40,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 02:23:40,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 02:23:40,300 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 02:23:40,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 02:23:40,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 02:23:37" (1/3) ... [2020-11-30 02:23:40,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d7ad22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:23:40, skipping insertion in model container [2020-11-30 02:23:40,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:23:37" (2/3) ... [2020-11-30 02:23:40,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d7ad22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:23:40, skipping insertion in model container [2020-11-30 02:23:40,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:23:40" (3/3) ... [2020-11-30 02:23:40,306 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2020-11-30 02:23:40,317 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 02:23:40,322 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 02:23:40,331 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-30 02:23:40,359 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 02:23:40,359 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 02:23:40,359 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 02:23:40,359 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 02:23:40,359 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 02:23:40,359 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 02:23:40,360 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 02:23:40,360 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 02:23:40,376 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2020-11-30 02:23:40,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 02:23:40,382 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:40,383 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] [2020-11-30 02:23:40,383 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:40,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:40,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1884666222, now seen corresponding path program 1 times [2020-11-30 02:23:40,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:40,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427142955] [2020-11-30 02:23:40,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:40,632 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-30 02:23:40,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427142955] [2020-11-30 02:23:40,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:40,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:23:40,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258767822] [2020-11-30 02:23:40,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:23:40,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:40,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:23:40,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:23:40,654 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2020-11-30 02:23:41,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:41,051 INFO L93 Difference]: Finished difference Result 444 states and 681 transitions. [2020-11-30 02:23:41,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:23:41,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-11-30 02:23:41,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:41,078 INFO L225 Difference]: With dead ends: 444 [2020-11-30 02:23:41,078 INFO L226 Difference]: Without dead ends: 311 [2020-11-30 02:23:41,082 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-30 02:23:41,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2020-11-30 02:23:41,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 279. [2020-11-30 02:23:41,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2020-11-30 02:23:41,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 408 transitions. [2020-11-30 02:23:41,148 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 408 transitions. Word has length 24 [2020-11-30 02:23:41,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:41,149 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 408 transitions. [2020-11-30 02:23:41,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:23:41,149 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 408 transitions. [2020-11-30 02:23:41,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 02:23:41,150 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:41,151 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] [2020-11-30 02:23:41,151 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 02:23:41,151 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:41,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:41,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1223332431, now seen corresponding path program 1 times [2020-11-30 02:23:41,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:41,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889385049] [2020-11-30 02:23:41,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:41,265 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-30 02:23:41,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889385049] [2020-11-30 02:23:41,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:41,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:23:41,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155560902] [2020-11-30 02:23:41,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:23:41,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:41,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:23:41,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:23:41,269 INFO L87 Difference]: Start difference. First operand 279 states and 408 transitions. Second operand 4 states. [2020-11-30 02:23:41,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:41,578 INFO L93 Difference]: Finished difference Result 1033 states and 1506 transitions. [2020-11-30 02:23:41,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:23:41,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-11-30 02:23:41,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:41,584 INFO L225 Difference]: With dead ends: 1033 [2020-11-30 02:23:41,584 INFO L226 Difference]: Without dead ends: 766 [2020-11-30 02:23:41,587 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-30 02:23:41,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2020-11-30 02:23:41,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 722. [2020-11-30 02:23:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2020-11-30 02:23:41,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1016 transitions. [2020-11-30 02:23:41,662 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1016 transitions. Word has length 24 [2020-11-30 02:23:41,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:41,662 INFO L481 AbstractCegarLoop]: Abstraction has 722 states and 1016 transitions. [2020-11-30 02:23:41,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:23:41,663 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1016 transitions. [2020-11-30 02:23:41,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 02:23:41,672 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:41,672 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 02:23:41,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 02:23:41,672 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:41,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:41,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1034245526, now seen corresponding path program 1 times [2020-11-30 02:23:41,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:41,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014119854] [2020-11-30 02:23:41,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:41,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 02:23:41,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014119854] [2020-11-30 02:23:41,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:41,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:23:41,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046001398] [2020-11-30 02:23:41,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:23:41,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:41,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:23:41,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:23:41,814 INFO L87 Difference]: Start difference. First operand 722 states and 1016 transitions. Second operand 4 states. [2020-11-30 02:23:42,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:42,049 INFO L93 Difference]: Finished difference Result 2184 states and 3107 transitions. [2020-11-30 02:23:42,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:23:42,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-11-30 02:23:42,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:42,061 INFO L225 Difference]: With dead ends: 2184 [2020-11-30 02:23:42,061 INFO L226 Difference]: Without dead ends: 1476 [2020-11-30 02:23:42,065 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:23:42,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2020-11-30 02:23:42,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1179. [2020-11-30 02:23:42,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1179 states. [2020-11-30 02:23:42,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1660 transitions. [2020-11-30 02:23:42,129 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1660 transitions. Word has length 33 [2020-11-30 02:23:42,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:42,129 INFO L481 AbstractCegarLoop]: Abstraction has 1179 states and 1660 transitions. [2020-11-30 02:23:42,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:23:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1660 transitions. [2020-11-30 02:23:42,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-30 02:23:42,131 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:42,131 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 02:23:42,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 02:23:42,132 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:42,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:42,133 INFO L82 PathProgramCache]: Analyzing trace with hash 298857696, now seen corresponding path program 1 times [2020-11-30 02:23:42,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:42,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087323925] [2020-11-30 02:23:42,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:42,183 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-30 02:23:42,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087323925] [2020-11-30 02:23:42,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:42,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 02:23:42,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052566749] [2020-11-30 02:23:42,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:42,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:42,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:42,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:42,185 INFO L87 Difference]: Start difference. First operand 1179 states and 1660 transitions. Second operand 3 states. [2020-11-30 02:23:42,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:42,345 INFO L93 Difference]: Finished difference Result 2899 states and 4114 transitions. [2020-11-30 02:23:42,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:23:42,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-11-30 02:23:42,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:42,357 INFO L225 Difference]: With dead ends: 2899 [2020-11-30 02:23:42,357 INFO L226 Difference]: Without dead ends: 1734 [2020-11-30 02:23:42,359 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-30 02:23:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2020-11-30 02:23:42,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2020-11-30 02:23:42,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1732 states. [2020-11-30 02:23:42,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2454 transitions. [2020-11-30 02:23:42,475 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2454 transitions. Word has length 35 [2020-11-30 02:23:42,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:42,476 INFO L481 AbstractCegarLoop]: Abstraction has 1732 states and 2454 transitions. [2020-11-30 02:23:42,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:23:42,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2454 transitions. [2020-11-30 02:23:42,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-30 02:23:42,480 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:42,480 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 02:23:42,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 02:23:42,482 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:42,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:42,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1511470698, now seen corresponding path program 1 times [2020-11-30 02:23:42,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:42,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708422973] [2020-11-30 02:23:42,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:23:42,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708422973] [2020-11-30 02:23:42,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:42,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:23:42,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171684811] [2020-11-30 02:23:42,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:42,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:42,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:42,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:42,596 INFO L87 Difference]: Start difference. First operand 1732 states and 2454 transitions. Second operand 3 states. [2020-11-30 02:23:42,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:42,727 INFO L93 Difference]: Finished difference Result 3687 states and 5278 transitions. [2020-11-30 02:23:42,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:23:42,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-11-30 02:23:42,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:42,743 INFO L225 Difference]: With dead ends: 3687 [2020-11-30 02:23:42,744 INFO L226 Difference]: Without dead ends: 2289 [2020-11-30 02:23:42,747 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-30 02:23:42,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2020-11-30 02:23:42,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 1854. [2020-11-30 02:23:42,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1854 states. [2020-11-30 02:23:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2653 transitions. [2020-11-30 02:23:42,880 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2653 transitions. Word has length 37 [2020-11-30 02:23:42,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:42,881 INFO L481 AbstractCegarLoop]: Abstraction has 1854 states and 2653 transitions. [2020-11-30 02:23:42,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:23:42,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2653 transitions. [2020-11-30 02:23:42,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-30 02:23:42,884 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:42,885 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 02:23:42,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 02:23:42,885 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:42,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:42,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1268816988, now seen corresponding path program 1 times [2020-11-30 02:23:42,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:42,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085970719] [2020-11-30 02:23:42,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:42,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 02:23:42,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085970719] [2020-11-30 02:23:42,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:42,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:23:42,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897376460] [2020-11-30 02:23:42,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:23:42,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:42,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:23:42,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:23:42,982 INFO L87 Difference]: Start difference. First operand 1854 states and 2653 transitions. Second operand 4 states. [2020-11-30 02:23:43,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:43,346 INFO L93 Difference]: Finished difference Result 6216 states and 8827 transitions. [2020-11-30 02:23:43,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:23:43,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-11-30 02:23:43,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:43,376 INFO L225 Difference]: With dead ends: 6216 [2020-11-30 02:23:43,376 INFO L226 Difference]: Without dead ends: 4370 [2020-11-30 02:23:43,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-30 02:23:43,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4370 states. [2020-11-30 02:23:43,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4370 to 4007. [2020-11-30 02:23:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4007 states. [2020-11-30 02:23:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 5563 transitions. [2020-11-30 02:23:43,594 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 5563 transitions. Word has length 52 [2020-11-30 02:23:43,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:43,594 INFO L481 AbstractCegarLoop]: Abstraction has 4007 states and 5563 transitions. [2020-11-30 02:23:43,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:23:43,601 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 5563 transitions. [2020-11-30 02:23:43,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-30 02:23:43,608 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:43,608 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 02:23:43,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 02:23:43,608 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:43,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:43,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1955726629, now seen corresponding path program 1 times [2020-11-30 02:23:43,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:43,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510238900] [2020-11-30 02:23:43,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 02:23:43,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510238900] [2020-11-30 02:23:43,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:43,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 02:23:43,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695414481] [2020-11-30 02:23:43,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:43,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:43,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:43,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:43,719 INFO L87 Difference]: Start difference. First operand 4007 states and 5563 transitions. Second operand 3 states. [2020-11-30 02:23:43,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:43,958 INFO L93 Difference]: Finished difference Result 7273 states and 10172 transitions. [2020-11-30 02:23:43,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:23:43,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-11-30 02:23:43,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:43,983 INFO L225 Difference]: With dead ends: 7273 [2020-11-30 02:23:43,983 INFO L226 Difference]: Without dead ends: 4039 [2020-11-30 02:23:43,991 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-30 02:23:43,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4039 states. [2020-11-30 02:23:44,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4039 to 4007. [2020-11-30 02:23:44,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4007 states. [2020-11-30 02:23:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 5527 transitions. [2020-11-30 02:23:44,206 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 5527 transitions. Word has length 52 [2020-11-30 02:23:44,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:44,207 INFO L481 AbstractCegarLoop]: Abstraction has 4007 states and 5527 transitions. [2020-11-30 02:23:44,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:23:44,208 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 5527 transitions. [2020-11-30 02:23:44,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-30 02:23:44,214 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:44,214 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 02:23:44,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 02:23:44,215 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:44,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:44,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1808752186, now seen corresponding path program 1 times [2020-11-30 02:23:44,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:44,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468115456] [2020-11-30 02:23:44,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:23:44,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468115456] [2020-11-30 02:23:44,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:44,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 02:23:44,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992427074] [2020-11-30 02:23:44,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:23:44,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:44,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:23:44,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:23:44,314 INFO L87 Difference]: Start difference. First operand 4007 states and 5527 transitions. Second operand 4 states. [2020-11-30 02:23:44,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:44,702 INFO L93 Difference]: Finished difference Result 10600 states and 14618 transitions. [2020-11-30 02:23:44,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:23:44,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2020-11-30 02:23:44,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:44,735 INFO L225 Difference]: With dead ends: 10600 [2020-11-30 02:23:44,735 INFO L226 Difference]: Without dead ends: 6006 [2020-11-30 02:23:44,743 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:23:44,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-11-30 02:23:45,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 5152. [2020-11-30 02:23:45,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5152 states. [2020-11-30 02:23:45,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5152 states to 5152 states and 6968 transitions. [2020-11-30 02:23:45,034 INFO L78 Accepts]: Start accepts. Automaton has 5152 states and 6968 transitions. Word has length 53 [2020-11-30 02:23:45,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:45,035 INFO L481 AbstractCegarLoop]: Abstraction has 5152 states and 6968 transitions. [2020-11-30 02:23:45,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:23:45,036 INFO L276 IsEmpty]: Start isEmpty. Operand 5152 states and 6968 transitions. [2020-11-30 02:23:45,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-30 02:23:45,045 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:45,045 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-11-30 02:23:45,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 02:23:45,045 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:45,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:45,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1846399896, now seen corresponding path program 1 times [2020-11-30 02:23:45,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:45,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218173073] [2020-11-30 02:23:45,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:45,115 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:23:45,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218173073] [2020-11-30 02:23:45,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:45,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 02:23:45,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260180577] [2020-11-30 02:23:45,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:23:45,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:45,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:23:45,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:23:45,118 INFO L87 Difference]: Start difference. First operand 5152 states and 6968 transitions. Second operand 5 states. [2020-11-30 02:23:45,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:45,490 INFO L93 Difference]: Finished difference Result 9007 states and 12435 transitions. [2020-11-30 02:23:45,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 02:23:45,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2020-11-30 02:23:45,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:45,516 INFO L225 Difference]: With dead ends: 9007 [2020-11-30 02:23:45,516 INFO L226 Difference]: Without dead ends: 3868 [2020-11-30 02:23:45,524 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-30 02:23:45,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2020-11-30 02:23:45,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 3130. [2020-11-30 02:23:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-11-30 02:23:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 4415 transitions. [2020-11-30 02:23:45,709 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 4415 transitions. Word has length 56 [2020-11-30 02:23:45,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:45,709 INFO L481 AbstractCegarLoop]: Abstraction has 3130 states and 4415 transitions. [2020-11-30 02:23:45,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:23:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 4415 transitions. [2020-11-30 02:23:45,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-30 02:23:45,714 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:45,714 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] [2020-11-30 02:23:45,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 02:23:45,714 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:45,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:45,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1169633933, now seen corresponding path program 1 times [2020-11-30 02:23:45,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:45,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763191427] [2020-11-30 02:23:45,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:45,762 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-30 02:23:45,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763191427] [2020-11-30 02:23:45,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:45,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:23:45,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421581122] [2020-11-30 02:23:45,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:45,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:45,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:45,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:45,766 INFO L87 Difference]: Start difference. First operand 3130 states and 4415 transitions. Second operand 3 states. [2020-11-30 02:23:46,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:46,024 INFO L93 Difference]: Finished difference Result 7033 states and 9957 transitions. [2020-11-30 02:23:46,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:23:46,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-11-30 02:23:46,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:46,054 INFO L225 Difference]: With dead ends: 7033 [2020-11-30 02:23:46,055 INFO L226 Difference]: Without dead ends: 3949 [2020-11-30 02:23:46,067 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-30 02:23:46,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3949 states. [2020-11-30 02:23:46,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3949 to 3446. [2020-11-30 02:23:46,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3446 states. [2020-11-30 02:23:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3446 states to 3446 states and 4897 transitions. [2020-11-30 02:23:46,257 INFO L78 Accepts]: Start accepts. Automaton has 3446 states and 4897 transitions. Word has length 56 [2020-11-30 02:23:46,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:46,259 INFO L481 AbstractCegarLoop]: Abstraction has 3446 states and 4897 transitions. [2020-11-30 02:23:46,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:23:46,259 INFO L276 IsEmpty]: Start isEmpty. Operand 3446 states and 4897 transitions. [2020-11-30 02:23:46,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-30 02:23:46,298 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:46,298 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-11-30 02:23:46,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 02:23:46,298 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:46,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:46,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1660490356, now seen corresponding path program 1 times [2020-11-30 02:23:46,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:46,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939753560] [2020-11-30 02:23:46,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:46,364 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 02:23:46,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939753560] [2020-11-30 02:23:46,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:46,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 02:23:46,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563166929] [2020-11-30 02:23:46,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 02:23:46,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:46,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 02:23:46,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 02:23:46,366 INFO L87 Difference]: Start difference. First operand 3446 states and 4897 transitions. Second operand 5 states. [2020-11-30 02:23:46,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:46,904 INFO L93 Difference]: Finished difference Result 10425 states and 14602 transitions. [2020-11-30 02:23:46,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 02:23:46,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2020-11-30 02:23:46,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:46,954 INFO L225 Difference]: With dead ends: 10425 [2020-11-30 02:23:46,954 INFO L226 Difference]: Without dead ends: 7591 [2020-11-30 02:23:46,958 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-30 02:23:46,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7591 states. [2020-11-30 02:23:47,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7591 to 4672. [2020-11-30 02:23:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4672 states. [2020-11-30 02:23:47,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4672 states to 4672 states and 6544 transitions. [2020-11-30 02:23:47,167 INFO L78 Accepts]: Start accepts. Automaton has 4672 states and 6544 transitions. Word has length 70 [2020-11-30 02:23:47,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:47,168 INFO L481 AbstractCegarLoop]: Abstraction has 4672 states and 6544 transitions. [2020-11-30 02:23:47,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 02:23:47,169 INFO L276 IsEmpty]: Start isEmpty. Operand 4672 states and 6544 transitions. [2020-11-30 02:23:47,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-30 02:23:47,177 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:47,178 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-11-30 02:23:47,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 02:23:47,178 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:47,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:47,179 INFO L82 PathProgramCache]: Analyzing trace with hash -12027275, now seen corresponding path program 1 times [2020-11-30 02:23:47,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:47,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364762683] [2020-11-30 02:23:47,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:23:47,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364762683] [2020-11-30 02:23:47,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:47,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:23:47,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320609542] [2020-11-30 02:23:47,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:47,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:47,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:47,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:47,273 INFO L87 Difference]: Start difference. First operand 4672 states and 6544 transitions. Second operand 3 states. [2020-11-30 02:23:47,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:47,518 INFO L93 Difference]: Finished difference Result 8666 states and 12111 transitions. [2020-11-30 02:23:47,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:23:47,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2020-11-30 02:23:47,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:47,528 INFO L225 Difference]: With dead ends: 8666 [2020-11-30 02:23:47,528 INFO L226 Difference]: Without dead ends: 4606 [2020-11-30 02:23:47,533 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-30 02:23:47,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4606 states. [2020-11-30 02:23:47,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4606 to 4580. [2020-11-30 02:23:47,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4580 states. [2020-11-30 02:23:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4580 states to 4580 states and 6197 transitions. [2020-11-30 02:23:47,732 INFO L78 Accepts]: Start accepts. Automaton has 4580 states and 6197 transitions. Word has length 70 [2020-11-30 02:23:47,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:47,733 INFO L481 AbstractCegarLoop]: Abstraction has 4580 states and 6197 transitions. [2020-11-30 02:23:47,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:23:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand 4580 states and 6197 transitions. [2020-11-30 02:23:47,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-30 02:23:47,745 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:47,745 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-11-30 02:23:47,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 02:23:47,746 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:47,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:47,747 INFO L82 PathProgramCache]: Analyzing trace with hash 728361531, now seen corresponding path program 1 times [2020-11-30 02:23:47,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:47,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175570224] [2020-11-30 02:23:47,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:47,863 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 02:23:47,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175570224] [2020-11-30 02:23:47,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754226315] [2020-11-30 02:23:47,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80106f7e-9666-4bc9-af4f-8719fcf5af35/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:23:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:48,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 02:23:48,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:23:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-30 02:23:48,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:23:48,249 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 02:23:48,250 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:23:48,263 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 02:23:48,264 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:23:48,276 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-30 02:23:48,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-11-30 02:23:48,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2020-11-30 02:23:48,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329004765] [2020-11-30 02:23:48,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:48,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:48,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:48,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:23:48,283 INFO L87 Difference]: Start difference. First operand 4580 states and 6197 transitions. Second operand 3 states. [2020-11-30 02:23:48,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:48,886 INFO L93 Difference]: Finished difference Result 12236 states and 16453 transitions. [2020-11-30 02:23:48,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:23:48,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2020-11-30 02:23:48,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:48,911 INFO L225 Difference]: With dead ends: 12236 [2020-11-30 02:23:48,911 INFO L226 Difference]: Without dead ends: 7670 [2020-11-30 02:23:48,922 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-30 02:23:48,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7670 states. [2020-11-30 02:23:49,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7670 to 7668. [2020-11-30 02:23:49,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7668 states. [2020-11-30 02:23:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7668 states to 7668 states and 10201 transitions. [2020-11-30 02:23:49,449 INFO L78 Accepts]: Start accepts. Automaton has 7668 states and 10201 transitions. Word has length 71 [2020-11-30 02:23:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:49,449 INFO L481 AbstractCegarLoop]: Abstraction has 7668 states and 10201 transitions. [2020-11-30 02:23:49,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:23:49,450 INFO L276 IsEmpty]: Start isEmpty. Operand 7668 states and 10201 transitions. [2020-11-30 02:23:49,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-30 02:23:49,464 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:49,465 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 02:23:49,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-11-30 02:23:49,693 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:49,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:49,694 INFO L82 PathProgramCache]: Analyzing trace with hash -834931163, now seen corresponding path program 1 times [2020-11-30 02:23:49,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:49,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474667418] [2020-11-30 02:23:49,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:49,762 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-30 02:23:49,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474667418] [2020-11-30 02:23:49,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:49,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:23:49,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094630230] [2020-11-30 02:23:49,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:49,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:49,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:49,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:49,767 INFO L87 Difference]: Start difference. First operand 7668 states and 10201 transitions. Second operand 3 states. [2020-11-30 02:23:50,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:50,131 INFO L93 Difference]: Finished difference Result 13713 states and 18316 transitions. [2020-11-30 02:23:50,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:23:50,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2020-11-30 02:23:50,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:50,145 INFO L225 Difference]: With dead ends: 13713 [2020-11-30 02:23:50,145 INFO L226 Difference]: Without dead ends: 6101 [2020-11-30 02:23:50,156 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-30 02:23:50,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6101 states. [2020-11-30 02:23:50,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6101 to 6066. [2020-11-30 02:23:50,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6066 states. [2020-11-30 02:23:50,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6066 states to 6066 states and 7892 transitions. [2020-11-30 02:23:50,530 INFO L78 Accepts]: Start accepts. Automaton has 6066 states and 7892 transitions. Word has length 72 [2020-11-30 02:23:50,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:50,531 INFO L481 AbstractCegarLoop]: Abstraction has 6066 states and 7892 transitions. [2020-11-30 02:23:50,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:23:50,531 INFO L276 IsEmpty]: Start isEmpty. Operand 6066 states and 7892 transitions. [2020-11-30 02:23:50,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-30 02:23:50,551 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:50,552 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 02:23:50,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 02:23:50,552 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:50,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:50,553 INFO L82 PathProgramCache]: Analyzing trace with hash 453263366, now seen corresponding path program 1 times [2020-11-30 02:23:50,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:50,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739750472] [2020-11-30 02:23:50,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:50,627 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 02:23:50,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739750472] [2020-11-30 02:23:50,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:50,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 02:23:50,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269188245] [2020-11-30 02:23:50,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:50,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:50,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:50,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:50,637 INFO L87 Difference]: Start difference. First operand 6066 states and 7892 transitions. Second operand 3 states. [2020-11-30 02:23:50,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:50,958 INFO L93 Difference]: Finished difference Result 10899 states and 14170 transitions. [2020-11-30 02:23:50,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:23:50,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2020-11-30 02:23:50,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:50,972 INFO L225 Difference]: With dead ends: 10899 [2020-11-30 02:23:50,972 INFO L226 Difference]: Without dead ends: 6402 [2020-11-30 02:23:50,981 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-30 02:23:50,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6402 states. [2020-11-30 02:23:51,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6402 to 6066. [2020-11-30 02:23:51,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6066 states. [2020-11-30 02:23:51,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6066 states to 6066 states and 7772 transitions. [2020-11-30 02:23:51,283 INFO L78 Accepts]: Start accepts. Automaton has 6066 states and 7772 transitions. Word has length 72 [2020-11-30 02:23:51,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:51,283 INFO L481 AbstractCegarLoop]: Abstraction has 6066 states and 7772 transitions. [2020-11-30 02:23:51,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:23:51,284 INFO L276 IsEmpty]: Start isEmpty. Operand 6066 states and 7772 transitions. [2020-11-30 02:23:51,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-30 02:23:51,351 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:51,351 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-11-30 02:23:51,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 02:23:51,352 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:51,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:51,353 INFO L82 PathProgramCache]: Analyzing trace with hash 824096241, now seen corresponding path program 1 times [2020-11-30 02:23:51,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:51,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922457450] [2020-11-30 02:23:51,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 02:23:51,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922457450] [2020-11-30 02:23:51,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699823695] [2020-11-30 02:23:51,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80106f7e-9666-4bc9-af4f-8719fcf5af35/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:23:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:51,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 02:23:51,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:23:51,641 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 02:23:51,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:23:51,687 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 02:23:51,691 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:23:51,722 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 02:23:51,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-11-30 02:23:51,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 4] imperfect sequences [5] total 9 [2020-11-30 02:23:51,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600741488] [2020-11-30 02:23:51,723 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 02:23:51,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:51,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 02:23:51,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-11-30 02:23:51,725 INFO L87 Difference]: Start difference. First operand 6066 states and 7772 transitions. Second operand 6 states. [2020-11-30 02:23:52,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:52,211 INFO L93 Difference]: Finished difference Result 13714 states and 17726 transitions. [2020-11-30 02:23:52,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 02:23:52,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2020-11-30 02:23:52,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:52,231 INFO L225 Difference]: With dead ends: 13714 [2020-11-30 02:23:52,232 INFO L226 Difference]: Without dead ends: 8768 [2020-11-30 02:23:52,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-11-30 02:23:52,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8768 states. [2020-11-30 02:23:52,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8768 to 5658. [2020-11-30 02:23:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5658 states. [2020-11-30 02:23:52,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5658 states to 5658 states and 7123 transitions. [2020-11-30 02:23:52,706 INFO L78 Accepts]: Start accepts. Automaton has 5658 states and 7123 transitions. Word has length 73 [2020-11-30 02:23:52,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:52,706 INFO L481 AbstractCegarLoop]: Abstraction has 5658 states and 7123 transitions. [2020-11-30 02:23:52,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 02:23:52,706 INFO L276 IsEmpty]: Start isEmpty. Operand 5658 states and 7123 transitions. [2020-11-30 02:23:52,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-30 02:23:52,716 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:52,716 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-11-30 02:23:52,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-11-30 02:23:52,930 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:52,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:52,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1559445636, now seen corresponding path program 1 times [2020-11-30 02:23:52,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:52,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966052291] [2020-11-30 02:23:52,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:53,093 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 02:23:53,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966052291] [2020-11-30 02:23:53,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422206180] [2020-11-30 02:23:53,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80106f7e-9666-4bc9-af4f-8719fcf5af35/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:23:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:53,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 18 conjunts are in the unsatisfiable core [2020-11-30 02:23:53,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:23:53,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 02:23:53,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:23:53,369 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 02:23:53,371 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:23:53,432 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 02:23:53,433 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:23:53,436 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 1] term [2020-11-30 02:23:53,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:23:53,509 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 02:23:53,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-11-30 02:23:53,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 5] imperfect sequences [5] total 11 [2020-11-30 02:23:53,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288691110] [2020-11-30 02:23:53,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 02:23:53,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:53,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 02:23:53,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-11-30 02:23:53,512 INFO L87 Difference]: Start difference. First operand 5658 states and 7123 transitions. Second operand 8 states. [2020-11-30 02:23:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:54,218 INFO L93 Difference]: Finished difference Result 11742 states and 14843 transitions. [2020-11-30 02:23:54,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 02:23:54,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2020-11-30 02:23:54,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:54,234 INFO L225 Difference]: With dead ends: 11742 [2020-11-30 02:23:54,235 INFO L226 Difference]: Without dead ends: 7204 [2020-11-30 02:23:54,242 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-30 02:23:54,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7204 states. [2020-11-30 02:23:54,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7204 to 5222. [2020-11-30 02:23:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5222 states. [2020-11-30 02:23:54,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 6507 transitions. [2020-11-30 02:23:54,722 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 6507 transitions. Word has length 73 [2020-11-30 02:23:54,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:54,723 INFO L481 AbstractCegarLoop]: Abstraction has 5222 states and 6507 transitions. [2020-11-30 02:23:54,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 02:23:54,723 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 6507 transitions. [2020-11-30 02:23:54,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-30 02:23:54,732 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:54,732 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 02:23:54,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-11-30 02:23:54,957 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:54,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:54,958 INFO L82 PathProgramCache]: Analyzing trace with hash -185941178, now seen corresponding path program 1 times [2020-11-30 02:23:54,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:54,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48336455] [2020-11-30 02:23:54,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:55,052 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-30 02:23:55,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48336455] [2020-11-30 02:23:55,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:55,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 02:23:55,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552681834] [2020-11-30 02:23:55,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 02:23:55,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:55,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 02:23:55,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:23:55,054 INFO L87 Difference]: Start difference. First operand 5222 states and 6507 transitions. Second operand 4 states. [2020-11-30 02:23:55,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:55,634 INFO L93 Difference]: Finished difference Result 11171 states and 13932 transitions. [2020-11-30 02:23:55,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 02:23:55,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-11-30 02:23:55,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:55,649 INFO L225 Difference]: With dead ends: 11171 [2020-11-30 02:23:55,649 INFO L226 Difference]: Without dead ends: 7022 [2020-11-30 02:23:55,654 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 02:23:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7022 states. [2020-11-30 02:23:56,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7022 to 6390. [2020-11-30 02:23:56,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6390 states. [2020-11-30 02:23:56,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6390 states to 6390 states and 7869 transitions. [2020-11-30 02:23:56,045 INFO L78 Accepts]: Start accepts. Automaton has 6390 states and 7869 transitions. Word has length 75 [2020-11-30 02:23:56,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:56,046 INFO L481 AbstractCegarLoop]: Abstraction has 6390 states and 7869 transitions. [2020-11-30 02:23:56,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 02:23:56,046 INFO L276 IsEmpty]: Start isEmpty. Operand 6390 states and 7869 transitions. [2020-11-30 02:23:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-30 02:23:56,053 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:56,054 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:23:56,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-30 02:23:56,054 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:56,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:56,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1015314252, now seen corresponding path program 1 times [2020-11-30 02:23:56,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:56,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761330814] [2020-11-30 02:23:56,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:23:56,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761330814] [2020-11-30 02:23:56,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:56,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:23:56,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607389253] [2020-11-30 02:23:56,097 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:56,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:56,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:56,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:56,098 INFO L87 Difference]: Start difference. First operand 6390 states and 7869 transitions. Second operand 3 states. [2020-11-30 02:23:56,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:56,459 INFO L93 Difference]: Finished difference Result 12123 states and 14982 transitions. [2020-11-30 02:23:56,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:23:56,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2020-11-30 02:23:56,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:56,473 INFO L225 Difference]: With dead ends: 12123 [2020-11-30 02:23:56,473 INFO L226 Difference]: Without dead ends: 5789 [2020-11-30 02:23:56,485 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-30 02:23:56,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5789 states. [2020-11-30 02:23:56,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5789 to 5594. [2020-11-30 02:23:56,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5594 states. [2020-11-30 02:23:56,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5594 states to 5594 states and 6928 transitions. [2020-11-30 02:23:56,840 INFO L78 Accepts]: Start accepts. Automaton has 5594 states and 6928 transitions. Word has length 75 [2020-11-30 02:23:56,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:56,840 INFO L481 AbstractCegarLoop]: Abstraction has 5594 states and 6928 transitions. [2020-11-30 02:23:56,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:23:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 5594 states and 6928 transitions. [2020-11-30 02:23:56,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-11-30 02:23:56,851 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:56,852 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-11-30 02:23:56,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-30 02:23:56,852 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:56,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:56,853 INFO L82 PathProgramCache]: Analyzing trace with hash -566194343, now seen corresponding path program 1 times [2020-11-30 02:23:56,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:56,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980736362] [2020-11-30 02:23:56,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:56,951 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 02:23:56,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980736362] [2020-11-30 02:23:56,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175550111] [2020-11-30 02:23:56,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_80106f7e-9666-4bc9-af4f-8719fcf5af35/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:23:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:57,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 18 conjunts are in the unsatisfiable core [2020-11-30 02:23:57,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 02:23:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 02:23:57,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 02:23:57,217 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 02:23:57,221 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:23:57,292 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 1] term [2020-11-30 02:23:57,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 02:23:57,300 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-30 02:23:57,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 02:23:57,501 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 02:23:57,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-11-30 02:23:57,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 5] imperfect sequences [5] total 10 [2020-11-30 02:23:57,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337739881] [2020-11-30 02:23:57,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 02:23:57,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:57,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 02:23:57,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-11-30 02:23:57,505 INFO L87 Difference]: Start difference. First operand 5594 states and 6928 transitions. Second operand 7 states. [2020-11-30 02:23:58,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:58,310 INFO L93 Difference]: Finished difference Result 12408 states and 15404 transitions. [2020-11-30 02:23:58,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 02:23:58,310 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2020-11-30 02:23:58,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:58,329 INFO L225 Difference]: With dead ends: 12408 [2020-11-30 02:23:58,329 INFO L226 Difference]: Without dead ends: 7922 [2020-11-30 02:23:58,335 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-11-30 02:23:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7922 states. [2020-11-30 02:23:58,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7922 to 6798. [2020-11-30 02:23:58,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6798 states. [2020-11-30 02:23:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6798 states to 6798 states and 8455 transitions. [2020-11-30 02:23:58,724 INFO L78 Accepts]: Start accepts. Automaton has 6798 states and 8455 transitions. Word has length 93 [2020-11-30 02:23:58,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:58,725 INFO L481 AbstractCegarLoop]: Abstraction has 6798 states and 8455 transitions. [2020-11-30 02:23:58,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 02:23:58,725 INFO L276 IsEmpty]: Start isEmpty. Operand 6798 states and 8455 transitions. [2020-11-30 02:23:58,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-30 02:23:58,730 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:58,731 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, 1, 1, 1, 1, 1] [2020-11-30 02:23:58,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 02:23:58,945 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:58,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:58,946 INFO L82 PathProgramCache]: Analyzing trace with hash -254552413, now seen corresponding path program 1 times [2020-11-30 02:23:58,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:58,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106154254] [2020-11-30 02:23:58,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 02:23:58,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106154254] [2020-11-30 02:23:58,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:58,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:23:58,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41213016] [2020-11-30 02:23:58,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:58,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:58,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:58,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:58,990 INFO L87 Difference]: Start difference. First operand 6798 states and 8455 transitions. Second operand 3 states. [2020-11-30 02:23:59,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:23:59,299 INFO L93 Difference]: Finished difference Result 10810 states and 13559 transitions. [2020-11-30 02:23:59,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:23:59,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-11-30 02:23:59,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:23:59,310 INFO L225 Difference]: With dead ends: 10810 [2020-11-30 02:23:59,310 INFO L226 Difference]: Without dead ends: 4254 [2020-11-30 02:23:59,315 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-30 02:23:59,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4254 states. [2020-11-30 02:23:59,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4254 to 4230. [2020-11-30 02:23:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4230 states. [2020-11-30 02:23:59,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4230 states to 4230 states and 5156 transitions. [2020-11-30 02:23:59,621 INFO L78 Accepts]: Start accepts. Automaton has 4230 states and 5156 transitions. Word has length 94 [2020-11-30 02:23:59,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:23:59,622 INFO L481 AbstractCegarLoop]: Abstraction has 4230 states and 5156 transitions. [2020-11-30 02:23:59,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:23:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 4230 states and 5156 transitions. [2020-11-30 02:23:59,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-30 02:23:59,627 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:23:59,628 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, 1, 1, 1, 1, 1] [2020-11-30 02:23:59,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-30 02:23:59,628 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:23:59,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:23:59,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1306001502, now seen corresponding path program 1 times [2020-11-30 02:23:59,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:23:59,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049223558] [2020-11-30 02:23:59,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:23:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 02:23:59,684 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-30 02:23:59,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049223558] [2020-11-30 02:23:59,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 02:23:59,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 02:23:59,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705038737] [2020-11-30 02:23:59,686 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 02:23:59,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 02:23:59,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 02:23:59,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 02:23:59,687 INFO L87 Difference]: Start difference. First operand 4230 states and 5156 transitions. Second operand 3 states. [2020-11-30 02:24:00,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 02:24:00,023 INFO L93 Difference]: Finished difference Result 7778 states and 9504 transitions. [2020-11-30 02:24:00,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 02:24:00,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-11-30 02:24:00,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 02:24:00,032 INFO L225 Difference]: With dead ends: 7778 [2020-11-30 02:24:00,033 INFO L226 Difference]: Without dead ends: 4230 [2020-11-30 02:24:00,036 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-30 02:24:00,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4230 states. [2020-11-30 02:24:00,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4230 to 4230. [2020-11-30 02:24:00,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4230 states. [2020-11-30 02:24:00,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4230 states to 4230 states and 5014 transitions. [2020-11-30 02:24:00,367 INFO L78 Accepts]: Start accepts. Automaton has 4230 states and 5014 transitions. Word has length 94 [2020-11-30 02:24:00,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 02:24:00,368 INFO L481 AbstractCegarLoop]: Abstraction has 4230 states and 5014 transitions. [2020-11-30 02:24:00,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 02:24:00,368 INFO L276 IsEmpty]: Start isEmpty. Operand 4230 states and 5014 transitions. [2020-11-30 02:24:00,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-11-30 02:24:00,372 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 02:24:00,373 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, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 02:24:00,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-30 02:24:00,373 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 02:24:00,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 02:24:00,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1563867011, now seen corresponding path program 1 times [2020-11-30 02:24:00,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 02:24:00,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171596586] [2020-11-30 02:24:00,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 02:24:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 02:24:00,400 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 02:24:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 02:24:00,434 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 02:24:00,516 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-30 02:24:00,517 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 02:24:00,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-30 02:24:00,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 02:24:00 BoogieIcfgContainer [2020-11-30 02:24:00,756 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 02:24:00,756 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 02:24:00,757 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 02:24:00,757 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 02:24:00,758 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:23:40" (3/4) ... [2020-11-30 02:24:00,761 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 02:24:00,935 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_80106f7e-9666-4bc9-af4f-8719fcf5af35/bin/utaipan/witness.graphml [2020-11-30 02:24:00,935 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 02:24:00,937 INFO L168 Benchmark]: Toolchain (without parser) took 23911.37 ms. Allocated memory was 100.7 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 66.9 MB in the beginning and 517.0 MB in the end (delta: -450.1 MB). Peak memory consumption was 638.5 MB. Max. memory is 16.1 GB. [2020-11-30 02:24:00,938 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 100.7 MB. Free memory was 73.8 MB in the beginning and 73.8 MB in the end (delta: 28.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 02:24:00,939 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.41 ms. Allocated memory is still 100.7 MB. Free memory was 66.6 MB in the beginning and 74.1 MB in the end (delta: -7.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 02:24:00,939 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.94 ms. Allocated memory is still 100.7 MB. Free memory was 74.1 MB in the beginning and 71.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 02:24:00,940 INFO L168 Benchmark]: Boogie Preprocessor took 58.58 ms. Allocated memory is still 100.7 MB. Free memory was 71.0 MB in the beginning and 67.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 02:24:00,940 INFO L168 Benchmark]: RCFGBuilder took 2758.25 ms. Allocated memory was 100.7 MB in the beginning and 127.9 MB in the end (delta: 27.3 MB). Free memory was 67.8 MB in the beginning and 82.2 MB in the end (delta: -14.4 MB). Peak memory consumption was 53.8 MB. Max. memory is 16.1 GB. [2020-11-30 02:24:00,941 INFO L168 Benchmark]: TraceAbstraction took 20456.32 ms. Allocated memory was 127.9 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 81.2 MB in the beginning and 535.9 MB in the end (delta: -454.7 MB). Peak memory consumption was 607.5 MB. Max. memory is 16.1 GB. [2020-11-30 02:24:00,941 INFO L168 Benchmark]: Witness Printer took 178.77 ms. Allocated memory is still 1.2 GB. Free memory was 535.9 MB in the beginning and 517.0 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-30 02:24:00,944 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.28 ms. Allocated memory is still 100.7 MB. Free memory was 73.8 MB in the beginning and 73.8 MB in the end (delta: 28.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 392.41 ms. Allocated memory is still 100.7 MB. Free memory was 66.6 MB in the beginning and 74.1 MB in the end (delta: -7.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 59.94 ms. Allocated memory is still 100.7 MB. Free memory was 74.1 MB in the beginning and 71.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 58.58 ms. Allocated memory is still 100.7 MB. Free memory was 71.0 MB in the beginning and 67.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2758.25 ms. Allocated memory was 100.7 MB in the beginning and 127.9 MB in the end (delta: 27.3 MB). Free memory was 67.8 MB in the beginning and 82.2 MB in the end (delta: -14.4 MB). Peak memory consumption was 53.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20456.32 ms. Allocated memory was 127.9 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 81.2 MB in the beginning and 535.9 MB in the end (delta: -454.7 MB). Peak memory consumption was 607.5 MB. Max. memory is 16.1 GB. * Witness Printer took 178.77 ms. Allocated memory is still 1.2 GB. Free memory was 535.9 MB in the beginning and 517.0 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 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 t3_pc = 0; [L21] int m_st ; [L22] int t1_st ; [L23] int t2_st ; [L24] int t3_st ; [L25] int m_i ; [L26] int t1_i ; [L27] int t2_i ; [L28] int t3_i ; [L29] int M_E = 2; [L30] int T1_E = 2; [L31] int T2_E = 2; [L32] int T3_E = 2; [L33] int E_1 = 2; [L34] int E_2 = 2; [L35] int E_3 = 2; [L689] int __retres1 ; [L602] m_i = 1 [L603] t1_i = 1 [L604] t2_i = 1 [L605] t3_i = 1 [L630] int kernel_st ; [L631] int tmp ; [L632] int tmp___0 ; [L636] kernel_st = 0 [L273] COND TRUE m_i == 1 [L274] m_st = 0 [L278] COND TRUE t1_i == 1 [L279] t1_st = 0 [L283] COND TRUE t2_i == 1 [L284] t2_st = 0 [L288] COND TRUE t3_i == 1 [L289] t3_st = 0 [L410] COND FALSE !(M_E == 0) [L415] COND FALSE !(T1_E == 0) [L420] COND FALSE !(T2_E == 0) [L425] COND FALSE !(T3_E == 0) [L430] COND FALSE !(E_1 == 0) [L435] COND FALSE !(E_2 == 0) [L440] COND FALSE !(E_3 == 0) [L493] int tmp ; [L494] int tmp___0 ; [L495] int tmp___1 ; [L496] int tmp___2 ; [L186] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L189] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L199] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L201] return (__retres1); [L500] tmp = is_master_triggered() [L502] COND FALSE !(\read(tmp)) [L205] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L208] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L218] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L220] return (__retres1); [L508] tmp___0 = is_transmit1_triggered() [L510] COND FALSE !(\read(tmp___0)) [L224] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L227] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L237] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L239] return (__retres1); [L516] tmp___1 = is_transmit2_triggered() [L518] COND FALSE !(\read(tmp___1)) [L243] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L246] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L256] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L258] return (__retres1); [L524] tmp___2 = is_transmit3_triggered() [L526] COND FALSE !(\read(tmp___2)) [L453] COND FALSE !(M_E == 1) [L458] COND FALSE !(T1_E == 1) [L463] COND FALSE !(T2_E == 1) [L468] COND FALSE !(T3_E == 1) [L473] COND FALSE !(E_1 == 1) [L478] COND FALSE !(E_2 == 1) [L483] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L644] COND TRUE 1 [L647] kernel_st = 1 [L329] int tmp ; VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L333] COND TRUE 1 [L298] int __retres1 ; [L301] COND TRUE m_st == 0 [L302] __retres1 = 1 [L324] return (__retres1); [L336] tmp = exists_runnable_thread() [L338] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L343] COND TRUE m_st == 0 [L344] int tmp_ndt_1; [L345] tmp_ndt_1 = __VERIFIER_nondet_int() [L346] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L357] COND TRUE t1_st == 0 [L358] int tmp_ndt_2; [L359] tmp_ndt_2 = __VERIFIER_nondet_int() [L360] COND TRUE \read(tmp_ndt_2) [L362] t1_st = 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L86] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L97] COND TRUE 1 [L99] t1_pc = 1 [L100] t1_st = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L371] COND TRUE t2_st == 0 [L372] int tmp_ndt_3; [L373] tmp_ndt_3 = __VERIFIER_nondet_int() [L374] COND TRUE \read(tmp_ndt_3) [L376] t2_st = 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L121] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L132] COND TRUE 1 [L134] t2_pc = 1 [L135] t2_st = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L385] COND TRUE t3_st == 0 [L386] int tmp_ndt_4; [L387] tmp_ndt_4 = __VERIFIER_nondet_int() [L388] COND TRUE \read(tmp_ndt_4) [L390] t3_st = 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=1] [L156] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=0, t3_st=1] [L167] COND TRUE 1 [L169] t3_pc = 1 [L170] t3_st = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L333] COND TRUE 1 [L298] int __retres1 ; [L301] COND TRUE m_st == 0 [L302] __retres1 = 1 [L324] return (__retres1); [L336] tmp = exists_runnable_thread() [L338] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L343] COND TRUE m_st == 0 [L344] int tmp_ndt_1; [L345] tmp_ndt_1 = __VERIFIER_nondet_int() [L346] COND TRUE \read(tmp_ndt_1) [L348] m_st = 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L45] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L56] COND TRUE 1 [L59] E_1 = 1 [L493] int tmp ; [L494] int tmp___0 ; [L495] int tmp___1 ; [L496] int tmp___2 ; [L186] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L189] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L199] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L201] return (__retres1); [L500] tmp = is_master_triggered() [L502] COND FALSE !(\read(tmp)) [L205] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L208] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] COND TRUE E_1 == 1 [L210] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L220] return (__retres1); [L508] tmp___0 = is_transmit1_triggered() [L510] COND TRUE \read(tmp___0) [L511] t1_st = 0 [L224] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L227] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L237] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L239] return (__retres1); [L516] tmp___1 = is_transmit2_triggered() [L518] COND FALSE !(\read(tmp___1)) [L243] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L246] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L256] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L258] return (__retres1); [L524] tmp___2 = is_transmit3_triggered() [L526] COND FALSE !(\read(tmp___2)) [L61] E_1 = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L64] COND TRUE 1 [L66] m_pc = 1 [L67] m_st = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L357] COND TRUE t1_st == 0 [L358] int tmp_ndt_2; [L359] tmp_ndt_2 = __VERIFIER_nondet_int() [L360] COND TRUE \read(tmp_ndt_2) [L362] t1_st = 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L86] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L89] COND TRUE t1_pc == 1 [L105] E_2 = 1 [L493] int tmp ; [L494] int tmp___0 ; [L495] int tmp___1 ; [L496] int tmp___2 ; [L186] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L189] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L190] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L199] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L201] return (__retres1); [L500] tmp = is_master_triggered() [L502] COND FALSE !(\read(tmp)) [L205] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L208] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L218] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L220] return (__retres1); [L508] tmp___0 = is_transmit1_triggered() [L510] COND FALSE !(\read(tmp___0)) [L224] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L227] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] COND TRUE E_2 == 1 [L229] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L239] return (__retres1); [L516] tmp___1 = is_transmit2_triggered() [L518] COND TRUE \read(tmp___1) [L519] t2_st = 0 [L243] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L246] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L256] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L258] return (__retres1); [L524] tmp___2 = is_transmit3_triggered() [L526] COND FALSE !(\read(tmp___2)) [L107] E_2 = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L97] COND TRUE 1 [L99] t1_pc = 1 [L100] t1_st = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L371] COND TRUE t2_st == 0 [L372] int tmp_ndt_3; [L373] tmp_ndt_3 = __VERIFIER_nondet_int() [L374] COND TRUE \read(tmp_ndt_3) [L376] t2_st = 1 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L121] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L124] COND TRUE t2_pc == 1 [L140] E_3 = 1 [L493] int tmp ; [L494] int tmp___0 ; [L495] int tmp___1 ; [L496] int tmp___2 ; [L186] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L189] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L190] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L199] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L201] return (__retres1); [L500] tmp = is_master_triggered() [L502] COND FALSE !(\read(tmp)) [L205] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L208] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L218] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L220] return (__retres1); [L508] tmp___0 = is_transmit1_triggered() [L510] COND FALSE !(\read(tmp___0)) [L224] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L227] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L237] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L239] return (__retres1); [L516] tmp___1 = is_transmit2_triggered() [L518] COND FALSE !(\read(tmp___1)) [L243] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L246] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] COND TRUE E_3 == 1 [L248] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L258] return (__retres1); [L524] tmp___2 = is_transmit3_triggered() [L526] COND TRUE \read(tmp___2) [L527] t3_st = 0 [L142] E_3 = 2 VAL [E_1=2, E_2=2, E_3=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L132] COND TRUE 1 [L134] t2_pc = 1 [L135] t2_st = 2 VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L385] COND TRUE t3_st == 0 [L386] int tmp_ndt_4; [L387] tmp_ndt_4 = __VERIFIER_nondet_int() [L388] COND TRUE \read(tmp_ndt_4) [L390] t3_st = 1 VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L156] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L159] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L3] __assert_fail("0", "transmitter.03.cil.c", 3, "reach_error") VAL [E_1=2, E_2=2, E_3=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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.1s, OverallIterations: 23, TraceHistogramMax: 3, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4751 SDtfs, 5442 SDslu, 5018 SDs, 0 SdLazy, 836 SolverSat, 270 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 725 GetRequests, 652 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7668occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 13685 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1760 NumberOfCodeBlocks, 1760 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1944 ConstructedInterpolants, 0 QuantifiedInterpolants, 412008 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1462 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 30 InterpolantComputations, 26 PerfectInterpolantSequences, 382/386 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...