./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7ae788f3-605e-4fd5-8f72-edf93f145663/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7ae788f3-605e-4fd5-8f72-edf93f145663/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7ae788f3-605e-4fd5-8f72-edf93f145663/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7ae788f3-605e-4fd5-8f72-edf93f145663/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7ae788f3-605e-4fd5-8f72-edf93f145663/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7ae788f3-605e-4fd5-8f72-edf93f145663/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 59598ef74ac7afb6c962e2cc2ba26af488759b7c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:23:06,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:23:06,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:23:06,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:23:06,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:23:06,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:23:06,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:23:06,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:23:06,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:23:06,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:23:06,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:23:06,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:23:06,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:23:06,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:23:06,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:23:06,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:23:06,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:23:06,480 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:23:06,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:23:06,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:23:06,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:23:06,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:23:06,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:23:06,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:23:06,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:23:06,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:23:06,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:23:06,489 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:23:06,490 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:23:06,490 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:23:06,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:23:06,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:23:06,492 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:23:06,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:23:06,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:23:06,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:23:06,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:23:06,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:23:06,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:23:06,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:23:06,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:23:06,496 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7ae788f3-605e-4fd5-8f72-edf93f145663/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:23:06,506 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:23:06,507 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:23:06,507 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:23:06,508 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:23:06,508 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:23:06,508 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:23:06,508 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:23:06,508 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:23:06,508 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:23:06,509 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:23:06,509 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:23:06,509 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:23:06,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:23:06,510 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:23:06,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:23:06,510 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:23:06,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:23:06,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:23:06,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:23:06,511 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:23:06,511 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:23:06,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:23:06,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:23:06,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:23:06,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:23:06,512 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:23:06,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:23:06,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:06,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:23:06,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:23:06,513 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:23:06,513 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:23:06,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:23:06,514 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:23:06,514 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:23:06,514 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_7ae788f3-605e-4fd5-8f72-edf93f145663/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(__VERIFIER_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 -> 59598ef74ac7afb6c962e2cc2ba26af488759b7c [2019-10-22 11:23:06,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:23:06,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:23:06,550 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:23:06,552 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:23:06,552 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:23:06,553 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7ae788f3-605e-4fd5-8f72-edf93f145663/bin/utaipan/../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2019-10-22 11:23:06,599 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7ae788f3-605e-4fd5-8f72-edf93f145663/bin/utaipan/data/20a28e5f6/cffe2800742145f59944164d63da81c3/FLAG473f9f3a8 [2019-10-22 11:23:06,974 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:23:06,975 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7ae788f3-605e-4fd5-8f72-edf93f145663/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2019-10-22 11:23:06,982 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7ae788f3-605e-4fd5-8f72-edf93f145663/bin/utaipan/data/20a28e5f6/cffe2800742145f59944164d63da81c3/FLAG473f9f3a8 [2019-10-22 11:23:07,389 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7ae788f3-605e-4fd5-8f72-edf93f145663/bin/utaipan/data/20a28e5f6/cffe2800742145f59944164d63da81c3 [2019-10-22 11:23:07,391 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:23:07,392 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:23:07,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:07,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:23:07,409 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:23:07,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:07" (1/1) ... [2019-10-22 11:23:07,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c01b3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07, skipping insertion in model container [2019-10-22 11:23:07,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:07" (1/1) ... [2019-10-22 11:23:07,417 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:23:07,443 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:23:07,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:07,683 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:23:07,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:07,747 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:23:07,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07 WrapperNode [2019-10-22 11:23:07,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:07,748 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:07,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:23:07,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:23:07,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07" (1/1) ... [2019-10-22 11:23:07,765 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07" (1/1) ... [2019-10-22 11:23:07,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:07,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:23:07,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:23:07,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:23:07,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07" (1/1) ... [2019-10-22 11:23:07,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07" (1/1) ... [2019-10-22 11:23:07,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07" (1/1) ... [2019-10-22 11:23:07,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07" (1/1) ... [2019-10-22 11:23:07,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07" (1/1) ... [2019-10-22 11:23:07,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07" (1/1) ... [2019-10-22 11:23:07,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07" (1/1) ... [2019-10-22 11:23:07,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:23:07,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:23:07,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:23:07,847 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:23:07,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ae788f3-605e-4fd5-8f72-edf93f145663/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 [2019-10-22 11:23:07,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:23:07,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:23:08,527 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:23:08,528 INFO L284 CfgBuilder]: Removed 82 assume(true) statements. [2019-10-22 11:23:08,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:08 BoogieIcfgContainer [2019-10-22 11:23:08,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:23:08,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:23:08,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:23:08,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:23:08,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:23:07" (1/3) ... [2019-10-22 11:23:08,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213aad13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:08, skipping insertion in model container [2019-10-22 11:23:08,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07" (2/3) ... [2019-10-22 11:23:08,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213aad13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:08, skipping insertion in model container [2019-10-22 11:23:08,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:08" (3/3) ... [2019-10-22 11:23:08,539 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2019-10-22 11:23:08,550 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:23:08,558 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-22 11:23:08,572 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-22 11:23:08,605 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:23:08,605 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:23:08,605 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:23:08,606 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:23:08,606 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:23:08,606 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:23:08,606 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:23:08,606 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:23:08,630 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-10-22 11:23:08,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 11:23:08,641 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:08,642 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:08,645 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:08,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:08,651 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2019-10-22 11:23:08,662 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:08,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234487380] [2019-10-22 11:23:08,663 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:08,663 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:08,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:08,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:08,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234487380] [2019-10-22 11:23:08,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:08,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:08,809 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139568077] [2019-10-22 11:23:08,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:08,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:08,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:08,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:08,834 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-10-22 11:23:08,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:08,896 INFO L93 Difference]: Finished difference Result 291 states and 455 transitions. [2019-10-22 11:23:08,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:08,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-22 11:23:08,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:08,910 INFO L225 Difference]: With dead ends: 291 [2019-10-22 11:23:08,911 INFO L226 Difference]: Without dead ends: 144 [2019-10-22 11:23:08,914 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:08,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-10-22 11:23:08,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-10-22 11:23:08,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-10-22 11:23:08,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 216 transitions. [2019-10-22 11:23:08,978 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 216 transitions. Word has length 39 [2019-10-22 11:23:08,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:08,978 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 216 transitions. [2019-10-22 11:23:08,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 216 transitions. [2019-10-22 11:23:08,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 11:23:08,985 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:08,985 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:08,986 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:08,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:08,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2019-10-22 11:23:08,987 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:08,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027775447] [2019-10-22 11:23:08,987 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:08,988 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:08,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:09,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027775447] [2019-10-22 11:23:09,050 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:09,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:09,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575172410] [2019-10-22 11:23:09,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:09,055 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:09,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:09,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:09,056 INFO L87 Difference]: Start difference. First operand 144 states and 216 transitions. Second operand 3 states. [2019-10-22 11:23:09,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:09,159 INFO L93 Difference]: Finished difference Result 384 states and 576 transitions. [2019-10-22 11:23:09,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:09,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-22 11:23:09,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:09,162 INFO L225 Difference]: With dead ends: 384 [2019-10-22 11:23:09,163 INFO L226 Difference]: Without dead ends: 246 [2019-10-22 11:23:09,164 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:09,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-10-22 11:23:09,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2019-10-22 11:23:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-10-22 11:23:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 362 transitions. [2019-10-22 11:23:09,192 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 362 transitions. Word has length 39 [2019-10-22 11:23:09,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:09,193 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 362 transitions. [2019-10-22 11:23:09,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:09,193 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 362 transitions. [2019-10-22 11:23:09,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 11:23:09,194 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:09,194 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:09,195 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:09,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:09,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2019-10-22 11:23:09,195 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:09,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108751452] [2019-10-22 11:23:09,196 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:09,196 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:09,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:09,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:09,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108751452] [2019-10-22 11:23:09,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:09,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:09,245 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990812296] [2019-10-22 11:23:09,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:09,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:09,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:09,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:09,247 INFO L87 Difference]: Start difference. First operand 242 states and 362 transitions. Second operand 3 states. [2019-10-22 11:23:09,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:09,311 INFO L93 Difference]: Finished difference Result 477 states and 715 transitions. [2019-10-22 11:23:09,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:09,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-22 11:23:09,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:09,314 INFO L225 Difference]: With dead ends: 477 [2019-10-22 11:23:09,314 INFO L226 Difference]: Without dead ends: 242 [2019-10-22 11:23:09,315 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:09,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-10-22 11:23:09,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-10-22 11:23:09,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-10-22 11:23:09,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 354 transitions. [2019-10-22 11:23:09,341 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 354 transitions. Word has length 39 [2019-10-22 11:23:09,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:09,341 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 354 transitions. [2019-10-22 11:23:09,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:09,341 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 354 transitions. [2019-10-22 11:23:09,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 11:23:09,342 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:09,342 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:09,343 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:09,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:09,344 INFO L82 PathProgramCache]: Analyzing trace with hash -5694440, now seen corresponding path program 1 times [2019-10-22 11:23:09,344 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:09,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716680028] [2019-10-22 11:23:09,344 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:09,344 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:09,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:09,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716680028] [2019-10-22 11:23:09,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:09,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:09,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111758142] [2019-10-22 11:23:09,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:09,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:09,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:09,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:09,399 INFO L87 Difference]: Start difference. First operand 242 states and 354 transitions. Second operand 3 states. [2019-10-22 11:23:09,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:09,462 INFO L93 Difference]: Finished difference Result 476 states and 698 transitions. [2019-10-22 11:23:09,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:09,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-22 11:23:09,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:09,464 INFO L225 Difference]: With dead ends: 476 [2019-10-22 11:23:09,465 INFO L226 Difference]: Without dead ends: 242 [2019-10-22 11:23:09,466 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:09,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-10-22 11:23:09,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-10-22 11:23:09,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-10-22 11:23:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 340 transitions. [2019-10-22 11:23:09,486 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 340 transitions. Word has length 39 [2019-10-22 11:23:09,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:09,486 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 340 transitions. [2019-10-22 11:23:09,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 340 transitions. [2019-10-22 11:23:09,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 11:23:09,488 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:09,488 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:09,488 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:09,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:09,489 INFO L82 PathProgramCache]: Analyzing trace with hash -752003180, now seen corresponding path program 1 times [2019-10-22 11:23:09,489 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:09,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253312711] [2019-10-22 11:23:09,489 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:09,489 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:09,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:09,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253312711] [2019-10-22 11:23:09,547 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:09,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:09,548 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131987828] [2019-10-22 11:23:09,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:09,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:09,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:09,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:09,549 INFO L87 Difference]: Start difference. First operand 242 states and 340 transitions. Second operand 3 states. [2019-10-22 11:23:09,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:09,616 INFO L93 Difference]: Finished difference Result 475 states and 669 transitions. [2019-10-22 11:23:09,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:09,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-22 11:23:09,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:09,619 INFO L225 Difference]: With dead ends: 475 [2019-10-22 11:23:09,620 INFO L226 Difference]: Without dead ends: 242 [2019-10-22 11:23:09,621 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:09,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-10-22 11:23:09,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-10-22 11:23:09,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-10-22 11:23:09,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 326 transitions. [2019-10-22 11:23:09,662 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 326 transitions. Word has length 39 [2019-10-22 11:23:09,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:09,662 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 326 transitions. [2019-10-22 11:23:09,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:09,662 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 326 transitions. [2019-10-22 11:23:09,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 11:23:09,663 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:09,663 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:09,664 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:09,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:09,664 INFO L82 PathProgramCache]: Analyzing trace with hash 729577623, now seen corresponding path program 1 times [2019-10-22 11:23:09,664 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:09,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027391968] [2019-10-22 11:23:09,665 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:09,665 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:09,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:09,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:09,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027391968] [2019-10-22 11:23:09,739 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:09,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:09,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226217365] [2019-10-22 11:23:09,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:09,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:09,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:09,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:09,740 INFO L87 Difference]: Start difference. First operand 242 states and 326 transitions. Second operand 3 states. [2019-10-22 11:23:09,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:09,796 INFO L93 Difference]: Finished difference Result 662 states and 893 transitions. [2019-10-22 11:23:09,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:09,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-22 11:23:09,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:09,799 INFO L225 Difference]: With dead ends: 662 [2019-10-22 11:23:09,799 INFO L226 Difference]: Without dead ends: 431 [2019-10-22 11:23:09,800 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:09,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-10-22 11:23:09,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 407. [2019-10-22 11:23:09,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-10-22 11:23:09,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 538 transitions. [2019-10-22 11:23:09,822 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 538 transitions. Word has length 39 [2019-10-22 11:23:09,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:09,822 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 538 transitions. [2019-10-22 11:23:09,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:09,823 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 538 transitions. [2019-10-22 11:23:09,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 11:23:09,824 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:09,824 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:09,825 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:09,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:09,825 INFO L82 PathProgramCache]: Analyzing trace with hash 407580417, now seen corresponding path program 1 times [2019-10-22 11:23:09,825 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:09,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476498833] [2019-10-22 11:23:09,825 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:09,826 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:09,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:09,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476498833] [2019-10-22 11:23:09,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:09,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:09,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267746453] [2019-10-22 11:23:09,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:09,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:09,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:09,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:09,897 INFO L87 Difference]: Start difference. First operand 407 states and 538 transitions. Second operand 5 states. [2019-10-22 11:23:10,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:10,028 INFO L93 Difference]: Finished difference Result 985 states and 1321 transitions. [2019-10-22 11:23:10,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:23:10,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-10-22 11:23:10,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:10,031 INFO L225 Difference]: With dead ends: 985 [2019-10-22 11:23:10,031 INFO L226 Difference]: Without dead ends: 593 [2019-10-22 11:23:10,032 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:23:10,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-10-22 11:23:10,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 413. [2019-10-22 11:23:10,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-10-22 11:23:10,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 533 transitions. [2019-10-22 11:23:10,060 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 533 transitions. Word has length 63 [2019-10-22 11:23:10,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:10,060 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 533 transitions. [2019-10-22 11:23:10,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:10,060 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 533 transitions. [2019-10-22 11:23:10,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 11:23:10,062 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:10,062 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:10,062 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:10,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:10,062 INFO L82 PathProgramCache]: Analyzing trace with hash 830282243, now seen corresponding path program 1 times [2019-10-22 11:23:10,063 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:10,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415375938] [2019-10-22 11:23:10,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:10,064 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:10,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:10,130 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:10,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415375938] [2019-10-22 11:23:10,130 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:10,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:10,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813643903] [2019-10-22 11:23:10,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:10,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:10,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:10,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:10,133 INFO L87 Difference]: Start difference. First operand 413 states and 533 transitions. Second operand 3 states. [2019-10-22 11:23:10,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:10,203 INFO L93 Difference]: Finished difference Result 1143 states and 1486 transitions. [2019-10-22 11:23:10,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:10,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-10-22 11:23:10,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:10,207 INFO L225 Difference]: With dead ends: 1143 [2019-10-22 11:23:10,207 INFO L226 Difference]: Without dead ends: 747 [2019-10-22 11:23:10,208 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:10,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-10-22 11:23:10,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 715. [2019-10-22 11:23:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-10-22 11:23:10,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 925 transitions. [2019-10-22 11:23:10,252 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 925 transitions. Word has length 63 [2019-10-22 11:23:10,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:10,253 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 925 transitions. [2019-10-22 11:23:10,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:10,253 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 925 transitions. [2019-10-22 11:23:10,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 11:23:10,254 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:10,256 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:10,256 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:10,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:10,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1821446916, now seen corresponding path program 1 times [2019-10-22 11:23:10,256 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:10,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177282699] [2019-10-22 11:23:10,257 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:10,257 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:10,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:10,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:10,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177282699] [2019-10-22 11:23:10,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:10,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:10,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664428882] [2019-10-22 11:23:10,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:10,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:10,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:10,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:10,323 INFO L87 Difference]: Start difference. First operand 715 states and 925 transitions. Second operand 5 states. [2019-10-22 11:23:10,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:10,454 INFO L93 Difference]: Finished difference Result 1617 states and 2113 transitions. [2019-10-22 11:23:10,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:23:10,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-10-22 11:23:10,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:10,458 INFO L225 Difference]: With dead ends: 1617 [2019-10-22 11:23:10,458 INFO L226 Difference]: Without dead ends: 923 [2019-10-22 11:23:10,460 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:23:10,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-10-22 11:23:10,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 721. [2019-10-22 11:23:10,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-10-22 11:23:10,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 912 transitions. [2019-10-22 11:23:10,524 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 912 transitions. Word has length 63 [2019-10-22 11:23:10,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:10,524 INFO L462 AbstractCegarLoop]: Abstraction has 721 states and 912 transitions. [2019-10-22 11:23:10,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:10,524 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 912 transitions. [2019-10-22 11:23:10,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 11:23:10,525 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:10,526 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:10,526 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:10,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:10,526 INFO L82 PathProgramCache]: Analyzing trace with hash -355810040, now seen corresponding path program 1 times [2019-10-22 11:23:10,526 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:10,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902933871] [2019-10-22 11:23:10,527 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:10,532 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:10,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:10,571 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:10,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902933871] [2019-10-22 11:23:10,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:10,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:10,576 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272891202] [2019-10-22 11:23:10,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:10,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:10,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:10,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:10,577 INFO L87 Difference]: Start difference. First operand 721 states and 912 transitions. Second operand 3 states. [2019-10-22 11:23:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:10,651 INFO L93 Difference]: Finished difference Result 2017 states and 2558 transitions. [2019-10-22 11:23:10,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:10,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-10-22 11:23:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:10,656 INFO L225 Difference]: With dead ends: 2017 [2019-10-22 11:23:10,656 INFO L226 Difference]: Without dead ends: 1321 [2019-10-22 11:23:10,657 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:10,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2019-10-22 11:23:10,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1317. [2019-10-22 11:23:10,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2019-10-22 11:23:10,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1638 transitions. [2019-10-22 11:23:10,720 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1638 transitions. Word has length 63 [2019-10-22 11:23:10,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:10,720 INFO L462 AbstractCegarLoop]: Abstraction has 1317 states and 1638 transitions. [2019-10-22 11:23:10,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:10,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1638 transitions. [2019-10-22 11:23:10,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-22 11:23:10,721 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:10,721 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:10,721 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:10,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:10,722 INFO L82 PathProgramCache]: Analyzing trace with hash 801765960, now seen corresponding path program 1 times [2019-10-22 11:23:10,722 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:10,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948910768] [2019-10-22 11:23:10,722 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:10,722 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:10,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:10,745 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:10,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948910768] [2019-10-22 11:23:10,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:10,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:10,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357139008] [2019-10-22 11:23:10,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:10,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:10,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:10,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:10,747 INFO L87 Difference]: Start difference. First operand 1317 states and 1638 transitions. Second operand 3 states. [2019-10-22 11:23:10,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:10,884 INFO L93 Difference]: Finished difference Result 3670 states and 4533 transitions. [2019-10-22 11:23:10,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:10,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-10-22 11:23:10,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:10,891 INFO L225 Difference]: With dead ends: 3670 [2019-10-22 11:23:10,891 INFO L226 Difference]: Without dead ends: 1847 [2019-10-22 11:23:10,893 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:10,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2019-10-22 11:23:10,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1847. [2019-10-22 11:23:10,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1847 states. [2019-10-22 11:23:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2255 transitions. [2019-10-22 11:23:10,985 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2255 transitions. Word has length 64 [2019-10-22 11:23:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:10,986 INFO L462 AbstractCegarLoop]: Abstraction has 1847 states and 2255 transitions. [2019-10-22 11:23:10,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2255 transitions. [2019-10-22 11:23:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-22 11:23:10,990 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:10,990 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-22 11:23:10,990 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:10,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:10,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1159062640, now seen corresponding path program 1 times [2019-10-22 11:23:10,991 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:10,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679448276] [2019-10-22 11:23:10,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:10,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:10,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:11,025 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-22 11:23:11,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679448276] [2019-10-22 11:23:11,027 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:11,027 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:11,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842128057] [2019-10-22 11:23:11,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:11,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:11,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:11,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:11,028 INFO L87 Difference]: Start difference. First operand 1847 states and 2255 transitions. Second operand 3 states. [2019-10-22 11:23:11,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:11,130 INFO L93 Difference]: Finished difference Result 3621 states and 4413 transitions. [2019-10-22 11:23:11,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:11,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-10-22 11:23:11,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:11,136 INFO L225 Difference]: With dead ends: 3621 [2019-10-22 11:23:11,138 INFO L226 Difference]: Without dead ends: 1799 [2019-10-22 11:23:11,140 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:11,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2019-10-22 11:23:11,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2019-10-22 11:23:11,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2019-10-22 11:23:11,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2119 transitions. [2019-10-22 11:23:11,232 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2119 transitions. Word has length 93 [2019-10-22 11:23:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:11,233 INFO L462 AbstractCegarLoop]: Abstraction has 1799 states and 2119 transitions. [2019-10-22 11:23:11,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2119 transitions. [2019-10-22 11:23:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-22 11:23:11,234 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:11,235 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:11,235 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:11,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:11,235 INFO L82 PathProgramCache]: Analyzing trace with hash -2067380816, now seen corresponding path program 1 times [2019-10-22 11:23:11,236 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:11,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696219609] [2019-10-22 11:23:11,236 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:11,236 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:11,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:11,275 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 11:23:11,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696219609] [2019-10-22 11:23:11,275 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:11,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:11,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660352194] [2019-10-22 11:23:11,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:11,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:11,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:11,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:11,277 INFO L87 Difference]: Start difference. First operand 1799 states and 2119 transitions. Second operand 3 states. [2019-10-22 11:23:11,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:11,389 INFO L93 Difference]: Finished difference Result 3078 states and 3607 transitions. [2019-10-22 11:23:11,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:11,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-22 11:23:11,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:11,392 INFO L225 Difference]: With dead ends: 3078 [2019-10-22 11:23:11,392 INFO L226 Difference]: Without dead ends: 724 [2019-10-22 11:23:11,396 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:11,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-10-22 11:23:11,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 716. [2019-10-22 11:23:11,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-10-22 11:23:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 806 transitions. [2019-10-22 11:23:11,473 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 806 transitions. Word has length 94 [2019-10-22 11:23:11,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:11,473 INFO L462 AbstractCegarLoop]: Abstraction has 716 states and 806 transitions. [2019-10-22 11:23:11,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:11,474 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 806 transitions. [2019-10-22 11:23:11,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-22 11:23:11,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:11,474 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 11:23:11,475 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:11,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:11,475 INFO L82 PathProgramCache]: Analyzing trace with hash -899403247, now seen corresponding path program 1 times [2019-10-22 11:23:11,475 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:11,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068746604] [2019-10-22 11:23:11,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:11,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:11,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:11,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068746604] [2019-10-22 11:23:11,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:11,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:11,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69943709] [2019-10-22 11:23:11,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:11,518 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:11,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:11,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:11,519 INFO L87 Difference]: Start difference. First operand 716 states and 806 transitions. Second operand 3 states. [2019-10-22 11:23:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:11,571 INFO L93 Difference]: Finished difference Result 1048 states and 1187 transitions. [2019-10-22 11:23:11,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:11,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-22 11:23:11,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:11,573 INFO L225 Difference]: With dead ends: 1048 [2019-10-22 11:23:11,574 INFO L226 Difference]: Without dead ends: 594 [2019-10-22 11:23:11,574 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:11,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-10-22 11:23:11,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2019-10-22 11:23:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-10-22 11:23:11,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 662 transitions. [2019-10-22 11:23:11,605 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 662 transitions. Word has length 94 [2019-10-22 11:23:11,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:11,605 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 662 transitions. [2019-10-22 11:23:11,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:11,605 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 662 transitions. [2019-10-22 11:23:11,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-22 11:23:11,606 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:11,606 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 11:23:11,606 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:11,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:11,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1716798106, now seen corresponding path program 1 times [2019-10-22 11:23:11,607 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:11,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777447455] [2019-10-22 11:23:11,607 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:11,608 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:11,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:11,671 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 11:23:11,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777447455] [2019-10-22 11:23:11,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:11,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:11,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335668605] [2019-10-22 11:23:11,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:11,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:11,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:11,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:11,673 INFO L87 Difference]: Start difference. First operand 594 states and 662 transitions. Second operand 4 states. [2019-10-22 11:23:11,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:11,712 INFO L93 Difference]: Finished difference Result 598 states and 666 transitions. [2019-10-22 11:23:11,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:11,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-10-22 11:23:11,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:11,714 INFO L225 Difference]: With dead ends: 598 [2019-10-22 11:23:11,714 INFO L226 Difference]: Without dead ends: 596 [2019-10-22 11:23:11,714 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:11,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-22 11:23:11,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 592. [2019-10-22 11:23:11,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-22 11:23:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 659 transitions. [2019-10-22 11:23:11,749 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 659 transitions. Word has length 95 [2019-10-22 11:23:11,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:11,750 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 659 transitions. [2019-10-22 11:23:11,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:11,750 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 659 transitions. [2019-10-22 11:23:11,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 11:23:11,751 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:11,751 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 11:23:11,751 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:11,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:11,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1152111348, now seen corresponding path program 1 times [2019-10-22 11:23:11,751 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:11,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700413216] [2019-10-22 11:23:11,752 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:11,752 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:11,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:11,798 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-22 11:23:11,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700413216] [2019-10-22 11:23:11,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:11,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:11,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862621950] [2019-10-22 11:23:11,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:11,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:11,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:11,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:11,802 INFO L87 Difference]: Start difference. First operand 592 states and 659 transitions. Second operand 3 states. [2019-10-22 11:23:11,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:11,862 INFO L93 Difference]: Finished difference Result 1230 states and 1372 transitions. [2019-10-22 11:23:11,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:11,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-22 11:23:11,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:11,865 INFO L225 Difference]: With dead ends: 1230 [2019-10-22 11:23:11,865 INFO L226 Difference]: Without dead ends: 900 [2019-10-22 11:23:11,866 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:11,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-10-22 11:23:11,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 594. [2019-10-22 11:23:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-10-22 11:23:11,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 661 transitions. [2019-10-22 11:23:11,907 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 661 transitions. Word has length 99 [2019-10-22 11:23:11,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:11,907 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 661 transitions. [2019-10-22 11:23:11,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:11,907 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 661 transitions. [2019-10-22 11:23:11,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 11:23:11,908 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:11,908 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 11:23:11,909 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:11,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:11,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1118276470, now seen corresponding path program 1 times [2019-10-22 11:23:11,909 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:11,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915068807] [2019-10-22 11:23:11,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:11,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:11,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:23:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:23:11,981 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:23:11,981 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:23:12,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:23:12 BoogieIcfgContainer [2019-10-22 11:23:12,074 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:23:12,074 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:23:12,074 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:23:12,074 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:23:12,075 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:08" (3/4) ... [2019-10-22 11:23:12,078 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:23:12,184 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7ae788f3-605e-4fd5-8f72-edf93f145663/bin/utaipan/witness.graphml [2019-10-22 11:23:12,184 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:23:12,186 INFO L168 Benchmark]: Toolchain (without parser) took 4793.29 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 358.6 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -179.0 MB). Peak memory consumption was 179.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:12,186 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:12,186 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -206.6 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:12,187 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:12,189 INFO L168 Benchmark]: Boogie Preprocessor took 33.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:12,190 INFO L168 Benchmark]: RCFGBuilder took 683.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:12,190 INFO L168 Benchmark]: TraceAbstraction took 3542.52 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 203.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -42.5 MB). Peak memory consumption was 161.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:12,190 INFO L168 Benchmark]: Witness Printer took 110.49 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:12,192 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 354.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -206.6 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 683.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3542.52 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 203.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -42.5 MB). Peak memory consumption was 161.4 MB. Max. memory is 11.5 GB. * Witness Printer took 110.49 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int m_st ; [L17] int t1_st ; [L18] int m_i ; [L19] int t1_i ; [L20] int M_E = 2; [L21] int T1_E = 2; [L22] int E_M = 2; [L23] int E_1 = 2; [L27] int token ; [L29] int local ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L475] int __retres1 ; [L390] m_i = 1 [L391] t1_i = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L416] int kernel_st ; [L417] int tmp ; [L418] int tmp___0 ; [L422] kernel_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L172] COND TRUE m_i == 1 [L173] m_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L177] COND TRUE t1_i == 1 [L178] t1_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L261] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L266] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L276] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L126] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L138] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L142] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L145] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L157] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L289] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L294] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L304] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L430] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L433] kernel_st = 1 [L208] int tmp ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L203] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L90] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L101] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L103] t1_pc = 1 [L104] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L187] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L203] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L45] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L48] token = __VERIFIER_nondet_int() [L49] local = token [L50] E_1 = 1 [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L126] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L136] __retres1 = 0 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L138] return (__retres1); VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L142] int __retres1 ; VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L145] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L146] COND TRUE E_1 == 1 [L147] __retres1 = 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L157] return (__retres1); VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND TRUE \read(tmp___0) [L330] t1_st = 0 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L52] E_1 = 2 [L53] m_pc = 1 [L54] m_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L90] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L93] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L109] token += 1 [L110] E_M = 1 [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L126] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L127] COND TRUE E_M == 1 [L128] __retres1 = 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L138] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L319] tmp = is_master_triggered() [L321] COND TRUE \read(tmp) [L322] m_st = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L142] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L145] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L146] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L155] __retres1 = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L112] E_M = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L101] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L103] t1_pc = 1 [L104] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L187] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L203] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L37] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L59] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L64] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L65] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L70] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L71] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L72] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L10] __VERIFIER_error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 2 error locations. Result: UNSAFE, OverallTime: 3.4s, OverallIterations: 17, TraceHistogramMax: 3, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3381 SDtfs, 2968 SDslu, 2280 SDs, 0 SdLazy, 233 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1847occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 764 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1125 NumberOfCodeBlocks, 1125 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1009 ConstructedInterpolants, 0 QuantifiedInterpolants, 125079 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 191/191 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...