./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_33ee057c-e8ec-4fdc-bd01-14a49317f449/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_33ee057c-e8ec-4fdc-bd01-14a49317f449/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_33ee057c-e8ec-4fdc-bd01-14a49317f449/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_33ee057c-e8ec-4fdc-bd01-14a49317f449/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_5.c -s /tmp/vcloud-vcloud-master/worker/working_dir_33ee057c-e8ec-4fdc-bd01-14a49317f449/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_33ee057c-e8ec-4fdc-bd01-14a49317f449/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 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:24:02,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:02,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:02,352 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:02,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:02,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:02,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:02,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:02,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:02,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:02,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:02,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:02,364 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:02,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:02,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:02,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:02,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:02,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:02,369 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:02,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:02,372 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:02,373 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:02,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:02,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:02,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:02,379 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:02,379 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:02,380 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:02,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:02,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:02,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:02,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:02,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:02,384 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:02,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:02,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:02,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:02,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:02,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:02,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:02,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:02,388 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_33ee057c-e8ec-4fdc-bd01-14a49317f449/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:24:02,403 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:02,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:02,410 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:02,410 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:02,410 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:02,411 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:02,411 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:24:02,411 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:02,411 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:02,411 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:24:02,411 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:24:02,411 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:02,412 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:02,412 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:24:02,412 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:24:02,412 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:24:02,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:02,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:24:02,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:02,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:24:02,413 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:24:02,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:24:02,413 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:24:02,415 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:02,415 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:02,415 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:02,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:02,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:02,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:02,416 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:02,416 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:24:02,416 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:24:02,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:24:02,416 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:24:02,416 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:02,416 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_33ee057c-e8ec-4fdc-bd01-14a49317f449/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 -> 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb [2019-10-22 11:24:02,450 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:02,462 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:02,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:02,469 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:02,469 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:02,469 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_33ee057c-e8ec-4fdc-bd01-14a49317f449/bin/utaipan/../../sv-benchmarks/c/locks/test_locks_5.c [2019-10-22 11:24:02,515 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_33ee057c-e8ec-4fdc-bd01-14a49317f449/bin/utaipan/data/c2c74c2b8/d939cd74d64e41e7864a624a3f196639/FLAG45a03c765 [2019-10-22 11:24:02,881 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:02,882 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_33ee057c-e8ec-4fdc-bd01-14a49317f449/sv-benchmarks/c/locks/test_locks_5.c [2019-10-22 11:24:02,888 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_33ee057c-e8ec-4fdc-bd01-14a49317f449/bin/utaipan/data/c2c74c2b8/d939cd74d64e41e7864a624a3f196639/FLAG45a03c765 [2019-10-22 11:24:03,293 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_33ee057c-e8ec-4fdc-bd01-14a49317f449/bin/utaipan/data/c2c74c2b8/d939cd74d64e41e7864a624a3f196639 [2019-10-22 11:24:03,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:03,297 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:03,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:03,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:03,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:03,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:03" (1/1) ... [2019-10-22 11:24:03,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@314722d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:03, skipping insertion in model container [2019-10-22 11:24:03,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:03" (1/1) ... [2019-10-22 11:24:03,317 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:03,337 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:03,498 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:03,501 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:03,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:03,587 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:03,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:03 WrapperNode [2019-10-22 11:24:03,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:03,588 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:03,588 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:03,588 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:03,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:03" (1/1) ... [2019-10-22 11:24:03,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:03" (1/1) ... [2019-10-22 11:24:03,618 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:03,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:03,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:03,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:03,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:03" (1/1) ... [2019-10-22 11:24:03,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:03" (1/1) ... [2019-10-22 11:24:03,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:03" (1/1) ... [2019-10-22 11:24:03,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:03" (1/1) ... [2019-10-22 11:24:03,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:03" (1/1) ... [2019-10-22 11:24:03,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:03" (1/1) ... [2019-10-22 11:24:03,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:03" (1/1) ... [2019-10-22 11:24:03,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:03,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:03,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:03,654 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:03,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33ee057c-e8ec-4fdc-bd01-14a49317f449/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:03,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:24:03,943 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:24:03,943 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 11:24:03,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:03 BoogieIcfgContainer [2019-10-22 11:24:03,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:24:03,946 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:24:03,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:24:03,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:24:03,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:03" (1/3) ... [2019-10-22 11:24:03,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71aeb115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:03, skipping insertion in model container [2019-10-22 11:24:03,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:03" (2/3) ... [2019-10-22 11:24:03,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71aeb115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:03, skipping insertion in model container [2019-10-22 11:24:03,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:03" (3/3) ... [2019-10-22 11:24:03,954 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2019-10-22 11:24:03,971 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:24:03,979 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:24:03,991 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:24:04,016 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:24:04,017 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:24:04,017 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:24:04,017 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:24:04,022 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:24:04,022 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:24:04,022 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:24:04,022 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:24:04,038 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-10-22 11:24:04,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:24:04,044 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:04,045 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:04,047 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:04,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:04,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1401695884, now seen corresponding path program 1 times [2019-10-22 11:24:04,064 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:04,064 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522055021] [2019-10-22 11:24:04,064 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,065 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:04,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:04,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522055021] [2019-10-22 11:24:04,236 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:04,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:04,237 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698288360] [2019-10-22 11:24:04,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:04,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:04,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:04,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:04,259 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-10-22 11:24:04,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:04,297 INFO L93 Difference]: Finished difference Result 52 states and 84 transitions. [2019-10-22 11:24:04,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:04,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-22 11:24:04,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:04,315 INFO L225 Difference]: With dead ends: 52 [2019-10-22 11:24:04,315 INFO L226 Difference]: Without dead ends: 38 [2019-10-22 11:24:04,318 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:04,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-22 11:24:04,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2019-10-22 11:24:04,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-22 11:24:04,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. [2019-10-22 11:24:04,364 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 45 transitions. Word has length 11 [2019-10-22 11:24:04,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:04,365 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 45 transitions. [2019-10-22 11:24:04,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:04,365 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2019-10-22 11:24:04,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:24:04,366 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:04,366 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:04,366 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:04,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:04,366 INFO L82 PathProgramCache]: Analyzing trace with hash 592349258, now seen corresponding path program 1 times [2019-10-22 11:24:04,367 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:04,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709326237] [2019-10-22 11:24:04,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:04,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:04,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709326237] [2019-10-22 11:24:04,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:04,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:04,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384285640] [2019-10-22 11:24:04,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:04,422 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:04,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:04,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:04,423 INFO L87 Difference]: Start difference. First operand 26 states and 45 transitions. Second operand 3 states. [2019-10-22 11:24:04,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:04,454 INFO L93 Difference]: Finished difference Result 63 states and 108 transitions. [2019-10-22 11:24:04,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:04,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-22 11:24:04,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:04,455 INFO L225 Difference]: With dead ends: 63 [2019-10-22 11:24:04,456 INFO L226 Difference]: Without dead ends: 38 [2019-10-22 11:24:04,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:04,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-22 11:24:04,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-10-22 11:24:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 11:24:04,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 61 transitions. [2019-10-22 11:24:04,462 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 61 transitions. Word has length 11 [2019-10-22 11:24:04,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:04,462 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 61 transitions. [2019-10-22 11:24:04,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:04,463 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 61 transitions. [2019-10-22 11:24:04,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:24:04,463 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:04,463 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:04,463 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:04,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:04,464 INFO L82 PathProgramCache]: Analyzing trace with hash 503114411, now seen corresponding path program 1 times [2019-10-22 11:24:04,464 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:04,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286882416] [2019-10-22 11:24:04,464 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,464 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:04,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286882416] [2019-10-22 11:24:04,503 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:04,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:04,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172825992] [2019-10-22 11:24:04,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:04,505 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:04,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:04,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:04,505 INFO L87 Difference]: Start difference. First operand 36 states and 61 transitions. Second operand 3 states. [2019-10-22 11:24:04,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:04,541 INFO L93 Difference]: Finished difference Result 59 states and 95 transitions. [2019-10-22 11:24:04,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:04,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-22 11:24:04,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:04,544 INFO L225 Difference]: With dead ends: 59 [2019-10-22 11:24:04,544 INFO L226 Difference]: Without dead ends: 41 [2019-10-22 11:24:04,544 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:04,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-22 11:24:04,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-10-22 11:24:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 11:24:04,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 63 transitions. [2019-10-22 11:24:04,554 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 63 transitions. Word has length 12 [2019-10-22 11:24:04,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:04,554 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 63 transitions. [2019-10-22 11:24:04,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:04,555 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 63 transitions. [2019-10-22 11:24:04,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:24:04,555 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:04,558 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:04,558 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:04,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:04,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1183172781, now seen corresponding path program 1 times [2019-10-22 11:24:04,559 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:04,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872923967] [2019-10-22 11:24:04,559 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,559 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:04,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:04,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872923967] [2019-10-22 11:24:04,610 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:04,610 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:04,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450259856] [2019-10-22 11:24:04,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:04,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:04,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:04,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:04,611 INFO L87 Difference]: Start difference. First operand 39 states and 63 transitions. Second operand 3 states. [2019-10-22 11:24:04,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:04,631 INFO L93 Difference]: Finished difference Result 72 states and 116 transitions. [2019-10-22 11:24:04,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:04,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-22 11:24:04,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:04,632 INFO L225 Difference]: With dead ends: 72 [2019-10-22 11:24:04,633 INFO L226 Difference]: Without dead ends: 70 [2019-10-22 11:24:04,633 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:04,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-22 11:24:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-10-22 11:24:04,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-22 11:24:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 84 transitions. [2019-10-22 11:24:04,640 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 84 transitions. Word has length 12 [2019-10-22 11:24:04,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:04,640 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 84 transitions. [2019-10-22 11:24:04,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:04,640 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 84 transitions. [2019-10-22 11:24:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:24:04,641 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:04,641 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:04,641 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:04,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:04,641 INFO L82 PathProgramCache]: Analyzing trace with hash 373826155, now seen corresponding path program 1 times [2019-10-22 11:24:04,642 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:04,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327627898] [2019-10-22 11:24:04,642 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,642 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:04,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:04,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327627898] [2019-10-22 11:24:04,664 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:04,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:04,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073700691] [2019-10-22 11:24:04,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:04,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:04,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:04,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:04,666 INFO L87 Difference]: Start difference. First operand 52 states and 84 transitions. Second operand 3 states. [2019-10-22 11:24:04,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:04,681 INFO L93 Difference]: Finished difference Result 120 states and 194 transitions. [2019-10-22 11:24:04,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:04,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-22 11:24:04,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:04,683 INFO L225 Difference]: With dead ends: 120 [2019-10-22 11:24:04,683 INFO L226 Difference]: Without dead ends: 72 [2019-10-22 11:24:04,684 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:04,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-22 11:24:04,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-10-22 11:24:04,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-22 11:24:04,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 110 transitions. [2019-10-22 11:24:04,694 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 110 transitions. Word has length 12 [2019-10-22 11:24:04,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:04,695 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 110 transitions. [2019-10-22 11:24:04,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:04,695 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 110 transitions. [2019-10-22 11:24:04,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:24:04,695 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:04,695 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:04,696 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:04,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:04,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1976134145, now seen corresponding path program 1 times [2019-10-22 11:24:04,697 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:04,697 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288462502] [2019-10-22 11:24:04,697 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,697 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:04,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:04,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288462502] [2019-10-22 11:24:04,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:04,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:04,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89539405] [2019-10-22 11:24:04,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:04,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:04,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:04,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:04,719 INFO L87 Difference]: Start difference. First operand 70 states and 110 transitions. Second operand 3 states. [2019-10-22 11:24:04,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:04,738 INFO L93 Difference]: Finished difference Result 107 states and 165 transitions. [2019-10-22 11:24:04,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:04,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-22 11:24:04,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:04,741 INFO L225 Difference]: With dead ends: 107 [2019-10-22 11:24:04,741 INFO L226 Difference]: Without dead ends: 74 [2019-10-22 11:24:04,742 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:04,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-22 11:24:04,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-10-22 11:24:04,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-22 11:24:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 110 transitions. [2019-10-22 11:24:04,749 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 110 transitions. Word has length 13 [2019-10-22 11:24:04,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:04,749 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 110 transitions. [2019-10-22 11:24:04,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 110 transitions. [2019-10-22 11:24:04,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:24:04,750 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:04,750 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:04,750 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:04,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:04,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1296075775, now seen corresponding path program 1 times [2019-10-22 11:24:04,751 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:04,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432424611] [2019-10-22 11:24:04,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:04,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:04,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432424611] [2019-10-22 11:24:04,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:04,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:04,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087804147] [2019-10-22 11:24:04,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:04,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:04,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:04,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:04,773 INFO L87 Difference]: Start difference. First operand 72 states and 110 transitions. Second operand 3 states. [2019-10-22 11:24:04,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:04,788 INFO L93 Difference]: Finished difference Result 200 states and 304 transitions. [2019-10-22 11:24:04,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:04,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-22 11:24:04,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:04,790 INFO L225 Difference]: With dead ends: 200 [2019-10-22 11:24:04,790 INFO L226 Difference]: Without dead ends: 134 [2019-10-22 11:24:04,791 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:04,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-22 11:24:04,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2019-10-22 11:24:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-22 11:24:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 194 transitions. [2019-10-22 11:24:04,801 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 194 transitions. Word has length 13 [2019-10-22 11:24:04,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:04,801 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 194 transitions. [2019-10-22 11:24:04,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 194 transitions. [2019-10-22 11:24:04,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:24:04,802 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:04,802 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:04,802 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:04,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:04,802 INFO L82 PathProgramCache]: Analyzing trace with hash -486729149, now seen corresponding path program 1 times [2019-10-22 11:24:04,803 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:04,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363173983] [2019-10-22 11:24:04,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:04,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:04,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363173983] [2019-10-22 11:24:04,849 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:04,849 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:04,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87709429] [2019-10-22 11:24:04,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:04,850 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:04,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:04,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:04,850 INFO L87 Difference]: Start difference. First operand 132 states and 194 transitions. Second operand 3 states. [2019-10-22 11:24:04,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:04,871 INFO L93 Difference]: Finished difference Result 160 states and 236 transitions. [2019-10-22 11:24:04,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:04,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-22 11:24:04,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:04,874 INFO L225 Difference]: With dead ends: 160 [2019-10-22 11:24:04,874 INFO L226 Difference]: Without dead ends: 158 [2019-10-22 11:24:04,875 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:04,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-22 11:24:04,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 132. [2019-10-22 11:24:04,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-22 11:24:04,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 190 transitions. [2019-10-22 11:24:04,886 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 190 transitions. Word has length 13 [2019-10-22 11:24:04,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:04,886 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 190 transitions. [2019-10-22 11:24:04,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:04,887 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 190 transitions. [2019-10-22 11:24:04,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:24:04,887 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:04,888 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:04,888 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:04,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:04,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1523427712, now seen corresponding path program 1 times [2019-10-22 11:24:04,888 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:04,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202800028] [2019-10-22 11:24:04,889 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,889 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:04,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:04,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202800028] [2019-10-22 11:24:04,908 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:04,908 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:04,908 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591263816] [2019-10-22 11:24:04,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:04,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:04,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:04,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:04,910 INFO L87 Difference]: Start difference. First operand 132 states and 190 transitions. Second operand 3 states. [2019-10-22 11:24:04,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:04,925 INFO L93 Difference]: Finished difference Result 228 states and 328 transitions. [2019-10-22 11:24:04,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:04,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-22 11:24:04,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:04,927 INFO L225 Difference]: With dead ends: 228 [2019-10-22 11:24:04,927 INFO L226 Difference]: Without dead ends: 226 [2019-10-22 11:24:04,928 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:04,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-22 11:24:04,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 192. [2019-10-22 11:24:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-22 11:24:04,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 270 transitions. [2019-10-22 11:24:04,940 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 270 transitions. Word has length 14 [2019-10-22 11:24:04,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:04,940 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 270 transitions. [2019-10-22 11:24:04,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:04,941 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 270 transitions. [2019-10-22 11:24:04,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:24:04,942 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:04,942 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:04,942 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:04,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:04,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1962192958, now seen corresponding path program 1 times [2019-10-22 11:24:04,943 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:04,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050076163] [2019-10-22 11:24:04,943 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,943 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:04,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:04,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050076163] [2019-10-22 11:24:04,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:04,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:04,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537438602] [2019-10-22 11:24:04,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:04,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:04,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:04,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:04,962 INFO L87 Difference]: Start difference. First operand 192 states and 270 transitions. Second operand 3 states. [2019-10-22 11:24:04,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:04,980 INFO L93 Difference]: Finished difference Result 436 states and 608 transitions. [2019-10-22 11:24:04,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:04,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-22 11:24:04,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:04,982 INFO L225 Difference]: With dead ends: 436 [2019-10-22 11:24:04,982 INFO L226 Difference]: Without dead ends: 250 [2019-10-22 11:24:04,983 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:04,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-22 11:24:04,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-10-22 11:24:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-22 11:24:04,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 330 transitions. [2019-10-22 11:24:04,997 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 330 transitions. Word has length 14 [2019-10-22 11:24:04,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:04,997 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 330 transitions. [2019-10-22 11:24:04,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:04,997 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 330 transitions. [2019-10-22 11:24:04,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:24:04,998 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:04,999 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:04,999 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:04,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:04,999 INFO L82 PathProgramCache]: Analyzing trace with hash 18597174, now seen corresponding path program 1 times [2019-10-22 11:24:04,999 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:04,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395111620] [2019-10-22 11:24:04,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:05,000 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:05,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:05,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:05,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395111620] [2019-10-22 11:24:05,037 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:05,037 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:05,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709144377] [2019-10-22 11:24:05,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:05,038 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:05,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:05,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:05,038 INFO L87 Difference]: Start difference. First operand 248 states and 330 transitions. Second operand 3 states. [2019-10-22 11:24:05,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:05,064 INFO L93 Difference]: Finished difference Result 380 states and 504 transitions. [2019-10-22 11:24:05,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:05,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-22 11:24:05,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:05,065 INFO L225 Difference]: With dead ends: 380 [2019-10-22 11:24:05,066 INFO L226 Difference]: Without dead ends: 262 [2019-10-22 11:24:05,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:05,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-22 11:24:05,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-10-22 11:24:05,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-22 11:24:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 338 transitions. [2019-10-22 11:24:05,077 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 338 transitions. Word has length 15 [2019-10-22 11:24:05,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:05,077 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 338 transitions. [2019-10-22 11:24:05,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:05,077 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 338 transitions. [2019-10-22 11:24:05,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:24:05,078 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:05,078 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:05,079 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:05,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:05,079 INFO L82 PathProgramCache]: Analyzing trace with hash 698655544, now seen corresponding path program 1 times [2019-10-22 11:24:05,079 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:05,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249291156] [2019-10-22 11:24:05,079 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:05,079 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:05,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:05,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:05,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249291156] [2019-10-22 11:24:05,096 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:05,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:05,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243271247] [2019-10-22 11:24:05,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:05,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:05,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:05,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:05,097 INFO L87 Difference]: Start difference. First operand 260 states and 338 transitions. Second operand 3 states. [2019-10-22 11:24:05,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:05,116 INFO L93 Difference]: Finished difference Result 422 states and 539 transitions. [2019-10-22 11:24:05,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:05,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-22 11:24:05,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:05,120 INFO L225 Difference]: With dead ends: 422 [2019-10-22 11:24:05,120 INFO L226 Difference]: Without dead ends: 420 [2019-10-22 11:24:05,120 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-10-22 11:24:05,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 388. [2019-10-22 11:24:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-22 11:24:05,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 490 transitions. [2019-10-22 11:24:05,137 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 490 transitions. Word has length 15 [2019-10-22 11:24:05,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:05,137 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 490 transitions. [2019-10-22 11:24:05,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:05,137 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 490 transitions. [2019-10-22 11:24:05,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:24:05,139 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:05,139 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:05,139 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:05,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:05,140 INFO L82 PathProgramCache]: Analyzing trace with hash -110691082, now seen corresponding path program 1 times [2019-10-22 11:24:05,140 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:05,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126446772] [2019-10-22 11:24:05,140 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:05,140 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:05,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:05,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:05,159 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126446772] [2019-10-22 11:24:05,160 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:05,160 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:05,160 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236917265] [2019-10-22 11:24:05,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:05,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:05,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:05,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:05,161 INFO L87 Difference]: Start difference. First operand 388 states and 490 transitions. Second operand 3 states. [2019-10-22 11:24:05,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:05,185 INFO L93 Difference]: Finished difference Result 852 states and 1050 transitions. [2019-10-22 11:24:05,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:05,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-22 11:24:05,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:05,187 INFO L225 Difference]: With dead ends: 852 [2019-10-22 11:24:05,187 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:24:05,188 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:05,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:24:05,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:24:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:24:05,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:24:05,189 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2019-10-22 11:24:05,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:05,189 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:24:05,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:05,189 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:24:05,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:24:05,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:24:05,208 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-22 11:24:05,208 INFO L446 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2019-10-22 11:24:05,208 INFO L443 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2019-10-22 11:24:05,208 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-10-22 11:24:05,208 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:24:05,208 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:24:05,209 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2019-10-22 11:24:05,209 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2019-10-22 11:24:05,209 INFO L443 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2019-10-22 11:24:05,209 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2019-10-22 11:24:05,209 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2019-10-22 11:24:05,209 INFO L443 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-10-22 11:24:05,209 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-10-22 11:24:05,209 INFO L443 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2019-10-22 11:24:05,209 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:24:05,209 INFO L446 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2019-10-22 11:24:05,210 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-22 11:24:05,210 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2019-10-22 11:24:05,210 INFO L446 ceAbstractionStarter]: At program point L92(lines 4 93) the Hoare annotation is: true [2019-10-22 11:24:05,210 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2019-10-22 11:24:05,210 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2019-10-22 11:24:05,211 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-10-22 11:24:05,211 INFO L439 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2019-10-22 11:24:05,211 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2019-10-22 11:24:05,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:24:05 BoogieIcfgContainer [2019-10-22 11:24:05,219 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:24:05,219 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:24:05,219 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:24:05,220 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:24:05,220 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:03" (3/4) ... [2019-10-22 11:24:05,227 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:24:05,240 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-10-22 11:24:05,241 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:24:05,307 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_33ee057c-e8ec-4fdc-bd01-14a49317f449/bin/utaipan/witness.graphml [2019-10-22 11:24:05,308 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:24:05,310 INFO L168 Benchmark]: Toolchain (without parser) took 2012.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 944.4 MB in the beginning and 971.4 MB in the end (delta: -27.0 MB). Peak memory consumption was 91.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:05,313 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:05,313 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -171.5 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:05,313 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:05,314 INFO L168 Benchmark]: Boogie Preprocessor took 34.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:05,314 INFO L168 Benchmark]: RCFGBuilder took 291.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:05,314 INFO L168 Benchmark]: TraceAbstraction took 1273.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 976.8 MB in the end (delta: 112.8 MB). Peak memory consumption was 112.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:05,315 INFO L168 Benchmark]: Witness Printer took 88.51 ms. Allocated memory is still 1.1 GB. Free memory was 976.8 MB in the beginning and 971.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:05,316 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 288.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -171.5 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 291.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1273.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 976.8 MB in the end (delta: 112.8 MB). Peak memory consumption was 112.8 MB. Max. memory is 11.5 GB. * Witness Printer took 88.51 ms. Allocated memory is still 1.1 GB. Free memory was 976.8 MB in the beginning and 971.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. Result: SAFE, OverallTime: 1.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 561 SDtfs, 264 SDslu, 345 SDs, 0 SdLazy, 69 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=388occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 41 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 3796 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...