./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8336b794-5e1b-4c89-a226-1e1cb245ed47/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8336b794-5e1b-4c89-a226-1e1cb245ed47/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8336b794-5e1b-4c89-a226-1e1cb245ed47/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8336b794-5e1b-4c89-a226-1e1cb245ed47/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8336b794-5e1b-4c89-a226-1e1cb245ed47/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8336b794-5e1b-4c89-a226-1e1cb245ed47/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 216b1eba72c80bc0eec8bb9ab0298bf8baf472d8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.25-f470102 [2019-12-07 11:06:41,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:06:41,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:06:41,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:06:41,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:06:41,368 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:06:41,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:06:41,371 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:06:41,372 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:06:41,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:06:41,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:06:41,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:06:41,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:06:41,375 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:06:41,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:06:41,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:06:41,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:06:41,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:06:41,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:06:41,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:06:41,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:06:41,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:06:41,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:06:41,383 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:06:41,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:06:41,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:06:41,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:06:41,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:06:41,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:06:41,386 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:06:41,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:06:41,387 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:06:41,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:06:41,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:06:41,388 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:06:41,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:06:41,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:06:41,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:06:41,389 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:06:41,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:06:41,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:06:41,391 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8336b794-5e1b-4c89-a226-1e1cb245ed47/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 11:06:41,400 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:06:41,400 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:06:41,401 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:06:41,401 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:06:41,401 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:06:41,401 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:06:41,401 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:06:41,401 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:06:41,402 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:06:41,402 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:06:41,402 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:06:41,402 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:06:41,402 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:06:41,402 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:06:41,402 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:06:41,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:06:41,403 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:06:41,403 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:06:41,403 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:06:41,403 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:06:41,403 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:06:41,403 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:06:41,403 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:06:41,403 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:06:41,404 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:06:41,404 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:06:41,404 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:06:41,404 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:06:41,404 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:06:41,404 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:06:41,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:06:41,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:06:41,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:06:41,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:06:41,405 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:06:41,405 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:06:41,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:06:41,405 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:06:41,405 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:06:41,405 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:06:41,406 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/run_dir_8336b794-5e1b-4c89-a226-1e1cb245ed47/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 -> 216b1eba72c80bc0eec8bb9ab0298bf8baf472d8 [2019-12-07 11:06:41,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:06:41,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:06:41,519 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:06:41,520 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:06:41,520 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:06:41,521 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8336b794-5e1b-4c89-a226-1e1cb245ed47/bin/utaipan/../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2019-12-07 11:06:41,566 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8336b794-5e1b-4c89-a226-1e1cb245ed47/bin/utaipan/data/8a16edec1/c6c8d25516ba48a39e2081be28f23a28/FLAGa241df81f [2019-12-07 11:06:42,004 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:06:42,004 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8336b794-5e1b-4c89-a226-1e1cb245ed47/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2019-12-07 11:06:42,011 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8336b794-5e1b-4c89-a226-1e1cb245ed47/bin/utaipan/data/8a16edec1/c6c8d25516ba48a39e2081be28f23a28/FLAGa241df81f [2019-12-07 11:06:42,020 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8336b794-5e1b-4c89-a226-1e1cb245ed47/bin/utaipan/data/8a16edec1/c6c8d25516ba48a39e2081be28f23a28 [2019-12-07 11:06:42,022 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:06:42,022 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:06:42,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:06:42,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:06:42,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:06:42,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:06:42" (1/1) ... [2019-12-07 11:06:42,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3a36ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:42, skipping insertion in model container [2019-12-07 11:06:42,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:06:42" (1/1) ... [2019-12-07 11:06:42,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:06:42,059 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:06:42,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:06:42,231 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:06:42,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:06:42,272 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:06:42,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:42 WrapperNode [2019-12-07 11:06:42,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:06:42,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:06:42,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:06:42,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:06:42,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:42" (1/1) ... [2019-12-07 11:06:42,284 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:42" (1/1) ... [2019-12-07 11:06:42,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:06:42,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:06:42,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:06:42,313 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:06:42,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:42" (1/1) ... [2019-12-07 11:06:42,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:42" (1/1) ... [2019-12-07 11:06:42,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:42" (1/1) ... [2019-12-07 11:06:42,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:42" (1/1) ... [2019-12-07 11:06:42,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:42" (1/1) ... [2019-12-07 11:06:42,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:42" (1/1) ... [2019-12-07 11:06:42,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:42" (1/1) ... [2019-12-07 11:06:42,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:06:42,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:06:42,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:06:42,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:06:42,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8336b794-5e1b-4c89-a226-1e1cb245ed47/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-12-07 11:06:42,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:06:42,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:06:43,235 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:06:43,235 INFO L287 CfgBuilder]: Removed 105 assume(true) statements. [2019-12-07 11:06:43,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:06:43 BoogieIcfgContainer [2019-12-07 11:06:43,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:06:43,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:06:43,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:06:43,240 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:06:43,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:06:42" (1/3) ... [2019-12-07 11:06:43,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f562523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:06:43, skipping insertion in model container [2019-12-07 11:06:43,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:06:42" (2/3) ... [2019-12-07 11:06:43,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f562523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:06:43, skipping insertion in model container [2019-12-07 11:06:43,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:06:43" (3/3) ... [2019-12-07 11:06:43,242 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2019-12-07 11:06:43,249 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:06:43,254 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:06:43,262 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-07 11:06:43,282 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:06:43,282 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:06:43,283 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:06:43,283 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:06:43,283 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:06:43,283 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:06:43,283 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:06:43,283 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:06:43,296 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2019-12-07 11:06:43,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:06:43,300 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:43,301 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:43,301 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:43,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:43,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1759267953, now seen corresponding path program 1 times [2019-12-07 11:06:43,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:43,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757613471] [2019-12-07 11:06:43,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:43,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:43,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757613471] [2019-12-07 11:06:43,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:43,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:06:43,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364000115] [2019-12-07 11:06:43,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:06:43,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:43,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:06:43,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:06:43,428 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 3 states. [2019-12-07 11:06:43,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:43,496 INFO L93 Difference]: Finished difference Result 286 states and 440 transitions. [2019-12-07 11:06:43,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:06:43,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 11:06:43,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:43,510 INFO L225 Difference]: With dead ends: 286 [2019-12-07 11:06:43,510 INFO L226 Difference]: Without dead ends: 179 [2019-12-07 11:06:43,512 INFO L630 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-12-07 11:06:43,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-12-07 11:06:43,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 169. [2019-12-07 11:06:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-07 11:06:43,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 248 transitions. [2019-12-07 11:06:43,554 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 248 transitions. Word has length 19 [2019-12-07 11:06:43,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:43,555 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 248 transitions. [2019-12-07 11:06:43,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:06:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 248 transitions. [2019-12-07 11:06:43,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 11:06:43,557 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:43,558 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:06:43,558 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:43,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:43,558 INFO L82 PathProgramCache]: Analyzing trace with hash -356656974, now seen corresponding path program 1 times [2019-12-07 11:06:43,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:43,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955285260] [2019-12-07 11:06:43,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:43,596 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 11:06:43,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955285260] [2019-12-07 11:06:43,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:43,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:06:43,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396825106] [2019-12-07 11:06:43,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:06:43,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:43,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:06:43,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:06:43,599 INFO L87 Difference]: Start difference. First operand 169 states and 248 transitions. Second operand 3 states. [2019-12-07 11:06:43,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:43,636 INFO L93 Difference]: Finished difference Result 459 states and 673 transitions. [2019-12-07 11:06:43,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:06:43,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-07 11:06:43,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:43,639 INFO L225 Difference]: With dead ends: 459 [2019-12-07 11:06:43,639 INFO L226 Difference]: Without dead ends: 295 [2019-12-07 11:06:43,640 INFO L630 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-12-07 11:06:43,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-12-07 11:06:43,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 289. [2019-12-07 11:06:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-12-07 11:06:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 417 transitions. [2019-12-07 11:06:43,658 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 417 transitions. Word has length 36 [2019-12-07 11:06:43,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:43,658 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 417 transitions. [2019-12-07 11:06:43,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:06:43,658 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 417 transitions. [2019-12-07 11:06:43,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 11:06:43,660 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:43,660 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:06:43,660 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:43,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:43,660 INFO L82 PathProgramCache]: Analyzing trace with hash 562317649, now seen corresponding path program 1 times [2019-12-07 11:06:43,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:43,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907574099] [2019-12-07 11:06:43,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:43,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907574099] [2019-12-07 11:06:43,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:43,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:06:43,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248275734] [2019-12-07 11:06:43,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:06:43,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:43,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:06:43,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:06:43,716 INFO L87 Difference]: Start difference. First operand 289 states and 417 transitions. Second operand 3 states. [2019-12-07 11:06:43,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:43,758 INFO L93 Difference]: Finished difference Result 799 states and 1151 transitions. [2019-12-07 11:06:43,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:06:43,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-07 11:06:43,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:43,763 INFO L225 Difference]: With dead ends: 799 [2019-12-07 11:06:43,763 INFO L226 Difference]: Without dead ends: 518 [2019-12-07 11:06:43,765 INFO L630 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-12-07 11:06:43,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-12-07 11:06:43,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 502. [2019-12-07 11:06:43,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-12-07 11:06:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 712 transitions. [2019-12-07 11:06:43,788 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 712 transitions. Word has length 36 [2019-12-07 11:06:43,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:43,789 INFO L462 AbstractCegarLoop]: Abstraction has 502 states and 712 transitions. [2019-12-07 11:06:43,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:06:43,789 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 712 transitions. [2019-12-07 11:06:43,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 11:06:43,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:43,791 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:06:43,791 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:43,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:43,792 INFO L82 PathProgramCache]: Analyzing trace with hash -717007086, now seen corresponding path program 1 times [2019-12-07 11:06:43,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:43,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207482906] [2019-12-07 11:06:43,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:43,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207482906] [2019-12-07 11:06:43,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:43,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:06:43,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764957264] [2019-12-07 11:06:43,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:06:43,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:43,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:06:43,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:06:43,845 INFO L87 Difference]: Start difference. First operand 502 states and 712 transitions. Second operand 4 states. [2019-12-07 11:06:43,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:43,926 INFO L93 Difference]: Finished difference Result 1238 states and 1798 transitions. [2019-12-07 11:06:43,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:06:43,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 11:06:43,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:43,930 INFO L225 Difference]: With dead ends: 1238 [2019-12-07 11:06:43,930 INFO L226 Difference]: Without dead ends: 746 [2019-12-07 11:06:43,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:06:43,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2019-12-07 11:06:43,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 598. [2019-12-07 11:06:43,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-12-07 11:06:43,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 872 transitions. [2019-12-07 11:06:43,948 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 872 transitions. Word has length 36 [2019-12-07 11:06:43,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:43,948 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 872 transitions. [2019-12-07 11:06:43,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:06:43,948 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 872 transitions. [2019-12-07 11:06:43,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:06:43,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:43,950 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-12-07 11:06:43,951 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:43,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:43,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1621662930, now seen corresponding path program 1 times [2019-12-07 11:06:43,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:43,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700951872] [2019-12-07 11:06:43,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:43,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:43,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700951872] [2019-12-07 11:06:43,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:43,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:06:43,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859437942] [2019-12-07 11:06:43,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:06:43,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:43,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:06:43,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:06:43,993 INFO L87 Difference]: Start difference. First operand 598 states and 872 transitions. Second operand 3 states. [2019-12-07 11:06:44,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:44,026 INFO L93 Difference]: Finished difference Result 972 states and 1420 transitions. [2019-12-07 11:06:44,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:06:44,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 11:06:44,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:44,031 INFO L225 Difference]: With dead ends: 972 [2019-12-07 11:06:44,031 INFO L226 Difference]: Without dead ends: 634 [2019-12-07 11:06:44,032 INFO L630 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-12-07 11:06:44,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-12-07 11:06:44,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 598. [2019-12-07 11:06:44,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-12-07 11:06:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 848 transitions. [2019-12-07 11:06:44,054 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 848 transitions. Word has length 52 [2019-12-07 11:06:44,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:44,054 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 848 transitions. [2019-12-07 11:06:44,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:06:44,054 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 848 transitions. [2019-12-07 11:06:44,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:06:44,056 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:44,056 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-12-07 11:06:44,057 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:44,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:44,057 INFO L82 PathProgramCache]: Analyzing trace with hash -648173971, now seen corresponding path program 1 times [2019-12-07 11:06:44,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:44,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469006588] [2019-12-07 11:06:44,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 11:06:44,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469006588] [2019-12-07 11:06:44,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:44,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:06:44,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488439400] [2019-12-07 11:06:44,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:06:44,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:44,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:06:44,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:06:44,128 INFO L87 Difference]: Start difference. First operand 598 states and 848 transitions. Second operand 4 states. [2019-12-07 11:06:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:44,167 INFO L93 Difference]: Finished difference Result 945 states and 1343 transitions. [2019-12-07 11:06:44,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:06:44,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-07 11:06:44,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:44,171 INFO L225 Difference]: With dead ends: 945 [2019-12-07 11:06:44,171 INFO L226 Difference]: Without dead ends: 615 [2019-12-07 11:06:44,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:06:44,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-12-07 11:06:44,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 598. [2019-12-07 11:06:44,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-12-07 11:06:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 834 transitions. [2019-12-07 11:06:44,194 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 834 transitions. Word has length 52 [2019-12-07 11:06:44,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:44,194 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 834 transitions. [2019-12-07 11:06:44,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:06:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 834 transitions. [2019-12-07 11:06:44,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 11:06:44,196 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:44,196 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-12-07 11:06:44,196 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:44,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:44,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1395715861, now seen corresponding path program 1 times [2019-12-07 11:06:44,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:44,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500493300] [2019-12-07 11:06:44,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:44,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:44,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500493300] [2019-12-07 11:06:44,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106766630] [2019-12-07 11:06:44,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8336b794-5e1b-4c89-a226-1e1cb245ed47/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:44,309 INFO L264 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 11:06:44,315 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:06:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 11:06:44,336 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:06:44,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:06:44,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:06:44,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 11:06:44,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:06:44,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2019-12-07 11:06:44,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350115412] [2019-12-07 11:06:44,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:06:44,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:44,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:06:44,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:06:44,348 INFO L87 Difference]: Start difference. First operand 598 states and 834 transitions. Second operand 3 states. [2019-12-07 11:06:44,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:44,417 INFO L93 Difference]: Finished difference Result 1674 states and 2328 transitions. [2019-12-07 11:06:44,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:06:44,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 11:06:44,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:44,423 INFO L225 Difference]: With dead ends: 1674 [2019-12-07 11:06:44,423 INFO L226 Difference]: Without dead ends: 1086 [2019-12-07 11:06:44,424 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:06:44,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2019-12-07 11:06:44,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1082. [2019-12-07 11:06:44,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1082 states. [2019-12-07 11:06:44,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1486 transitions. [2019-12-07 11:06:44,470 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1486 transitions. Word has length 53 [2019-12-07 11:06:44,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:44,471 INFO L462 AbstractCegarLoop]: Abstraction has 1082 states and 1486 transitions. [2019-12-07 11:06:44,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:06:44,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1486 transitions. [2019-12-07 11:06:44,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 11:06:44,473 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:44,473 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-12-07 11:06:44,674 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:44,674 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:44,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:44,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1723450510, now seen corresponding path program 1 times [2019-12-07 11:06:44,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:44,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662790216] [2019-12-07 11:06:44,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:44,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662790216] [2019-12-07 11:06:44,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859703469] [2019-12-07 11:06:44,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8336b794-5e1b-4c89-a226-1e1cb245ed47/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:44,775 INFO L264 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 11:06:44,777 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:06:44,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 11:06:44,786 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:06:44,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:06:44,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:06:44,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 11:06:44,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:06:44,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [5] total 6 [2019-12-07 11:06:44,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979737836] [2019-12-07 11:06:44,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:06:44,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:44,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:06:44,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:06:44,796 INFO L87 Difference]: Start difference. First operand 1082 states and 1486 transitions. Second operand 3 states. [2019-12-07 11:06:44,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:44,859 INFO L93 Difference]: Finished difference Result 2603 states and 3582 transitions. [2019-12-07 11:06:44,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:06:44,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-07 11:06:44,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:44,865 INFO L225 Difference]: With dead ends: 2603 [2019-12-07 11:06:44,865 INFO L226 Difference]: Without dead ends: 1531 [2019-12-07 11:06:44,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:06:44,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2019-12-07 11:06:44,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1527. [2019-12-07 11:06:44,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-12-07 11:06:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2072 transitions. [2019-12-07 11:06:44,908 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2072 transitions. Word has length 54 [2019-12-07 11:06:44,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:44,908 INFO L462 AbstractCegarLoop]: Abstraction has 1527 states and 2072 transitions. [2019-12-07 11:06:44,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:06:44,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2072 transitions. [2019-12-07 11:06:44,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 11:06:44,910 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:44,910 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-12-07 11:06:45,110 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:45,111 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:45,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:45,111 INFO L82 PathProgramCache]: Analyzing trace with hash -447945077, now seen corresponding path program 1 times [2019-12-07 11:06:45,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:45,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220472846] [2019-12-07 11:06:45,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:45,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:45,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220472846] [2019-12-07 11:06:45,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523474390] [2019-12-07 11:06:45,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8336b794-5e1b-4c89-a226-1e1cb245ed47/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:45,214 INFO L264 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 11:06:45,216 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:06:45,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:06:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:45,237 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:06:45,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:45,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:06:45,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [5] total 10 [2019-12-07 11:06:45,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981101411] [2019-12-07 11:06:45,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:06:45,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:45,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:06:45,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:06:45,257 INFO L87 Difference]: Start difference. First operand 1527 states and 2072 transitions. Second operand 8 states. [2019-12-07 11:06:45,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:45,528 INFO L93 Difference]: Finished difference Result 3426 states and 4769 transitions. [2019-12-07 11:06:45,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 11:06:45,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-07 11:06:45,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:45,536 INFO L225 Difference]: With dead ends: 3426 [2019-12-07 11:06:45,536 INFO L226 Difference]: Without dead ends: 1909 [2019-12-07 11:06:45,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:06:45,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2019-12-07 11:06:45,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1157. [2019-12-07 11:06:45,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2019-12-07 11:06:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1603 transitions. [2019-12-07 11:06:45,582 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1603 transitions. Word has length 55 [2019-12-07 11:06:45,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:45,582 INFO L462 AbstractCegarLoop]: Abstraction has 1157 states and 1603 transitions. [2019-12-07 11:06:45,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:06:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1603 transitions. [2019-12-07 11:06:45,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 11:06:45,584 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:45,584 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-12-07 11:06:45,784 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:45,784 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:45,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:45,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1503674733, now seen corresponding path program 1 times [2019-12-07 11:06:45,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:45,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817814183] [2019-12-07 11:06:45,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:45,824 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:45,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817814183] [2019-12-07 11:06:45,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397222634] [2019-12-07 11:06:45,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8336b794-5e1b-4c89-a226-1e1cb245ed47/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:45,880 INFO L264 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 11:06:45,882 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:06:45,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:45,892 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:06:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:45,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:06:45,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [5] total 8 [2019-12-07 11:06:45,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618354590] [2019-12-07 11:06:45,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:06:45,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:45,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:06:45,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:06:45,917 INFO L87 Difference]: Start difference. First operand 1157 states and 1603 transitions. Second operand 5 states. [2019-12-07 11:06:45,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:45,975 INFO L93 Difference]: Finished difference Result 2154 states and 2989 transitions. [2019-12-07 11:06:45,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:06:45,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-07 11:06:45,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:45,982 INFO L225 Difference]: With dead ends: 2154 [2019-12-07 11:06:45,982 INFO L226 Difference]: Without dead ends: 1201 [2019-12-07 11:06:45,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:06:45,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-12-07 11:06:46,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1157. [2019-12-07 11:06:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2019-12-07 11:06:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1573 transitions. [2019-12-07 11:06:46,026 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1573 transitions. Word has length 57 [2019-12-07 11:06:46,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:46,026 INFO L462 AbstractCegarLoop]: Abstraction has 1157 states and 1573 transitions. [2019-12-07 11:06:46,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:06:46,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1573 transitions. [2019-12-07 11:06:46,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 11:06:46,027 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:46,028 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-12-07 11:06:46,228 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:46,228 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:46,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:46,229 INFO L82 PathProgramCache]: Analyzing trace with hash -363323022, now seen corresponding path program 1 times [2019-12-07 11:06:46,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:46,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59039990] [2019-12-07 11:06:46,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:46,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59039990] [2019-12-07 11:06:46,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:46,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:06:46,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762415820] [2019-12-07 11:06:46,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:06:46,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:46,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:06:46,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:06:46,258 INFO L87 Difference]: Start difference. First operand 1157 states and 1573 transitions. Second operand 3 states. [2019-12-07 11:06:46,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:46,318 INFO L93 Difference]: Finished difference Result 2118 states and 2883 transitions. [2019-12-07 11:06:46,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:06:46,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-07 11:06:46,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:46,324 INFO L225 Difference]: With dead ends: 2118 [2019-12-07 11:06:46,324 INFO L226 Difference]: Without dead ends: 1165 [2019-12-07 11:06:46,326 INFO L630 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-12-07 11:06:46,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-12-07 11:06:46,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1140. [2019-12-07 11:06:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1140 states. [2019-12-07 11:06:46,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1486 transitions. [2019-12-07 11:06:46,383 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1486 transitions. Word has length 57 [2019-12-07 11:06:46,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:46,383 INFO L462 AbstractCegarLoop]: Abstraction has 1140 states and 1486 transitions. [2019-12-07 11:06:46,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:06:46,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1486 transitions. [2019-12-07 11:06:46,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:06:46,386 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:46,386 INFO L410 BasicCegarLoop]: trace histogram [3, 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-12-07 11:06:46,387 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:46,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:46,387 INFO L82 PathProgramCache]: Analyzing trace with hash 699689588, now seen corresponding path program 1 times [2019-12-07 11:06:46,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:46,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737430164] [2019-12-07 11:06:46,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:46,443 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:46,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737430164] [2019-12-07 11:06:46,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555495522] [2019-12-07 11:06:46,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8336b794-5e1b-4c89-a226-1e1cb245ed47/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:46,516 INFO L264 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 11:06:46,518 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:06:46,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:06:46,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:06:46,551 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:46,551 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:06:46,571 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:46,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:06:46,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 4] imperfect sequences [5] total 11 [2019-12-07 11:06:46,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750510626] [2019-12-07 11:06:46,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:06:46,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:46,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:06:46,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:06:46,572 INFO L87 Difference]: Start difference. First operand 1140 states and 1486 transitions. Second operand 9 states. [2019-12-07 11:06:46,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:46,974 INFO L93 Difference]: Finished difference Result 2763 states and 3640 transitions. [2019-12-07 11:06:46,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 11:06:46,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-12-07 11:06:46,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:46,981 INFO L225 Difference]: With dead ends: 2763 [2019-12-07 11:06:46,981 INFO L226 Difference]: Without dead ends: 1834 [2019-12-07 11:06:46,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2019-12-07 11:06:46,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2019-12-07 11:06:47,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1079. [2019-12-07 11:06:47,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-12-07 11:06:47,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1420 transitions. [2019-12-07 11:06:47,020 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1420 transitions. Word has length 58 [2019-12-07 11:06:47,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:47,020 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1420 transitions. [2019-12-07 11:06:47,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:06:47,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1420 transitions. [2019-12-07 11:06:47,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 11:06:47,022 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:47,022 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:06:47,222 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:47,222 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:47,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:47,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1412224130, now seen corresponding path program 1 times [2019-12-07 11:06:47,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:47,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574159] [2019-12-07 11:06:47,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:47,248 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:47,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574159] [2019-12-07 11:06:47,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:47,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:06:47,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086041545] [2019-12-07 11:06:47,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:06:47,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:47,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:06:47,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:06:47,249 INFO L87 Difference]: Start difference. First operand 1079 states and 1420 transitions. Second operand 4 states. [2019-12-07 11:06:47,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:47,318 INFO L93 Difference]: Finished difference Result 2450 states and 3226 transitions. [2019-12-07 11:06:47,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:06:47,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 11:06:47,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:47,325 INFO L225 Difference]: With dead ends: 2450 [2019-12-07 11:06:47,325 INFO L226 Difference]: Without dead ends: 1414 [2019-12-07 11:06:47,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:06:47,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2019-12-07 11:06:47,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1068. [2019-12-07 11:06:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-12-07 11:06:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1402 transitions. [2019-12-07 11:06:47,373 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1402 transitions. Word has length 59 [2019-12-07 11:06:47,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:47,373 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1402 transitions. [2019-12-07 11:06:47,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:06:47,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1402 transitions. [2019-12-07 11:06:47,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 11:06:47,375 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:47,375 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:06:47,375 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:47,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:47,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1060762502, now seen corresponding path program 1 times [2019-12-07 11:06:47,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:47,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879614690] [2019-12-07 11:06:47,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:47,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879614690] [2019-12-07 11:06:47,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:47,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:06:47,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96826091] [2019-12-07 11:06:47,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:06:47,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:47,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:06:47,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:06:47,399 INFO L87 Difference]: Start difference. First operand 1068 states and 1402 transitions. Second operand 3 states. [2019-12-07 11:06:47,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:47,449 INFO L93 Difference]: Finished difference Result 1842 states and 2427 transitions. [2019-12-07 11:06:47,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:06:47,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-12-07 11:06:47,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:47,454 INFO L225 Difference]: With dead ends: 1842 [2019-12-07 11:06:47,454 INFO L226 Difference]: Without dead ends: 843 [2019-12-07 11:06:47,455 INFO L630 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-12-07 11:06:47,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2019-12-07 11:06:47,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 819. [2019-12-07 11:06:47,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-12-07 11:06:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1038 transitions. [2019-12-07 11:06:47,482 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1038 transitions. Word has length 60 [2019-12-07 11:06:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:47,482 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 1038 transitions. [2019-12-07 11:06:47,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:06:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1038 transitions. [2019-12-07 11:06:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 11:06:47,484 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:47,484 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:06:47,484 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:47,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:47,484 INFO L82 PathProgramCache]: Analyzing trace with hash 227432027, now seen corresponding path program 1 times [2019-12-07 11:06:47,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:47,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495299664] [2019-12-07 11:06:47,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:47,519 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 11:06:47,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495299664] [2019-12-07 11:06:47,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:47,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:06:47,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789019700] [2019-12-07 11:06:47,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:06:47,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:47,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:06:47,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:06:47,521 INFO L87 Difference]: Start difference. First operand 819 states and 1038 transitions. Second operand 3 states. [2019-12-07 11:06:47,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:47,568 INFO L93 Difference]: Finished difference Result 1369 states and 1732 transitions. [2019-12-07 11:06:47,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:06:47,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-12-07 11:06:47,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:47,572 INFO L225 Difference]: With dead ends: 1369 [2019-12-07 11:06:47,573 INFO L226 Difference]: Without dead ends: 819 [2019-12-07 11:06:47,574 INFO L630 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-12-07 11:06:47,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-12-07 11:06:47,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2019-12-07 11:06:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-12-07 11:06:47,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1022 transitions. [2019-12-07 11:06:47,612 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1022 transitions. Word has length 60 [2019-12-07 11:06:47,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:47,612 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 1022 transitions. [2019-12-07 11:06:47,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:06:47,612 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1022 transitions. [2019-12-07 11:06:47,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 11:06:47,613 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:47,613 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-12-07 11:06:47,613 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:47,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:47,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1214251974, now seen corresponding path program 1 times [2019-12-07 11:06:47,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:47,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988026174] [2019-12-07 11:06:47,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:47,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:47,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988026174] [2019-12-07 11:06:47,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535050028] [2019-12-07 11:06:47,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8336b794-5e1b-4c89-a226-1e1cb245ed47/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:47,697 INFO L264 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 11:06:47,700 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:06:47,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:47,731 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:06:47,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:06:47,770 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:47,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:06:47,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 5] total 12 [2019-12-07 11:06:47,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613390295] [2019-12-07 11:06:47,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:06:47,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:47,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:06:47,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:06:47,772 INFO L87 Difference]: Start difference. First operand 819 states and 1022 transitions. Second operand 6 states. [2019-12-07 11:06:47,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:47,882 INFO L93 Difference]: Finished difference Result 1700 states and 2082 transitions. [2019-12-07 11:06:47,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:06:47,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-07 11:06:47,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:47,886 INFO L225 Difference]: With dead ends: 1700 [2019-12-07 11:06:47,887 INFO L226 Difference]: Without dead ends: 1150 [2019-12-07 11:06:47,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:06:47,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2019-12-07 11:06:47,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 979. [2019-12-07 11:06:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2019-12-07 11:06:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1189 transitions. [2019-12-07 11:06:47,923 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1189 transitions. Word has length 61 [2019-12-07 11:06:47,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:47,923 INFO L462 AbstractCegarLoop]: Abstraction has 979 states and 1189 transitions. [2019-12-07 11:06:47,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:06:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1189 transitions. [2019-12-07 11:06:47,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:06:47,925 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:47,925 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:06:48,125 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:48,126 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:48,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:48,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1418309982, now seen corresponding path program 1 times [2019-12-07 11:06:48,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:48,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483223872] [2019-12-07 11:06:48,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:48,184 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 11:06:48,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483223872] [2019-12-07 11:06:48,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:48,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:06:48,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977632003] [2019-12-07 11:06:48,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:06:48,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:48,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:06:48,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:06:48,187 INFO L87 Difference]: Start difference. First operand 979 states and 1189 transitions. Second operand 5 states. [2019-12-07 11:06:48,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:48,312 INFO L93 Difference]: Finished difference Result 1716 states and 2057 transitions. [2019-12-07 11:06:48,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:06:48,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-12-07 11:06:48,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:48,316 INFO L225 Difference]: With dead ends: 1716 [2019-12-07 11:06:48,316 INFO L226 Difference]: Without dead ends: 1265 [2019-12-07 11:06:48,317 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:06:48,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-12-07 11:06:48,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1055. [2019-12-07 11:06:48,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1055 states. [2019-12-07 11:06:48,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1259 transitions. [2019-12-07 11:06:48,356 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1259 transitions. Word has length 62 [2019-12-07 11:06:48,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:48,356 INFO L462 AbstractCegarLoop]: Abstraction has 1055 states and 1259 transitions. [2019-12-07 11:06:48,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:06:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1259 transitions. [2019-12-07 11:06:48,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:06:48,357 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:48,357 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:06:48,357 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:48,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:48,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2038897403, now seen corresponding path program 1 times [2019-12-07 11:06:48,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:48,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932483431] [2019-12-07 11:06:48,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:48,382 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:48,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932483431] [2019-12-07 11:06:48,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:48,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:06:48,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658533128] [2019-12-07 11:06:48,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:06:48,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:48,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:06:48,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:06:48,383 INFO L87 Difference]: Start difference. First operand 1055 states and 1259 transitions. Second operand 4 states. [2019-12-07 11:06:48,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:48,467 INFO L93 Difference]: Finished difference Result 2043 states and 2425 transitions. [2019-12-07 11:06:48,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:06:48,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 11:06:48,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:48,471 INFO L225 Difference]: With dead ends: 2043 [2019-12-07 11:06:48,471 INFO L226 Difference]: Without dead ends: 1199 [2019-12-07 11:06:48,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:06:48,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-12-07 11:06:48,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 940. [2019-12-07 11:06:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-12-07 11:06:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1100 transitions. [2019-12-07 11:06:48,515 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1100 transitions. Word has length 62 [2019-12-07 11:06:48,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:48,515 INFO L462 AbstractCegarLoop]: Abstraction has 940 states and 1100 transitions. [2019-12-07 11:06:48,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:06:48,515 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1100 transitions. [2019-12-07 11:06:48,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-07 11:06:48,517 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:48,517 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:06:48,517 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:48,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:48,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1721993265, now seen corresponding path program 1 times [2019-12-07 11:06:48,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:48,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198411131] [2019-12-07 11:06:48,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:48,597 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 11:06:48,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198411131] [2019-12-07 11:06:48,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:48,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:06:48,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914228609] [2019-12-07 11:06:48,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:06:48,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:48,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:06:48,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:06:48,599 INFO L87 Difference]: Start difference. First operand 940 states and 1100 transitions. Second operand 5 states. [2019-12-07 11:06:48,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:48,723 INFO L93 Difference]: Finished difference Result 2806 states and 3300 transitions. [2019-12-07 11:06:48,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:06:48,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-12-07 11:06:48,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:48,731 INFO L225 Difference]: With dead ends: 2806 [2019-12-07 11:06:48,731 INFO L226 Difference]: Without dead ends: 2356 [2019-12-07 11:06:48,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:06:48,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2019-12-07 11:06:48,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 1295. [2019-12-07 11:06:48,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1295 states. [2019-12-07 11:06:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1515 transitions. [2019-12-07 11:06:48,790 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1515 transitions. Word has length 79 [2019-12-07 11:06:48,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:48,790 INFO L462 AbstractCegarLoop]: Abstraction has 1295 states and 1515 transitions. [2019-12-07 11:06:48,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:06:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1515 transitions. [2019-12-07 11:06:48,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 11:06:48,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:48,791 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:06:48,791 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:48,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:48,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1478737572, now seen corresponding path program 1 times [2019-12-07 11:06:48,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:48,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206953662] [2019-12-07 11:06:48,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:06:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:06:48,850 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 11:06:48,851 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:06:48,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:06:48 BoogieIcfgContainer [2019-12-07 11:06:48,914 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:06:48,915 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:06:48,915 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:06:48,915 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:06:48,915 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:06:43" (3/4) ... [2019-12-07 11:06:48,916 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:06:48,984 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8336b794-5e1b-4c89-a226-1e1cb245ed47/bin/utaipan/witness.graphml [2019-12-07 11:06:48,984 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:06:48,985 INFO L168 Benchmark]: Toolchain (without parser) took 6962.42 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 241.7 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -108.0 MB). Peak memory consumption was 133.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:06:48,985 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:06:48,986 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:06:48,986 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:06:48,986 INFO L168 Benchmark]: Boogie Preprocessor took 30.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:06:48,986 INFO L168 Benchmark]: RCFGBuilder took 893.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 958.6 MB in the end (delta: 154.9 MB). Peak memory consumption was 154.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:06:48,986 INFO L168 Benchmark]: TraceAbstraction took 5676.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 112.2 MB). Free memory was 958.6 MB in the beginning and 1.1 GB in the end (delta: -111.2 MB). Peak memory consumption was 952.9 kB. Max. memory is 11.5 GB. [2019-12-07 11:06:48,987 INFO L168 Benchmark]: Witness Printer took 69.20 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:06:48,988 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 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 249.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 893.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 958.6 MB in the end (delta: 154.9 MB). Peak memory consumption was 154.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5676.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 112.2 MB). Free memory was 958.6 MB in the beginning and 1.1 GB in the end (delta: -111.2 MB). Peak memory consumption was 952.9 kB. Max. memory is 11.5 GB. * Witness Printer took 69.20 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 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 t2_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int t2_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int t2_i ; [L23] int M_E = 2; [L24] int T1_E = 2; [L25] int T2_E = 2; [L26] int E_M = 2; [L27] int E_1 = 2; [L28] int E_2 = 2; [L33] int token ; [L35] int local ; [L600] int __retres1 ; [L514] m_i = 1 [L515] t1_i = 1 [L516] t2_i = 1 [L541] int kernel_st ; [L542] int tmp ; [L543] int tmp___0 ; [L547] kernel_st = 0 [L233] COND TRUE m_i == 1 [L234] m_st = 0 [L238] COND TRUE t1_i == 1 [L239] t1_st = 0 [L243] COND TRUE t2_i == 1 [L244] t2_st = 0 [L346] COND FALSE !(M_E == 0) [L351] COND FALSE !(T1_E == 0) [L356] COND FALSE !(T2_E == 0) [L361] COND FALSE !(E_M == 0) [L366] COND FALSE !(E_1 == 0) [L371] COND FALSE !(E_2 == 0) [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; [L165] int __retres1 ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L168] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L178] __retres1 = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L180] return (__retres1); [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) [L184] int __retres1 ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L187] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L197] __retres1 = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L199] return (__retres1); [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) [L203] int __retres1 ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L206] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L216] __retres1 = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L218] return (__retres1); [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) [L384] COND FALSE !(M_E == 1) [L389] COND FALSE !(T1_E == 1) [L394] COND FALSE !(T2_E == 1) [L399] COND FALSE !(E_M == 1) [L404] COND FALSE !(E_1 == 1) [L409] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L555] COND TRUE 1 [L558] kernel_st = 1 [L279] int tmp ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L283] COND TRUE 1 [L253] int __retres1 ; [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 [L274] return (__retres1); [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L307] COND TRUE t1_st == 0 [L308] int tmp_ndt_2; [L309] tmp_ndt_2 = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp_ndt_2) [L312] t1_st = 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L96] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L107] COND TRUE 1 [L109] t1_pc = 1 [L110] t1_st = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L321] COND TRUE t2_st == 0 [L322] int tmp_ndt_3; [L323] tmp_ndt_3 = __VERIFIER_nondet_int() [L324] COND TRUE \read(tmp_ndt_3) [L326] t2_st = 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L132] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L143] COND TRUE 1 [L145] t2_pc = 1 [L146] t2_st = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L283] COND TRUE 1 [L253] int __retres1 ; [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 [L274] return (__retres1); [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp_ndt_1) [L298] m_st = 1 [L38] int tmp_var = __VERIFIER_nondet_int(); [L40] COND TRUE m_pc == 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L51] COND TRUE 1 [L54] token = __VERIFIER_nondet_int() [L55] local = token [L56] E_1 = 1 [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; [L165] int __retres1 ; VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L168] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L178] __retres1 = 0 VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L180] return (__retres1); [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) [L184] int __retres1 ; VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L187] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L188] COND TRUE E_1 == 1 [L189] __retres1 = 1 VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L199] return (__retres1); [L433] tmp___0 = is_transmit1_triggered() [L435] COND TRUE \read(tmp___0) [L436] t1_st = 0 [L203] int __retres1 ; VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L206] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L207] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L216] __retres1 = 0 VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L218] return (__retres1); [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) [L58] E_1 = 2 [L59] m_pc = 1 [L60] m_st = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L307] COND TRUE t1_st == 0 [L308] int tmp_ndt_2; [L309] tmp_ndt_2 = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp_ndt_2) [L312] t1_st = 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L96] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L99] COND TRUE t1_pc == 1 [L115] token += 1 [L116] E_2 = 1 [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; [L165] int __retres1 ; VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L168] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L169] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L178] __retres1 = 0 VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L180] return (__retres1); [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) [L184] int __retres1 ; VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L187] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L188] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L197] __retres1 = 0 VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L199] return (__retres1); [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) [L203] int __retres1 ; VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L206] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L207] COND TRUE E_2 == 1 [L208] __retres1 = 1 VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L218] return (__retres1); [L441] tmp___1 = is_transmit2_triggered() [L443] COND TRUE \read(tmp___1) [L444] t2_st = 0 [L118] E_2 = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L107] COND TRUE 1 [L109] t1_pc = 1 [L110] t1_st = 2 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L321] COND TRUE t2_st == 0 [L322] int tmp_ndt_3; [L323] tmp_ndt_3 = __VERIFIER_nondet_int() [L324] COND TRUE \read(tmp_ndt_3) [L326] t2_st = 1 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L132] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L135] COND TRUE t2_pc == 1 [L151] token += 1 [L152] E_M = 1 [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; [L165] int __retres1 ; VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L168] COND TRUE m_pc == 1 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L169] COND TRUE E_M == 1 [L170] __retres1 = 1 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L180] return (__retres1); [L425] tmp = is_master_triggered() [L427] COND TRUE \read(tmp) [L428] m_st = 0 [L184] int __retres1 ; VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L187] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L188] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L197] __retres1 = 0 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L199] return (__retres1); [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) [L203] int __retres1 ; VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L206] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L207] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L216] __retres1 = 0 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L218] return (__retres1); [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) [L154] E_M = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L143] COND TRUE 1 [L145] t2_pc = 1 [L146] t2_st = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L283] COND TRUE 1 [L253] int __retres1 ; [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 [L274] return (__retres1); [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp_ndt_1) [L298] m_st = 1 [L38] int tmp_var = __VERIFIER_nondet_int(); [L40] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L43] COND TRUE m_pc == 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L65] COND FALSE !(token != local + 2) [L70] COND TRUE tmp_var <= 5 [L71] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L76] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L77] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L78] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L10] __VERIFIER_error() VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 105 locations, 2 error locations. Result: UNSAFE, OverallTime: 5.5s, OverallIterations: 20, TraceHistogramMax: 3, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3283 SDtfs, 3376 SDslu, 4270 SDs, 0 SdLazy, 865 SolverSat, 217 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 804 GetRequests, 706 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1527occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 3888 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1428 NumberOfCodeBlocks, 1428 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1653 ConstructedInterpolants, 0 QuantifiedInterpolants, 220469 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1570 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 31 InterpolantComputations, 24 PerfectInterpolantSequences, 321/339 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...