./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a91618b5-4004-4b08-8c74-32264b2d6f50/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a91618b5-4004-4b08-8c74-32264b2d6f50/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a91618b5-4004-4b08-8c74-32264b2d6f50/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a91618b5-4004-4b08-8c74-32264b2d6f50/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_15-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a91618b5-4004-4b08-8c74-32264b2d6f50/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a91618b5-4004-4b08-8c74-32264b2d6f50/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 129b0578c0c64625cef50fbcfd5d128651ff3275 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:18:55,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:18:55,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:18:55,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:18:55,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:18:55,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:18:55,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:18:55,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:18:55,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:18:55,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:18:55,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:18:55,061 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:18:55,062 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:18:55,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:18:55,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:18:55,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:18:55,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:18:55,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:18:55,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:18:55,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:18:55,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:18:55,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:18:55,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:18:55,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:18:55,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:18:55,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:18:55,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:18:55,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:18:55,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:18:55,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:18:55,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:18:55,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:18:55,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:18:55,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:18:55,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:18:55,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:18:55,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:18:55,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:18:55,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:18:55,078 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:18:55,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:18:55,079 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a91618b5-4004-4b08-8c74-32264b2d6f50/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 16:18:55,089 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:18:55,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:18:55,089 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:18:55,089 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:18:55,090 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:18:55,090 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:18:55,090 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:18:55,090 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:18:55,090 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:18:55,090 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:18:55,090 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:18:55,090 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:18:55,090 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:18:55,091 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:18:55,091 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:18:55,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:18:55,091 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:18:55,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:18:55,091 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:18:55,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:18:55,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:18:55,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:18:55,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:18:55,092 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:18:55,092 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:18:55,092 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:18:55,092 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:18:55,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:18:55,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:18:55,093 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:18:55,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:18:55,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:18:55,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:18:55,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:18:55,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:18:55,094 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:18:55,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:18:55,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:18:55,094 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:18:55,094 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:18:55,094 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_a91618b5-4004-4b08-8c74-32264b2d6f50/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 -> 129b0578c0c64625cef50fbcfd5d128651ff3275 [2019-12-07 16:18:55,197 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:18:55,205 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:18:55,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:18:55,208 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:18:55,208 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:18:55,209 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a91618b5-4004-4b08-8c74-32264b2d6f50/bin/utaipan/../../sv-benchmarks/c/locks/test_locks_15-2.c [2019-12-07 16:18:55,245 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a91618b5-4004-4b08-8c74-32264b2d6f50/bin/utaipan/data/68a95a07f/cfc20994458043c4b50eb78a7070694f/FLAG3b2391684 [2019-12-07 16:18:55,722 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:18:55,723 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a91618b5-4004-4b08-8c74-32264b2d6f50/sv-benchmarks/c/locks/test_locks_15-2.c [2019-12-07 16:18:55,728 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a91618b5-4004-4b08-8c74-32264b2d6f50/bin/utaipan/data/68a95a07f/cfc20994458043c4b50eb78a7070694f/FLAG3b2391684 [2019-12-07 16:18:55,737 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a91618b5-4004-4b08-8c74-32264b2d6f50/bin/utaipan/data/68a95a07f/cfc20994458043c4b50eb78a7070694f [2019-12-07 16:18:55,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:18:55,740 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:18:55,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:18:55,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:18:55,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:18:55,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:18:55" (1/1) ... [2019-12-07 16:18:55,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f99c601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:18:55, skipping insertion in model container [2019-12-07 16:18:55,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:18:55" (1/1) ... [2019-12-07 16:18:55,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:18:55,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:18:55,911 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:18:55,914 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:18:55,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:18:55,943 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:18:55,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:18:55 WrapperNode [2019-12-07 16:18:55,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:18:55,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:18:55,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:18:55,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:18:55,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:18:55" (1/1) ... [2019-12-07 16:18:55,954 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:18:55" (1/1) ... [2019-12-07 16:18:55,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:18:55,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:18:55,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:18:55,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:18:55,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:18:55" (1/1) ... [2019-12-07 16:18:55,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:18:55" (1/1) ... [2019-12-07 16:18:55,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:18:55" (1/1) ... [2019-12-07 16:18:55,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:18:55" (1/1) ... [2019-12-07 16:18:55,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:18:55" (1/1) ... [2019-12-07 16:18:55,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:18:55" (1/1) ... [2019-12-07 16:18:55,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:18:55" (1/1) ... [2019-12-07 16:18:55,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:18:55,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:18:55,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:18:55,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:18:55,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:18:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a91618b5-4004-4b08-8c74-32264b2d6f50/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:18:56,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:18:56,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:18:56,386 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:18:56,386 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-07 16:18:56,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:18:56 BoogieIcfgContainer [2019-12-07 16:18:56,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:18:56,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:18:56,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:18:56,391 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:18:56,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:18:55" (1/3) ... [2019-12-07 16:18:56,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e174701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:18:56, skipping insertion in model container [2019-12-07 16:18:56,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:18:55" (2/3) ... [2019-12-07 16:18:56,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e174701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:18:56, skipping insertion in model container [2019-12-07 16:18:56,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:18:56" (3/3) ... [2019-12-07 16:18:56,393 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2019-12-07 16:18:56,402 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:18:56,408 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:18:56,416 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:18:56,432 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:18:56,432 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:18:56,432 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:18:56,432 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:18:56,432 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:18:56,432 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:18:56,432 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:18:56,432 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:18:56,442 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-12-07 16:18:56,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 16:18:56,446 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:18:56,446 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 16:18:56,446 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:18:56,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:18:56,450 INFO L82 PathProgramCache]: Analyzing trace with hash 934770339, now seen corresponding path program 1 times [2019-12-07 16:18:56,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:18:56,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405132920] [2019-12-07 16:18:56,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:18:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:18:56,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:18:56,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405132920] [2019-12-07 16:18:56,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:18:56,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:18:56,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106852001] [2019-12-07 16:18:56,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:18:56,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:18:56,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:18:56,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:56,603 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 4 states. [2019-12-07 16:18:56,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:18:56,644 INFO L93 Difference]: Finished difference Result 78 states and 137 transitions. [2019-12-07 16:18:56,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:18:56,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 16:18:56,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:18:56,653 INFO L225 Difference]: With dead ends: 78 [2019-12-07 16:18:56,653 INFO L226 Difference]: Without dead ends: 67 [2019-12-07 16:18:56,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:56,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-07 16:18:56,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 35. [2019-12-07 16:18:56,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 16:18:56,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 63 transitions. [2019-12-07 16:18:56,681 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 63 transitions. Word has length 6 [2019-12-07 16:18:56,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:18:56,682 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 63 transitions. [2019-12-07 16:18:56,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:18:56,682 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 63 transitions. [2019-12-07 16:18:56,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 16:18:56,682 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:18:56,682 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:18:56,683 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:18:56,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:18:56,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1086678836, now seen corresponding path program 1 times [2019-12-07 16:18:56,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:18:56,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215924981] [2019-12-07 16:18:56,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:18:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:18:56,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:18:56,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215924981] [2019-12-07 16:18:56,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:18:56,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:18:56,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696522327] [2019-12-07 16:18:56,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:18:56,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:18:56,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:18:56,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:56,727 INFO L87 Difference]: Start difference. First operand 35 states and 63 transitions. Second operand 4 states. [2019-12-07 16:18:56,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:18:56,747 INFO L93 Difference]: Finished difference Result 67 states and 119 transitions. [2019-12-07 16:18:56,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:18:56,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 16:18:56,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:18:56,749 INFO L225 Difference]: With dead ends: 67 [2019-12-07 16:18:56,749 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 16:18:56,749 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:56,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 16:18:56,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 35. [2019-12-07 16:18:56,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 16:18:56,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 62 transitions. [2019-12-07 16:18:56,755 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 62 transitions. Word has length 7 [2019-12-07 16:18:56,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:18:56,756 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 62 transitions. [2019-12-07 16:18:56,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:18:56,756 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 62 transitions. [2019-12-07 16:18:56,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 16:18:56,756 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:18:56,756 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:18:56,756 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:18:56,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:18:56,757 INFO L82 PathProgramCache]: Analyzing trace with hash 672906520, now seen corresponding path program 1 times [2019-12-07 16:18:56,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:18:56,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737625749] [2019-12-07 16:18:56,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:18:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:18:56,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:18:56,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737625749] [2019-12-07 16:18:56,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:18:56,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:18:56,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470303543] [2019-12-07 16:18:56,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:18:56,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:18:56,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:18:56,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:56,797 INFO L87 Difference]: Start difference. First operand 35 states and 62 transitions. Second operand 4 states. [2019-12-07 16:18:56,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:18:56,814 INFO L93 Difference]: Finished difference Result 65 states and 114 transitions. [2019-12-07 16:18:56,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:18:56,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 16:18:56,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:18:56,816 INFO L225 Difference]: With dead ends: 65 [2019-12-07 16:18:56,816 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 16:18:56,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:56,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 16:18:56,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 35. [2019-12-07 16:18:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 16:18:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 61 transitions. [2019-12-07 16:18:56,821 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 61 transitions. Word has length 8 [2019-12-07 16:18:56,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:18:56,822 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 61 transitions. [2019-12-07 16:18:56,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:18:56,822 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 61 transitions. [2019-12-07 16:18:56,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 16:18:56,822 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:18:56,822 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:18:56,823 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:18:56,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:18:56,823 INFO L82 PathProgramCache]: Analyzing trace with hash -614521951, now seen corresponding path program 1 times [2019-12-07 16:18:56,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:18:56,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597964703] [2019-12-07 16:18:56,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:18:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:18:56,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:18:56,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597964703] [2019-12-07 16:18:56,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:18:56,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:18:56,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135320526] [2019-12-07 16:18:56,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:18:56,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:18:56,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:18:56,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:56,854 INFO L87 Difference]: Start difference. First operand 35 states and 61 transitions. Second operand 4 states. [2019-12-07 16:18:56,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:18:56,867 INFO L93 Difference]: Finished difference Result 63 states and 109 transitions. [2019-12-07 16:18:56,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:18:56,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 16:18:56,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:18:56,868 INFO L225 Difference]: With dead ends: 63 [2019-12-07 16:18:56,869 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 16:18:56,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:56,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 16:18:56,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 35. [2019-12-07 16:18:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 16:18:56,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 60 transitions. [2019-12-07 16:18:56,872 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 60 transitions. Word has length 9 [2019-12-07 16:18:56,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:18:56,872 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 60 transitions. [2019-12-07 16:18:56,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:18:56,872 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 60 transitions. [2019-12-07 16:18:56,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 16:18:56,873 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:18:56,873 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:18:56,873 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:18:56,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:18:56,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1870098547, now seen corresponding path program 1 times [2019-12-07 16:18:56,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:18:56,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797655081] [2019-12-07 16:18:56,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:18:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:18:56,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:18:56,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797655081] [2019-12-07 16:18:56,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:18:56,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:18:56,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903888680] [2019-12-07 16:18:56,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:18:56,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:18:56,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:18:56,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:56,899 INFO L87 Difference]: Start difference. First operand 35 states and 60 transitions. Second operand 4 states. [2019-12-07 16:18:56,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:18:56,915 INFO L93 Difference]: Finished difference Result 61 states and 104 transitions. [2019-12-07 16:18:56,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:18:56,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 16:18:56,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:18:56,916 INFO L225 Difference]: With dead ends: 61 [2019-12-07 16:18:56,916 INFO L226 Difference]: Without dead ends: 59 [2019-12-07 16:18:56,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:56,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-07 16:18:56,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 35. [2019-12-07 16:18:56,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 16:18:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 59 transitions. [2019-12-07 16:18:56,921 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 59 transitions. Word has length 10 [2019-12-07 16:18:56,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:18:56,921 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 59 transitions. [2019-12-07 16:18:56,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:18:56,921 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 59 transitions. [2019-12-07 16:18:56,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 16:18:56,922 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:18:56,922 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:18:56,922 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:18:56,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:18:56,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2138267018, now seen corresponding path program 1 times [2019-12-07 16:18:56,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:18:56,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406715407] [2019-12-07 16:18:56,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:18:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:18:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:18:56,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406715407] [2019-12-07 16:18:56,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:18:56,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:18:56,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166176068] [2019-12-07 16:18:56,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:18:56,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:18:56,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:18:56,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:56,951 INFO L87 Difference]: Start difference. First operand 35 states and 59 transitions. Second operand 4 states. [2019-12-07 16:18:56,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:18:56,964 INFO L93 Difference]: Finished difference Result 59 states and 99 transitions. [2019-12-07 16:18:56,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:18:56,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 16:18:56,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:18:56,966 INFO L225 Difference]: With dead ends: 59 [2019-12-07 16:18:56,966 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 16:18:56,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:56,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 16:18:56,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 35. [2019-12-07 16:18:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 16:18:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2019-12-07 16:18:56,969 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 11 [2019-12-07 16:18:56,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:18:56,970 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2019-12-07 16:18:56,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:18:56,970 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2019-12-07 16:18:56,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 16:18:56,971 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:18:56,971 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:18:56,971 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:18:56,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:18:56,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1861554686, now seen corresponding path program 1 times [2019-12-07 16:18:56,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:18:56,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637391984] [2019-12-07 16:18:56,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:18:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:18:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:18:57,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637391984] [2019-12-07 16:18:57,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:18:57,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:18:57,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643413551] [2019-12-07 16:18:57,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:18:57,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:18:57,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:18:57,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:57,003 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand 4 states. [2019-12-07 16:18:57,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:18:57,017 INFO L93 Difference]: Finished difference Result 57 states and 94 transitions. [2019-12-07 16:18:57,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:18:57,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 16:18:57,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:18:57,018 INFO L225 Difference]: With dead ends: 57 [2019-12-07 16:18:57,019 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 16:18:57,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:57,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 16:18:57,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2019-12-07 16:18:57,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 16:18:57,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 57 transitions. [2019-12-07 16:18:57,023 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 57 transitions. Word has length 12 [2019-12-07 16:18:57,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:18:57,023 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 57 transitions. [2019-12-07 16:18:57,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:18:57,023 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 57 transitions. [2019-12-07 16:18:57,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 16:18:57,024 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:18:57,024 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:18:57,024 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:18:57,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:18:57,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1873406645, now seen corresponding path program 1 times [2019-12-07 16:18:57,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:18:57,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461380781] [2019-12-07 16:18:57,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:18:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:18:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:18:57,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461380781] [2019-12-07 16:18:57,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:18:57,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:18:57,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553141792] [2019-12-07 16:18:57,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:18:57,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:18:57,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:18:57,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:57,055 INFO L87 Difference]: Start difference. First operand 35 states and 57 transitions. Second operand 4 states. [2019-12-07 16:18:57,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:18:57,068 INFO L93 Difference]: Finished difference Result 55 states and 89 transitions. [2019-12-07 16:18:57,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:18:57,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 16:18:57,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:18:57,069 INFO L225 Difference]: With dead ends: 55 [2019-12-07 16:18:57,069 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 16:18:57,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 16:18:57,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2019-12-07 16:18:57,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 16:18:57,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2019-12-07 16:18:57,072 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 56 transitions. Word has length 13 [2019-12-07 16:18:57,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:18:57,073 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 56 transitions. [2019-12-07 16:18:57,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:18:57,073 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 56 transitions. [2019-12-07 16:18:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 16:18:57,073 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:18:57,074 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:18:57,074 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:18:57,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:18:57,074 INFO L82 PathProgramCache]: Analyzing trace with hash 2054150263, now seen corresponding path program 1 times [2019-12-07 16:18:57,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:18:57,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643919064] [2019-12-07 16:18:57,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:18:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:18:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:18:57,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643919064] [2019-12-07 16:18:57,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:18:57,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:18:57,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072364630] [2019-12-07 16:18:57,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:18:57,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:18:57,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:18:57,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:57,101 INFO L87 Difference]: Start difference. First operand 35 states and 56 transitions. Second operand 4 states. [2019-12-07 16:18:57,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:18:57,116 INFO L93 Difference]: Finished difference Result 53 states and 84 transitions. [2019-12-07 16:18:57,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:18:57,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 16:18:57,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:18:57,117 INFO L225 Difference]: With dead ends: 53 [2019-12-07 16:18:57,117 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 16:18:57,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:57,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 16:18:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2019-12-07 16:18:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 16:18:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 55 transitions. [2019-12-07 16:18:57,119 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 55 transitions. Word has length 14 [2019-12-07 16:18:57,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:18:57,119 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 55 transitions. [2019-12-07 16:18:57,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:18:57,120 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 55 transitions. [2019-12-07 16:18:57,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:18:57,120 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:18:57,120 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:18:57,120 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:18:57,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:18:57,120 INFO L82 PathProgramCache]: Analyzing trace with hash -745636832, now seen corresponding path program 1 times [2019-12-07 16:18:57,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:18:57,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765360553] [2019-12-07 16:18:57,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:18:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:18:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:18:57,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765360553] [2019-12-07 16:18:57,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:18:57,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:18:57,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797013120] [2019-12-07 16:18:57,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:18:57,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:18:57,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:18:57,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:57,142 INFO L87 Difference]: Start difference. First operand 35 states and 55 transitions. Second operand 4 states. [2019-12-07 16:18:57,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:18:57,156 INFO L93 Difference]: Finished difference Result 51 states and 79 transitions. [2019-12-07 16:18:57,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:18:57,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 16:18:57,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:18:57,157 INFO L225 Difference]: With dead ends: 51 [2019-12-07 16:18:57,157 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 16:18:57,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:57,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 16:18:57,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2019-12-07 16:18:57,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 16:18:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 54 transitions. [2019-12-07 16:18:57,161 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 54 transitions. Word has length 15 [2019-12-07 16:18:57,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:18:57,161 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 54 transitions. [2019-12-07 16:18:57,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:18:57,161 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 54 transitions. [2019-12-07 16:18:57,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:18:57,162 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:18:57,162 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:18:57,162 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:18:57,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:18:57,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1639690516, now seen corresponding path program 1 times [2019-12-07 16:18:57,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:18:57,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834524732] [2019-12-07 16:18:57,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:18:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:18:57,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:18:57,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834524732] [2019-12-07 16:18:57,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:18:57,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:18:57,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094375390] [2019-12-07 16:18:57,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:18:57,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:18:57,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:18:57,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:57,191 INFO L87 Difference]: Start difference. First operand 35 states and 54 transitions. Second operand 4 states. [2019-12-07 16:18:57,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:18:57,205 INFO L93 Difference]: Finished difference Result 49 states and 74 transitions. [2019-12-07 16:18:57,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:18:57,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 16:18:57,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:18:57,206 INFO L225 Difference]: With dead ends: 49 [2019-12-07 16:18:57,207 INFO L226 Difference]: Without dead ends: 47 [2019-12-07 16:18:57,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:57,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-07 16:18:57,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2019-12-07 16:18:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 16:18:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2019-12-07 16:18:57,209 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 53 transitions. Word has length 16 [2019-12-07 16:18:57,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:18:57,209 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 53 transitions. [2019-12-07 16:18:57,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:18:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 53 transitions. [2019-12-07 16:18:57,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 16:18:57,210 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:18:57,210 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:18:57,210 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:18:57,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:18:57,210 INFO L82 PathProgramCache]: Analyzing trace with hash 709416693, now seen corresponding path program 1 times [2019-12-07 16:18:57,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:18:57,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284176208] [2019-12-07 16:18:57,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:18:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:18:57,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:18:57,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284176208] [2019-12-07 16:18:57,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:18:57,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:18:57,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406097087] [2019-12-07 16:18:57,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:18:57,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:18:57,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:18:57,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:57,234 INFO L87 Difference]: Start difference. First operand 35 states and 53 transitions. Second operand 4 states. [2019-12-07 16:18:57,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:18:57,248 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2019-12-07 16:18:57,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:18:57,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 16:18:57,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:18:57,249 INFO L225 Difference]: With dead ends: 47 [2019-12-07 16:18:57,249 INFO L226 Difference]: Without dead ends: 45 [2019-12-07 16:18:57,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:57,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-07 16:18:57,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2019-12-07 16:18:57,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 16:18:57,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2019-12-07 16:18:57,252 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 17 [2019-12-07 16:18:57,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:18:57,253 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-12-07 16:18:57,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:18:57,253 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2019-12-07 16:18:57,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:18:57,254 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:18:57,254 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:18:57,254 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:18:57,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:18:57,254 INFO L82 PathProgramCache]: Analyzing trace with hash 517296481, now seen corresponding path program 1 times [2019-12-07 16:18:57,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:18:57,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536320352] [2019-12-07 16:18:57,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:18:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:18:57,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:18:57,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536320352] [2019-12-07 16:18:57,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:18:57,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:18:57,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411435095] [2019-12-07 16:18:57,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:18:57,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:18:57,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:18:57,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:57,282 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand 4 states. [2019-12-07 16:18:57,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:18:57,296 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2019-12-07 16:18:57,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:18:57,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 16:18:57,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:18:57,297 INFO L225 Difference]: With dead ends: 45 [2019-12-07 16:18:57,297 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 16:18:57,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:57,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 16:18:57,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2019-12-07 16:18:57,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 16:18:57,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 51 transitions. [2019-12-07 16:18:57,300 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 51 transitions. Word has length 18 [2019-12-07 16:18:57,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:18:57,301 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 51 transitions. [2019-12-07 16:18:57,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:18:57,301 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 51 transitions. [2019-12-07 16:18:57,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 16:18:57,301 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:18:57,302 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:18:57,302 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:18:57,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:18:57,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1143462454, now seen corresponding path program 1 times [2019-12-07 16:18:57,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:18:57,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739134628] [2019-12-07 16:18:57,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:18:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:18:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:18:57,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739134628] [2019-12-07 16:18:57,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:18:57,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:18:57,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807390913] [2019-12-07 16:18:57,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:18:57,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:18:57,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:18:57,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:57,325 INFO L87 Difference]: Start difference. First operand 35 states and 51 transitions. Second operand 4 states. [2019-12-07 16:18:57,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:18:57,337 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2019-12-07 16:18:57,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:18:57,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 16:18:57,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:18:57,338 INFO L225 Difference]: With dead ends: 43 [2019-12-07 16:18:57,338 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 16:18:57,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:57,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 16:18:57,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2019-12-07 16:18:57,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 16:18:57,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2019-12-07 16:18:57,341 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 19 [2019-12-07 16:18:57,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:18:57,341 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2019-12-07 16:18:57,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:18:57,341 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2019-12-07 16:18:57,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 16:18:57,342 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:18:57,342 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:18:57,342 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:18:57,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:18:57,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1087381546, now seen corresponding path program 1 times [2019-12-07 16:18:57,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:18:57,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465949412] [2019-12-07 16:18:57,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:18:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:18:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:18:57,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465949412] [2019-12-07 16:18:57,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:18:57,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:18:57,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217025277] [2019-12-07 16:18:57,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:18:57,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:18:57,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:18:57,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:57,371 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. Second operand 4 states. [2019-12-07 16:18:57,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:18:57,383 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2019-12-07 16:18:57,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:18:57,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 16:18:57,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:18:57,384 INFO L225 Difference]: With dead ends: 37 [2019-12-07 16:18:57,384 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 16:18:57,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:18:57,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 16:18:57,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 16:18:57,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 16:18:57,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 16:18:57,385 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-12-07 16:18:57,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:18:57,386 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 16:18:57,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:18:57,386 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 16:18:57,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 16:18:57,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 16:18:57,398 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 16:18:57,398 INFO L246 CegarLoopResult]: For program point L168-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 16:18:57,398 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 16:18:57,398 INFO L246 CegarLoopResult]: For program point L218-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 16:18:57,398 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 16:18:57,398 INFO L246 CegarLoopResult]: For program point L219(line 219) no Hoare annotation was computed. [2019-12-07 16:18:57,399 INFO L246 CegarLoopResult]: For program point L153-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 16:18:57,399 INFO L246 CegarLoopResult]: For program point L203-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 16:18:57,399 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 16:18:57,399 INFO L246 CegarLoopResult]: For program point L204(line 204) no Hoare annotation was computed. [2019-12-07 16:18:57,399 INFO L246 CegarLoopResult]: For program point L188-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 16:18:57,399 INFO L246 CegarLoopResult]: For program point L56(lines 56 58) no Hoare annotation was computed. [2019-12-07 16:18:57,399 INFO L246 CegarLoopResult]: For program point L189(line 189) no Hoare annotation was computed. [2019-12-07 16:18:57,400 INFO L246 CegarLoopResult]: For program point L173-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 16:18:57,400 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 16:18:57,400 INFO L249 CegarLoopResult]: At program point L223-1(lines 54 228) the Hoare annotation is: true [2019-12-07 16:18:57,400 INFO L246 CegarLoopResult]: For program point L174(line 174) no Hoare annotation was computed. [2019-12-07 16:18:57,400 INFO L246 CegarLoopResult]: For program point L224(line 224) no Hoare annotation was computed. [2019-12-07 16:18:57,400 INFO L242 CegarLoopResult]: At program point L224-1(lines 5 233) the Hoare annotation is: false [2019-12-07 16:18:57,400 INFO L246 CegarLoopResult]: For program point L158-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 16:18:57,401 INFO L246 CegarLoopResult]: For program point L208-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 16:18:57,401 INFO L246 CegarLoopResult]: For program point L159(line 159) no Hoare annotation was computed. [2019-12-07 16:18:57,401 INFO L246 CegarLoopResult]: For program point L209(line 209) no Hoare annotation was computed. [2019-12-07 16:18:57,401 INFO L246 CegarLoopResult]: For program point L193-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 16:18:57,401 INFO L246 CegarLoopResult]: For program point L194(line 194) no Hoare annotation was computed. [2019-12-07 16:18:57,401 INFO L246 CegarLoopResult]: For program point L178-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 16:18:57,401 INFO L246 CegarLoopResult]: For program point L179(line 179) no Hoare annotation was computed. [2019-12-07 16:18:57,401 INFO L249 CegarLoopResult]: At program point L229(lines 5 233) the Hoare annotation is: true [2019-12-07 16:18:57,401 INFO L246 CegarLoopResult]: For program point L163-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 16:18:57,402 INFO L246 CegarLoopResult]: For program point L213-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 16:18:57,402 INFO L246 CegarLoopResult]: For program point L147-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 16:18:57,402 INFO L246 CegarLoopResult]: For program point L164(line 164) no Hoare annotation was computed. [2019-12-07 16:18:57,402 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2019-12-07 16:18:57,402 INFO L246 CegarLoopResult]: For program point L214(line 214) no Hoare annotation was computed. [2019-12-07 16:18:57,402 INFO L246 CegarLoopResult]: For program point L198-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 16:18:57,402 INFO L249 CegarLoopResult]: At program point L232(lines 4 233) the Hoare annotation is: true [2019-12-07 16:18:57,402 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 16:18:57,403 INFO L246 CegarLoopResult]: For program point L183-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 16:18:57,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:18:57 BoogieIcfgContainer [2019-12-07 16:18:57,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:18:57,413 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:18:57,413 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:18:57,413 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:18:57,414 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:18:56" (3/4) ... [2019-12-07 16:18:57,417 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 16:18:57,428 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-12-07 16:18:57,429 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 16:18:57,430 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 16:18:57,488 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a91618b5-4004-4b08-8c74-32264b2d6f50/bin/utaipan/witness.graphml [2019-12-07 16:18:57,489 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:18:57,490 INFO L168 Benchmark]: Toolchain (without parser) took 1750.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 935.6 MB in the beginning and 848.5 MB in the end (delta: 87.1 MB). Peak memory consumption was 171.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:18:57,490 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 953.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:18:57,491 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 934.6 MB in the beginning and 1.1 GB in the end (delta: -146.8 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:18:57,491 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.59 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.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:18:57,491 INFO L168 Benchmark]: Boogie Preprocessor took 17.46 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.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:18:57,491 INFO L168 Benchmark]: RCFGBuilder took 398.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.5 MB). Peak memory consumption was 56.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:18:57,492 INFO L168 Benchmark]: TraceAbstraction took 1024.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 855.0 MB in the end (delta: 164.5 MB). Peak memory consumption was 164.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:18:57,492 INFO L168 Benchmark]: Witness Printer took 75.84 ms. Allocated memory is still 1.1 GB. Free memory was 855.0 MB in the beginning and 848.5 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:18:57,493 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 953.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 203.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 934.6 MB in the beginning and 1.1 GB in the end (delta: -146.8 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.59 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.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.46 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.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 398.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.5 MB). Peak memory consumption was 56.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1024.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 855.0 MB in the end (delta: 164.5 MB). Peak memory consumption was 164.5 MB. Max. memory is 11.5 GB. * Witness Printer took 75.84 ms. Allocated memory is still 1.1 GB. Free memory was 855.0 MB in the beginning and 848.5 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 231]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 1 error locations. Result: SAFE, OverallTime: 0.9s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 815 SDtfs, 692 SDslu, 1219 SDs, 0 SdLazy, 135 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 266 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 9 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, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 13120 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...