./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_11.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_025f98e8-de44-4d1f-b49b-e8b9086a534a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_025f98e8-de44-4d1f-b49b-e8b9086a534a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_025f98e8-de44-4d1f-b49b-e8b9086a534a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_025f98e8-de44-4d1f-b49b-e8b9086a534a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_11.c -s /tmp/vcloud-vcloud-master/worker/run_dir_025f98e8-de44-4d1f-b49b-e8b9086a534a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_025f98e8-de44-4d1f-b49b-e8b9086a534a/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 56f043bec3037ec37b4a132611abd4a337934428 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:59:07,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:59:07,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:59:08,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:59:08,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:59:08,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:59:08,009 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:59:08,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:59:08,012 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:59:08,013 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:59:08,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:59:08,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:59:08,015 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:59:08,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:59:08,017 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:59:08,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:59:08,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:59:08,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:59:08,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:59:08,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:59:08,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:59:08,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:59:08,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:59:08,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:59:08,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:59:08,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:59:08,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:59:08,029 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:59:08,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:59:08,030 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:59:08,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:59:08,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:59:08,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:59:08,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:59:08,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:59:08,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:59:08,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:59:08,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:59:08,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:59:08,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:59:08,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:59:08,036 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_025f98e8-de44-4d1f-b49b-e8b9086a534a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 12:59:08,048 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:59:08,048 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:59:08,049 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:59:08,049 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:59:08,049 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:59:08,049 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:59:08,049 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:59:08,049 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:59:08,050 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:59:08,050 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:59:08,050 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:59:08,050 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:59:08,050 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:59:08,050 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:59:08,051 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:59:08,051 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:59:08,051 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:59:08,051 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:59:08,051 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:59:08,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:59:08,052 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:59:08,052 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:59:08,052 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:59:08,052 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:59:08,052 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:59:08,052 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:59:08,052 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:59:08,052 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:59:08,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:59:08,053 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:59:08,053 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:59:08,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:59:08,053 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:59:08,053 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:59:08,053 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:59:08,053 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:59:08,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:59:08,053 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:59:08,054 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:59:08,054 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:59:08,054 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_025f98e8-de44-4d1f-b49b-e8b9086a534a/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 -> 56f043bec3037ec37b4a132611abd4a337934428 [2019-12-07 12:59:08,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:59:08,171 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:59:08,173 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:59:08,175 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:59:08,175 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:59:08,176 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_025f98e8-de44-4d1f-b49b-e8b9086a534a/bin/utaipan/../../sv-benchmarks/c/locks/test_locks_11.c [2019-12-07 12:59:08,219 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_025f98e8-de44-4d1f-b49b-e8b9086a534a/bin/utaipan/data/06cbbf140/a9788f8459a24604885791bb2b22cf6e/FLAG1a1129ef8 [2019-12-07 12:59:08,589 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:59:08,589 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_025f98e8-de44-4d1f-b49b-e8b9086a534a/sv-benchmarks/c/locks/test_locks_11.c [2019-12-07 12:59:08,594 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_025f98e8-de44-4d1f-b49b-e8b9086a534a/bin/utaipan/data/06cbbf140/a9788f8459a24604885791bb2b22cf6e/FLAG1a1129ef8 [2019-12-07 12:59:09,006 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_025f98e8-de44-4d1f-b49b-e8b9086a534a/bin/utaipan/data/06cbbf140/a9788f8459a24604885791bb2b22cf6e [2019-12-07 12:59:09,012 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:59:09,014 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:59:09,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:59:09,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:59:09,020 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:59:09,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:59:09" (1/1) ... [2019-12-07 12:59:09,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e84576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:09, skipping insertion in model container [2019-12-07 12:59:09,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:59:09" (1/1) ... [2019-12-07 12:59:09,031 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:59:09,046 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:59:09,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:59:09,152 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:59:09,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:59:09,213 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:59:09,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:09 WrapperNode [2019-12-07 12:59:09,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:59:09,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:59:09,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:59:09,215 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:59:09,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:09" (1/1) ... [2019-12-07 12:59:09,224 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:09" (1/1) ... [2019-12-07 12:59:09,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:59:09,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:59:09,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:59:09,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:59:09,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:09" (1/1) ... [2019-12-07 12:59:09,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:09" (1/1) ... [2019-12-07 12:59:09,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:09" (1/1) ... [2019-12-07 12:59:09,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:09" (1/1) ... [2019-12-07 12:59:09,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:09" (1/1) ... [2019-12-07 12:59:09,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:09" (1/1) ... [2019-12-07 12:59:09,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:09" (1/1) ... [2019-12-07 12:59:09,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:59:09,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:59:09,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:59:09,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:59:09,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025f98e8-de44-4d1f-b49b-e8b9086a534a/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 12:59:09,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:59:09,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:59:09,582 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:59:09,583 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-07 12:59:09,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:59:09 BoogieIcfgContainer [2019-12-07 12:59:09,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:59:09,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:59:09,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:59:09,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:59:09,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:59:09" (1/3) ... [2019-12-07 12:59:09,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56665e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:59:09, skipping insertion in model container [2019-12-07 12:59:09,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:59:09" (2/3) ... [2019-12-07 12:59:09,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56665e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:59:09, skipping insertion in model container [2019-12-07 12:59:09,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:59:09" (3/3) ... [2019-12-07 12:59:09,588 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2019-12-07 12:59:09,595 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:59:09,600 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:59:09,607 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 12:59:09,622 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:59:09,622 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:59:09,622 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:59:09,622 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:59:09,622 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:59:09,623 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:59:09,623 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:59:09,623 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:59:09,632 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-12-07 12:59:09,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 12:59:09,636 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:09,636 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 12:59:09,636 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:09,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:09,640 INFO L82 PathProgramCache]: Analyzing trace with hash 932482347, now seen corresponding path program 1 times [2019-12-07 12:59:09,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:59:09,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018579980] [2019-12-07 12:59:09,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:09,761 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 12:59:09,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018579980] [2019-12-07 12:59:09,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:09,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:09,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212255614] [2019-12-07 12:59:09,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:09,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:59:09,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:09,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:09,776 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2019-12-07 12:59:09,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:09,816 INFO L93 Difference]: Finished difference Result 62 states and 105 transitions. [2019-12-07 12:59:09,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:09,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 12:59:09,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:09,825 INFO L225 Difference]: With dead ends: 62 [2019-12-07 12:59:09,825 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 12:59:09,827 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 12:59:09,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 12:59:09,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 27. [2019-12-07 12:59:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 12:59:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 47 transitions. [2019-12-07 12:59:09,851 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 47 transitions. Word has length 6 [2019-12-07 12:59:09,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:09,851 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 47 transitions. [2019-12-07 12:59:09,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 47 transitions. [2019-12-07 12:59:09,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 12:59:09,852 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:09,852 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:09,852 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:09,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:09,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1157605292, now seen corresponding path program 1 times [2019-12-07 12:59:09,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:59:09,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167800824] [2019-12-07 12:59:09,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:09,890 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 12:59:09,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167800824] [2019-12-07 12:59:09,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:09,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:09,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193093465] [2019-12-07 12:59:09,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:09,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:59:09,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:09,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:09,893 INFO L87 Difference]: Start difference. First operand 27 states and 47 transitions. Second operand 4 states. [2019-12-07 12:59:09,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:09,908 INFO L93 Difference]: Finished difference Result 51 states and 87 transitions. [2019-12-07 12:59:09,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:09,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 12:59:09,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:09,909 INFO L225 Difference]: With dead ends: 51 [2019-12-07 12:59:09,909 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 12:59:09,910 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 12:59:09,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 12:59:09,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 27. [2019-12-07 12:59:09,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 12:59:09,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2019-12-07 12:59:09,914 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 7 [2019-12-07 12:59:09,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:09,914 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 46 transitions. [2019-12-07 12:59:09,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:09,914 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2019-12-07 12:59:09,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 12:59:09,914 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:09,914 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:09,914 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:09,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:09,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1525812320, now seen corresponding path program 1 times [2019-12-07 12:59:09,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:59:09,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866597822] [2019-12-07 12:59:09,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:09,949 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 12:59:09,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866597822] [2019-12-07 12:59:09,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:09,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:09,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520538382] [2019-12-07 12:59:09,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:09,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:59:09,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:09,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:09,950 INFO L87 Difference]: Start difference. First operand 27 states and 46 transitions. Second operand 4 states. [2019-12-07 12:59:09,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:09,963 INFO L93 Difference]: Finished difference Result 49 states and 82 transitions. [2019-12-07 12:59:09,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:09,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 12:59:09,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:09,964 INFO L225 Difference]: With dead ends: 49 [2019-12-07 12:59:09,964 INFO L226 Difference]: Without dead ends: 47 [2019-12-07 12:59:09,965 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 12:59:09,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-07 12:59:09,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 27. [2019-12-07 12:59:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 12:59:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 45 transitions. [2019-12-07 12:59:09,968 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 45 transitions. Word has length 8 [2019-12-07 12:59:09,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:09,968 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 45 transitions. [2019-12-07 12:59:09,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:09,968 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 45 transitions. [2019-12-07 12:59:09,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 12:59:09,969 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:09,969 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:09,969 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:09,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:09,969 INFO L82 PathProgramCache]: Analyzing trace with hash -55327959, now seen corresponding path program 1 times [2019-12-07 12:59:09,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:59:09,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534522458] [2019-12-07 12:59:09,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:10,000 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 12:59:10,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534522458] [2019-12-07 12:59:10,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:10,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:10,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671900286] [2019-12-07 12:59:10,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:10,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:59:10,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:10,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:10,002 INFO L87 Difference]: Start difference. First operand 27 states and 45 transitions. Second operand 4 states. [2019-12-07 12:59:10,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:10,016 INFO L93 Difference]: Finished difference Result 47 states and 77 transitions. [2019-12-07 12:59:10,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:10,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 12:59:10,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:10,017 INFO L225 Difference]: With dead ends: 47 [2019-12-07 12:59:10,017 INFO L226 Difference]: Without dead ends: 45 [2019-12-07 12:59:10,018 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 12:59:10,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-07 12:59:10,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 27. [2019-12-07 12:59:10,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 12:59:10,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 44 transitions. [2019-12-07 12:59:10,021 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 44 transitions. Word has length 9 [2019-12-07 12:59:10,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:10,021 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 44 transitions. [2019-12-07 12:59:10,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:10,021 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 44 transitions. [2019-12-07 12:59:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 12:59:10,021 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:10,021 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:10,021 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:10,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:10,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1714952683, now seen corresponding path program 1 times [2019-12-07 12:59:10,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:59:10,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258696232] [2019-12-07 12:59:10,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:10,046 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 12:59:10,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258696232] [2019-12-07 12:59:10,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:10,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:10,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571103227] [2019-12-07 12:59:10,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:10,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:59:10,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:10,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:10,048 INFO L87 Difference]: Start difference. First operand 27 states and 44 transitions. Second operand 4 states. [2019-12-07 12:59:10,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:10,062 INFO L93 Difference]: Finished difference Result 45 states and 72 transitions. [2019-12-07 12:59:10,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:10,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 12:59:10,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:10,064 INFO L225 Difference]: With dead ends: 45 [2019-12-07 12:59:10,064 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 12:59:10,064 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 12:59:10,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 12:59:10,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2019-12-07 12:59:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 12:59:10,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 43 transitions. [2019-12-07 12:59:10,068 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 43 transitions. Word has length 10 [2019-12-07 12:59:10,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:10,068 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 43 transitions. [2019-12-07 12:59:10,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:10,068 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 43 transitions. [2019-12-07 12:59:10,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:59:10,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:10,069 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:10,069 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:10,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:10,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1623711234, now seen corresponding path program 1 times [2019-12-07 12:59:10,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:59:10,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197972444] [2019-12-07 12:59:10,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:10,094 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 12:59:10,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197972444] [2019-12-07 12:59:10,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:10,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:10,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179079106] [2019-12-07 12:59:10,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:10,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:59:10,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:10,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:10,095 INFO L87 Difference]: Start difference. First operand 27 states and 43 transitions. Second operand 4 states. [2019-12-07 12:59:10,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:10,108 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2019-12-07 12:59:10,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:10,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 12:59:10,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:10,110 INFO L225 Difference]: With dead ends: 43 [2019-12-07 12:59:10,110 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 12:59:10,110 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 12:59:10,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 12:59:10,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2019-12-07 12:59:10,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 12:59:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. [2019-12-07 12:59:10,113 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 42 transitions. Word has length 11 [2019-12-07 12:59:10,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:10,113 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 42 transitions. [2019-12-07 12:59:10,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:10,113 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 42 transitions. [2019-12-07 12:59:10,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 12:59:10,114 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:10,114 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:10,114 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:10,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:10,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1204774026, now seen corresponding path program 1 times [2019-12-07 12:59:10,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:59:10,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88646218] [2019-12-07 12:59:10,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:10,142 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 12:59:10,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88646218] [2019-12-07 12:59:10,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:10,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:10,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916188987] [2019-12-07 12:59:10,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:10,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:59:10,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:10,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:10,144 INFO L87 Difference]: Start difference. First operand 27 states and 42 transitions. Second operand 4 states. [2019-12-07 12:59:10,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:10,157 INFO L93 Difference]: Finished difference Result 41 states and 62 transitions. [2019-12-07 12:59:10,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:10,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 12:59:10,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:10,158 INFO L225 Difference]: With dead ends: 41 [2019-12-07 12:59:10,158 INFO L226 Difference]: Without dead ends: 39 [2019-12-07 12:59:10,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 12:59:10,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-07 12:59:10,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2019-12-07 12:59:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 12:59:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2019-12-07 12:59:10,160 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 41 transitions. Word has length 12 [2019-12-07 12:59:10,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:10,161 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 41 transitions. [2019-12-07 12:59:10,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 41 transitions. [2019-12-07 12:59:10,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:59:10,161 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:10,161 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:10,161 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:10,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:10,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1306495789, now seen corresponding path program 1 times [2019-12-07 12:59:10,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:59:10,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970516538] [2019-12-07 12:59:10,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:10,181 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 12:59:10,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970516538] [2019-12-07 12:59:10,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:10,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:10,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174076700] [2019-12-07 12:59:10,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:10,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:59:10,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:10,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:10,183 INFO L87 Difference]: Start difference. First operand 27 states and 41 transitions. Second operand 4 states. [2019-12-07 12:59:10,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:10,194 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2019-12-07 12:59:10,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:10,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 12:59:10,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:10,195 INFO L225 Difference]: With dead ends: 39 [2019-12-07 12:59:10,195 INFO L226 Difference]: Without dead ends: 37 [2019-12-07 12:59:10,195 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 12:59:10,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-07 12:59:10,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2019-12-07 12:59:10,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 12:59:10,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2019-12-07 12:59:10,198 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 40 transitions. Word has length 13 [2019-12-07 12:59:10,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:10,198 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 40 transitions. [2019-12-07 12:59:10,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:10,198 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2019-12-07 12:59:10,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:59:10,199 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:10,199 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:10,199 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:10,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:10,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1846448385, now seen corresponding path program 1 times [2019-12-07 12:59:10,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:59:10,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392116924] [2019-12-07 12:59:10,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:10,222 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 12:59:10,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392116924] [2019-12-07 12:59:10,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:10,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:10,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991579675] [2019-12-07 12:59:10,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:10,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:59:10,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:10,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:10,224 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. Second operand 4 states. [2019-12-07 12:59:10,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:10,234 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2019-12-07 12:59:10,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:10,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 12:59:10,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:10,235 INFO L225 Difference]: With dead ends: 37 [2019-12-07 12:59:10,235 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 12:59:10,235 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 12:59:10,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 12:59:10,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-12-07 12:59:10,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 12:59:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2019-12-07 12:59:10,237 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 39 transitions. Word has length 14 [2019-12-07 12:59:10,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:10,238 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 39 transitions. [2019-12-07 12:59:10,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:10,238 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2019-12-07 12:59:10,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:59:10,238 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:10,238 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:10,238 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:10,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:10,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1405109336, now seen corresponding path program 1 times [2019-12-07 12:59:10,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:59:10,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372835103] [2019-12-07 12:59:10,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:10,264 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 12:59:10,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372835103] [2019-12-07 12:59:10,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:10,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:10,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731393589] [2019-12-07 12:59:10,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:10,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:59:10,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:10,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:10,265 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand 4 states. [2019-12-07 12:59:10,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:10,275 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2019-12-07 12:59:10,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:10,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 12:59:10,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:10,276 INFO L225 Difference]: With dead ends: 35 [2019-12-07 12:59:10,276 INFO L226 Difference]: Without dead ends: 33 [2019-12-07 12:59:10,276 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 12:59:10,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-07 12:59:10,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-12-07 12:59:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 12:59:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2019-12-07 12:59:10,278 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 38 transitions. Word has length 15 [2019-12-07 12:59:10,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:10,278 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 38 transitions. [2019-12-07 12:59:10,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:10,278 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2019-12-07 12:59:10,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:59:10,279 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:59:10,279 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:59:10,279 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:59:10,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:59:10,279 INFO L82 PathProgramCache]: Analyzing trace with hash -608500364, now seen corresponding path program 1 times [2019-12-07 12:59:10,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:59:10,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410137513] [2019-12-07 12:59:10,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:59:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:59:10,303 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 12:59:10,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410137513] [2019-12-07 12:59:10,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:59:10,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:59:10,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534948359] [2019-12-07 12:59:10,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:59:10,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:59:10,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:59:10,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:59:10,304 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. Second operand 4 states. [2019-12-07 12:59:10,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:59:10,316 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2019-12-07 12:59:10,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:59:10,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 12:59:10,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:59:10,317 INFO L225 Difference]: With dead ends: 29 [2019-12-07 12:59:10,317 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 12:59:10,317 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 12:59:10,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 12:59:10,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 12:59:10,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 12:59:10,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 12:59:10,317 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2019-12-07 12:59:10,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:59:10,318 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:59:10,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:59:10,318 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 12:59:10,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 12:59:10,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 12:59:10,328 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 12:59:10,329 INFO L249 CegarLoopResult]: At program point L176(lines 4 177) the Hoare annotation is: true [2019-12-07 12:59:10,329 INFO L246 CegarLoopResult]: For program point L143(line 143) no Hoare annotation was computed. [2019-12-07 12:59:10,329 INFO L246 CegarLoopResult]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-12-07 12:59:10,329 INFO L246 CegarLoopResult]: For program point L168(line 168) no Hoare annotation was computed. [2019-12-07 12:59:10,329 INFO L242 CegarLoopResult]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2019-12-07 12:59:10,329 INFO L246 CegarLoopResult]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 12:59:10,329 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 12:59:10,329 INFO L246 CegarLoopResult]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 12:59:10,329 INFO L246 CegarLoopResult]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 12:59:10,329 INFO L246 CegarLoopResult]: For program point L128(line 128) no Hoare annotation was computed. [2019-12-07 12:59:10,330 INFO L246 CegarLoopResult]: For program point L153(line 153) no Hoare annotation was computed. [2019-12-07 12:59:10,330 INFO L246 CegarLoopResult]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 12:59:10,330 INFO L246 CegarLoopResult]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 12:59:10,330 INFO L246 CegarLoopResult]: For program point L138(line 138) no Hoare annotation was computed. [2019-12-07 12:59:10,330 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 12:59:10,330 INFO L246 CegarLoopResult]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 12:59:10,330 INFO L246 CegarLoopResult]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 12:59:10,330 INFO L246 CegarLoopResult]: For program point L123(line 123) no Hoare annotation was computed. [2019-12-07 12:59:10,330 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2019-12-07 12:59:10,330 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 12:59:10,330 INFO L249 CegarLoopResult]: At program point L173(lines 5 177) the Hoare annotation is: true [2019-12-07 12:59:10,330 INFO L246 CegarLoopResult]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 12:59:10,330 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 12:59:10,331 INFO L246 CegarLoopResult]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 12:59:10,331 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 12:59:10,331 INFO L246 CegarLoopResult]: For program point L158(line 158) no Hoare annotation was computed. [2019-12-07 12:59:10,331 INFO L246 CegarLoopResult]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 12:59:10,331 INFO L246 CegarLoopResult]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 12:59:10,331 INFO L249 CegarLoopResult]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2019-12-07 12:59:10,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:59:10 BoogieIcfgContainer [2019-12-07 12:59:10,338 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:59:10,338 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:59:10,338 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:59:10,338 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:59:10,339 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:59:09" (3/4) ... [2019-12-07 12:59:10,341 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 12:59:10,348 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-12-07 12:59:10,349 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 12:59:10,349 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 12:59:10,399 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_025f98e8-de44-4d1f-b49b-e8b9086a534a/bin/utaipan/witness.graphml [2019-12-07 12:59:10,399 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:59:10,401 INFO L168 Benchmark]: Toolchain (without parser) took 1387.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 939.9 MB in the beginning and 941.3 MB in the end (delta: -1.4 MB). Peak memory consumption was 108.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:59:10,401 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:59:10,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -163.9 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:59:10,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:59:10,402 INFO L168 Benchmark]: Boogie Preprocessor took 16.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:59:10,402 INFO L168 Benchmark]: RCFGBuilder took 327.78 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: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:59:10,403 INFO L168 Benchmark]: TraceAbstraction took 753.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 946.8 MB in the end (delta: 113.6 MB). Peak memory consumption was 113.6 MB. Max. memory is 11.5 GB. [2019-12-07 12:59:10,403 INFO L168 Benchmark]: Witness Printer took 61.43 ms. Allocated memory is still 1.1 GB. Free memory was 946.8 MB in the beginning and 941.3 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:59:10,404 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 198.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -163.9 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 327.78 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: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 753.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 946.8 MB in the end (delta: 113.6 MB). Peak memory consumption was 113.6 MB. Max. memory is 11.5 GB. * Witness Printer took 61.43 ms. Allocated memory is still 1.1 GB. Free memory was 946.8 MB in the beginning and 941.3 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Result: SAFE, OverallTime: 0.6s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 445 SDtfs, 376 SDslu, 653 SDs, 0 SdLazy, 99 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred 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, 11 MinimizatonAttempts, 150 StatesRemovedByMinimization, 10 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 6050 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...